WO2016082559A1 - Procédé d'écriture de données et dispositif de stockage - Google Patents

Procédé d'écriture de données et dispositif de stockage Download PDF

Info

Publication number
WO2016082559A1
WO2016082559A1 PCT/CN2015/083885 CN2015083885W WO2016082559A1 WO 2016082559 A1 WO2016082559 A1 WO 2016082559A1 CN 2015083885 W CN2015083885 W CN 2015083885W WO 2016082559 A1 WO2016082559 A1 WO 2016082559A1
Authority
WO
WIPO (PCT)
Prior art keywords
data
data blocks
index
memory
block
Prior art date
Application number
PCT/CN2015/083885
Other languages
English (en)
Chinese (zh)
Inventor
叶茂
Original Assignee
华为技术有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 华为技术有限公司 filed Critical 华为技术有限公司
Publication of WO2016082559A1 publication Critical patent/WO2016082559A1/fr

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F12/00—Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02—Addressing or allocation; Relocation
    • G06F12/0223—User address space allocation, e.g. contiguous or non contiguous base addressing
    • G06F12/023—Free address space management
    • G06F12/0238—Memory management in non-volatile memory, e.g. resistive RAM or ferroelectric memory
    • G06F12/0246—Memory management in non-volatile memory, e.g. resistive RAM or ferroelectric memory in block erasable memory, e.g. flash memory
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F12/00—Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02—Addressing or allocation; Relocation

Definitions

  • the present invention relates to the field of electronic technologies, and in particular, to a data writing method and a storage device.
  • SSD Solid State Drive
  • Chinese Solid State Drive
  • shockproof small size, zero noise, etc.
  • the number of writes to a typical SSD is limited.
  • the data block on the SSD is modified by using ROW (English: Redirection On Write; Chinese: write-time redirection) technology.
  • ROW Redirection On Write
  • Existing file system based on ROW technology on SSD generally organizes the entire file system into a tree structure. The leaf nodes in the tree structure are used to store data blocks, the parent nodes and roots are index data, and the index data is used to index data blocks.
  • the embodiment of the present invention provides a data writing method and a storage device, which are used to solve the problem that each modified data block existing in the prior art will modify its index data correspondingly, causing a large write overhead on the SSD, resulting in SSD performance. And the technical problem of declining lifespan achieves the technical effect of reducing the write overhead caused by modifying the data block to the SSD, improving the performance of the SSD, and prolonging the life of the SSD.
  • a first aspect of the embodiments of the present invention provides a data writing method, where the method is applied to a storage device, where the storage device includes a processor, a memory, and a storage medium, and the data blocks in the storage medium are organized in a tree structure.
  • a leaf node of the tree is used to save a data block
  • a parent node and a root node of the tree are used to store index data
  • the index data is used to index the data block
  • the method is performed by the processor.
  • the method before the modifying is directed to the index data of the at least two data blocks, the method further includes:
  • the at least two data blocks are deleted from the memory.
  • the modifying is directed to the index data of the at least two data blocks, and specifically includes:
  • the modified index data of the at least two data blocks points to a storage address of the at least two data blocks
  • a second aspect of the embodiments of the present invention provides a storage device, where the storage device includes a processor, a memory, and a storage medium, where data blocks in the storage medium are organized in a tree structure, and leaf nodes of the tree are used to save data.
  • a block, a parent node and a root node of the tree are used to store index data, the index data is used to index the data block, and the processor is configured to:
  • the processor is further configured to:
  • the at least two data blocks are deleted from the memory before the modification points to the index data of the at least two data blocks.
  • the processor is specifically configured to:
  • the present invention first, modifying a plurality of data blocks in the memory, and then modifying the plurality of data blocks At least two data blocks having the same index data are determined in the block, then at least two data blocks are written to the storage medium, and finally the index data directed to the at least two data blocks is modified.
  • the index data of the modified data block is updated, and the modified data block is used in the embodiment of the present invention. Determining at least two data blocks having the same index data, and writing at least two data blocks having the same index data from the memory to the storage medium, and batch updating the index data common to the at least two data blocks, thereby reducing the index
  • the number of times the data is updated is implemented to reduce the write overhead caused by modifying the data block to the storage device.
  • FIG. 1 is a schematic diagram of a file system to which an information processing method according to an embodiment of the present invention is applied;
  • FIG. 2 is a flowchart of an information processing method according to an embodiment of the present invention.
  • FIG. 3 is a flowchart of updating index data in an embodiment of the present invention.
  • FIG. 4 is a schematic structural diagram of hardware of a storage device according to an embodiment of the present invention.
  • the embodiment of the present invention provides a data writing method and a storage device, which are used to solve the problem that each modified data block existing in the prior art will modify its index data correspondingly, causing a large write overhead on the SSD, resulting in SSD performance. And the technical problem of declining lifespan achieves the technical effect of reducing the write overhead caused by modifying the data block to the SSD, improving the performance of the SSD, and prolonging the life of the SSD.
  • a plurality of data blocks are modified in a memory, and then at least two data blocks having the same index data are determined from the modified plurality of data blocks, and then at least two data blocks are written to the memory.
  • the storage medium is finally modified to index data pointing to at least two data blocks.
  • the index data of the modified data block is updated, and the modified data block is used in the embodiment of the present invention. Determining at least two data blocks having the same index data, and writing at least two data blocks having the same index data from the memory to the storage medium, and batch updating the index data common to the at least two data blocks, thereby reducing the index
  • the number of times the data is updated is implemented to reduce the write overhead caused by modifying the data block to the storage device.
  • Embodiments of the present invention provide a data writing method, which is applied to a storage device.
  • FIG. 4 is a schematic diagram showing the hardware structure of the storage device 40.
  • the storage device 40 may be an SSD (English: Solid State Drive; Chinese: SSD) including a processor 41, a memory 42 and a storage medium 43, and the storage medium 43 may be a Flash granule or other type of hard disk.
  • Data can be stored in the storage medium 43. Specifically, the data blocks in the storage medium 43 are organized in a tree structure.
  • FIG. 1 is a schematic diagram of a tree structure in a storage medium 43.
  • the leaf node of the tree is used to save the data block
  • the parent node and the root node of the tree are used to store the index data
  • the index data is used to index the data block.
  • the root of the tree is used to store the index data A
  • the parent node is used to store the index data B and the index data C
  • the leaf node is used to store the data block D, the data block E, the data block F, and the data block H.
  • the storage device 40 can be connected to the server 400 as a separate electronic device.
  • the storage device 40 can also serve as an element of the server 400.
  • the server 400 sends the write data to the storage device 40.
  • the processor 41 of the storage device 40 executes the writing method provided by the embodiment of the present invention in response to the request for writing the data.
  • FIG. 2 is a flowchart of a data writing method according to an embodiment of the present invention.
  • the data writing method provided by the embodiment of the present invention which may be applied to the storage device 40 described in FIG. 4, is executed by the processor 41, and includes the following steps:
  • Step 21 Receive a plurality of data blocks and write the memory
  • Step 22 Modify the plurality of data blocks in the memory
  • Step 23 Determine at least two data blocks from the modified plurality of data blocks, where index data of the at least two data blocks are the same;
  • Step 24 Allocating a storage address in the storage medium for the at least two data blocks, and writing the at least two data blocks to the storage medium according to the allocated storage address;
  • Step 25 Modify index data pointing to the at least two data blocks.
  • a request to write data is sent to the storage device 40, and after the storage device 40 receives the request to write the data, the processor 41 of the storage device responds to the written data.
  • Request receive multiple data blocks sent by the server, and then write to memory.
  • the processor 41 receives the data block D, the data block E, the data block F, and the data block H, and writes them into the memory 42, and stores them in the leaf nodes of the tree.
  • the request for modifying the data is sent to the storage device 40.
  • the processor 41 of the storage device responds to the request to modify the data, first.
  • the data block is modified in the memory to generate a dirty data block, wherein the dirty data block is a data block that is modified in the memory and is not written into the storage medium.
  • the modification of the data block D in FIG. 1 is taken as an example.
  • the index data A held by the root of the tree in the memory is indexed to the data block D by the index data B held by the parent node, and then the data block D is modified into the data block S,
  • the data block S is stored in the memory. Since the data block S is only modified in the memory, the data block S has not been written into the storage medium, so the data block S is a dirty data block, and the index data of the dirty data block S is: an index Data B.
  • the data block E can be modified to generate a dirty data block H, and the index data of the dirty data block H is: index data B.
  • step 23 may be performed to determine at least two data blocks from the modified plurality of data blocks, and the index data of the at least two data blocks is the same.
  • the index data of the dirty data block S is: index data B
  • the index data of the dirty data block H is: index data B
  • step 24 can be performed to write at least two dirty data blocks with the same index data from the memory into the storage medium.
  • the dirty data block is first allocated a storage address in the storage medium.
  • the storage address in the storage medium corresponds to the physical block number, and the physical block number is usually used to represent the storage address. As long as a dirty data block is generated, the physical block number can be assigned to the generated dirty data block.
  • the physical block number assigned to the dirty data block S is 01
  • the physical block number assigned to the dirty data block H is 02
  • the physical block number 01 and Physical block number 02 characterizes the storage addresses of the storage medium as a and b, respectively.
  • the dirty data block S is written from the memory to the memory address a characterized by the physical block number 01
  • the dirty data block H is written from the memory to the memory address b represented by the physical block number 02.
  • step 25 can be performed: modifying the index data of the at least two dirty data blocks that are the same as the index data.
  • FIG. 3 is a flowchart of updating index data in an embodiment of the present invention. Updating the index data specifically includes the following steps:
  • Step 31 Create a record table for the at least two data blocks, and record the at least two data blocks at a storage address in the storage medium;
  • Step 32 Modify, according to the record table, index data that points to the at least two data blocks in the memory, and the modified index data points to a storage address of the at least two data blocks;
  • Step 33 Write the modified index data of the at least two data blocks to the storage medium.
  • Step 31 is explained first.
  • the dirty data block in the embodiment of the present invention, in order to directly write the dirty data block from the memory into the storage medium, the dirty data block can be indexed and needs to be in the memory.
  • the correspondence between the index data of the dirty data block and the physical block number is stored. That is, dirty data block records are created for dirty data blocks.
  • dirty data block records can be created for dirty data blocks in non-volatile memory.
  • the dirty data block record Since the function of the dirty data block record is to index the dirty data block, in order to avoid the loss of the dirty data block record after the power failure, the dirty data block cannot be indexed, and the dirty data block record can be stored in the non-volatile memory to ensure the dirty data. Storage security for block records.
  • a dirty data block record is created for the dirty data block S, and the index data of the dirty data block S is recorded as: index data B, and the corresponding physical block number is 01. .
  • a dirty data block record is created for the dirty data block H, and the index data of the dirty data block H is recorded as: index data B, and the corresponding physical block number is 02.
  • a mapping table may be established in the memory, and the mapping table is used to record the logical block number and the physical block number of the dirty data block.
  • the mapping relationship, the logical block number can be obtained from the index data.
  • dirty block records are stored sequentially in non-volatile memory
  • you want to index to a dirty block you must search sequentially in the record table formed by the dirty block record to find the time.
  • the logical block number of the dirty data block can be obtained according to the index data of the dirty data block, and then the mapping of the logical block number to the physical block number is established.
  • indexing a dirty data block it is convenient and quick to quickly determine the physical block number of the dirty data block according to the mapping relationship.
  • the index data of the dirty data block S is: index data B
  • the index data of the dirty data block H is: index data B
  • the original index data B can be indexed to the data block D and the data block E
  • the data block D The logical block number is 111
  • the logical block number of the data block E is 222, so it can be determined that the logical block number of the dirty data block S is 111
  • the logical block number of the dirty data block H is 222, that is, the original data block and the modified data block are obtained.
  • the logical block number of the dirty data block is the same.
  • a mapping table is then created in which the logical block number 111 is mapped to physical block number 01 and the logical block number 222 is mapped to physical block number 02.
  • the corresponding physical block number can be quickly determined to be 01 according to the mapping table. If a record table formed based on a plurality of dirty data blocks is recorded, it is necessary to search sequentially in the record table. If the record of the dirty block with the logical block number 111 is at the end of the record table, it takes a long time to index. A dirty block with a logical block number of 111.
  • mapping table Although it is convenient and efficient to use a mapping table to index dirty data blocks, because the mapping table is only stored in memory, once the power is turned off, the mapping table disappears. Therefore, after the power is turned off, the formed record table is recorded according to the plurality of dirty data blocks, and the mapping table is generated. Mapping tables are often used to index dirty data blocks.
  • step 32 and step 33 are performed.
  • the index data B originally records the physical block number 03 of the data block D and the physical block number 04 of the data block E. Since the data block D and the data block E are respectively modified, the dirty data block S and the dirty data are generated. Block H, therefore, the index data B should be correspondingly changed to record the physical block number 01 of the dirty data block S and the physical block number 02 of the dirty data block H. Therefore, the index data B is modified in the memory, and the dirty data block M is generated.
  • the dirty data block M records the physical block number 01 of the dirty data block S and the physical block number 02 of the dirty data block H.
  • the index data C originally records the physical block number 05 of the data block F and the physical block number 06 of the data block K, assuming that after modifying the data block D and the data block E, the data block F and the data block K are also modified to generate
  • the index data common to both is index data C. Therefore, the index data C is correspondingly changed to record the physical block numbers 07 and 08 of the dirty data block W and the dirty data block R. Therefore, the index data C is modified in the memory, and the dirty data block N is generated.
  • the dirty data block N records the physical block number 07 of the dirty data block W and the dirty data block R. Physical block number 08.
  • the process of specifically updating the index data B and the index data C is: modifying the index data B and the index data C in the memory respectively, and generating the dirty data block M and the dirty data block W. Then, the physical block numbers assigned to the dirty data block M and the dirty data block W in the storage medium are 09 and 10, respectively, and the dirty data block M and the dirty data block W are written from the memory to the physical block numbers 09 and 10, respectively.
  • index data A Since the index data of the dirty data block M is: index data A, the index data of the dirty data block W is: index data A. Therefore, the index data corresponding to the two is index data A.
  • the index data A originally records the physical block number 11 of the index data B and the physical block number 12 of the index data C. Since the index data B and the index data C are respectively modified in the memory, the dirty data block M and the dirty data block W are generated. . Therefore, the index data A should be changed correspondingly to the physical block number 09 of the dirty data block M and the physical block number 10 of the dirty data block W.
  • the index data A is modified in the memory to generate a dirty data block T. Then, the physical block number assigned to the dirty data block T in the storage medium is 13, and the dirty data block T is written from the memory into the storage address represented by the physical block number 13.
  • the method further includes:
  • the modified index data is deleted from the memory.
  • the modified index data can be indexed in the storage medium, and the modified data in the memory is not necessary to be stored, so In order to improve the memory utilization, the modified index data may be deleted from the memory after the modified index data is written from the memory to the storage medium.
  • the dirty data block and the modified index data can be directly indexed from the storage medium, and the dirty data in the non-volatile memory.
  • the data block record table and the mapping table in the memory are also unnecessary to be stored, so in order to improve the memory utilization, the modified index data can be read from the memory into the storage medium, and the modified index data is Deleted in memory.
  • the method when the specified dirty data block needs to be read, the method further includes:
  • the specified physical block number corresponding to the specified logical block number is searched from the mapping table according to the specified logical block number of the specified dirty data block;
  • the designated dirty data block is read from the storage medium according to the specified physical block number.
  • the mapping table can be used to find the logical block number of the specified dirty data block from the mapping table, thereby finding the corresponding The physical block number, the specified dirty data block is read from the storage address represented by the physical block number.
  • FIG. 4 is a schematic diagram showing the hardware structure of the storage device 40.
  • the storage device 40 may be an SSD (English: Solid State Drive; Chinese: SSD) including a processor 41, a memory 42 and a storage medium 43, and the storage medium 43 may be a Flash granule or other type of hard disk.
  • the data blocks in the storage medium 43 are organized in a tree structure, the leaf nodes of the tree are used to store data blocks, the parent nodes and root nodes of the tree are used to store index data, and the index data is used to index data blocks.
  • the storage device 40 can be connected to the server 400 as a separate electronic device.
  • the storage device 40 can also serve as an element of the server 400.
  • the server 400 sends the write data to the storage device 40.
  • the processor 41 of the storage device 40 executes the writing method provided by the embodiment of the present invention in response to the request for writing the data.
  • the processor 41 is configured to:
  • the processor 41 is further configured to:
  • the at least two data blocks are deleted from the memory before the modification points to the index data of the at least two data blocks.
  • the processor 41 is specifically configured to:
  • a plurality of data blocks are first modified in a memory, and then at least two data blocks having the same index data are determined from the modified plurality of data blocks, and then at least two data blocks are written to the storage medium. Finally, the index data pointing to at least two data blocks is modified.
  • each time the modified data block is written from the memory to the storage medium it must be repaired.
  • at least two data blocks with the same index data are determined from the modified data block, and at least two data blocks with the same index data are written from the memory.
  • the index data common to the at least two data blocks is batch-updated, so that the number of times the index data is updated is reduced, and the write overhead caused by the modified data block to the storage device is reduced.
  • embodiments of the present invention can be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment, or a combination of software and hardware. Moreover, the invention can take the form of a computer program product embodied on one or more computer-usable storage media (including but not limited to disk storage and optical storage, etc.) including computer usable program code.
  • the computer program instructions can also be stored in a computer readable memory that can direct a computer or other programmable data processing device to operate in a particular manner, such that the instructions stored in the computer readable memory produce an article of manufacture comprising the instruction device.
  • the apparatus implements the functions specified in one or more blocks of a flow or a flow and/or block diagram of the flowchart.
  • These computer program instructions can also be loaded onto a computer or other programmable data processing device such that a series of operational steps are performed on a computer or other programmable device to produce computer-implemented processing for execution on a computer or other programmable device.
  • the instructions provide steps for implementing the functions specified in one or more of the flow or in a block or blocks of a flow diagram.

Abstract

L'invention concerne un procédé d'écriture de données et un dispositif de stockage. Le procédé est appliqué à un dispositif de stockage (40), le dispositif de stockage (40) comprenant un processeur (41), une mémoire (42) et un support de stockage (43). Les blocs de données contenus dans le support de stockage (43) sont organisés en une structure arborescente, des nœuds feuilles de l'arbre sont utilisés pour stocker les blocs de données, et un nœud parent et un nœud racine de l'arbre sont utilisés pour stocker des données d'index, les données d'index servant à indexer les blocs de données. Le procédé est exécuté par le processeur (41) et comprend les étapes consistant à : recevoir une pluralité de blocs de données et écrire la pluralité de blocs de données dans la mémoire (21) ; modifier la pluralité de blocs de données dans la mémoire (22) ; déterminer au moins deux blocs de données pris dans la pluralité de blocs de données modifiés, les données d'index desdits au moins deux blocs de données étant les mêmes (23) ; affecter une adresse de stockage auxdits au moins deux blocs de données du support de stockage, et écrire lesdits au moins deux blocs de données dans le support de stockage selon l'adresse de stockage affectée (24) ; et modifier les données d'index qui pointent vers lesdits au moins deux blocs de données (25).
PCT/CN2015/083885 2014-11-28 2015-07-13 Procédé d'écriture de données et dispositif de stockage WO2016082559A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201410712344.5 2014-11-28
CN201410712344.5A CN104461384B (zh) 2014-11-28 2014-11-28 一种数据写入方法及存储设备

Publications (1)

Publication Number Publication Date
WO2016082559A1 true WO2016082559A1 (fr) 2016-06-02

Family

ID=52907513

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2015/083885 WO2016082559A1 (fr) 2014-11-28 2015-07-13 Procédé d'écriture de données et dispositif de stockage

Country Status (2)

Country Link
CN (1) CN104461384B (fr)
WO (1) WO2016082559A1 (fr)

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104461384B (zh) * 2014-11-28 2017-11-24 华为技术有限公司 一种数据写入方法及存储设备
CN105117415B (zh) * 2015-07-30 2018-07-03 西安交通大学 一种优化的ssd数据更新方法
CN107885803B (zh) * 2017-10-31 2020-05-01 中国地质大学（武汉） 一种大数据写入、读取速度耦合的方法、设备及存储设备
CN108763239A (zh) * 2018-03-22 2018-11-06 厦门欣旅通科技有限公司 一种网络访问次数计算方法及装置
CN109977078B (zh) * 2019-03-26 2020-06-02 广州荔支网络技术有限公司 一种数据的处理方法、装置、计算机设备和存储介质

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102722449A (zh) * 2012-05-24 2012-10-10 中国科学院计算技术研究所 基于SSD的Key-Value型本地存储方法及系统
CN103455437A (zh) * 2012-05-30 2013-12-18 慧荣科技股份有限公司 数据储存装置与数据储存装置操作方法
CN103518364A (zh) * 2013-03-19 2014-01-15 华为技术有限公司 分布式存储系统的数据更新方法及服务器
US20140040199A1 (en) * 2012-07-31 2014-02-06 Wojclech Golab Data Management Using Writeable Snapshots in Multi-Versioned Distributed B-Trees
CN103677670A (zh) * 2013-12-11 2014-03-26 华为技术有限公司 读数据的方法及装置
CN104461384A (zh) * 2014-11-28 2015-03-25 华为技术有限公司 一种数据写入方法及存储设备

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9244833B2 (en) * 2012-05-30 2016-01-26 Silicon Motion, Inc. Data-storage device and flash memory control method
CN103544124B (zh) * 2012-07-16 2018-01-19 上海塞尚通信技术有限公司 Nand Flash存储器的访问方法

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102722449A (zh) * 2012-05-24 2012-10-10 中国科学院计算技术研究所 基于SSD的Key-Value型本地存储方法及系统
CN103455437A (zh) * 2012-05-30 2013-12-18 慧荣科技股份有限公司 数据储存装置与数据储存装置操作方法
US20140040199A1 (en) * 2012-07-31 2014-02-06 Wojclech Golab Data Management Using Writeable Snapshots in Multi-Versioned Distributed B-Trees
CN103518364A (zh) * 2013-03-19 2014-01-15 华为技术有限公司 分布式存储系统的数据更新方法及服务器
CN103677670A (zh) * 2013-12-11 2014-03-26 华为技术有限公司 读数据的方法及装置
CN104461384A (zh) * 2014-11-28 2015-03-25 华为技术有限公司 一种数据写入方法及存储设备

Also Published As

Publication number Publication date
CN104461384A (zh) 2015-03-25
CN104461384B (zh) 2017-11-24

Similar Documents

Publication Publication Date Title
US11099769B1 (en) Copying data without accessing the data
US11226747B2 (en) System and method for copy on write on an SSD
US8799601B1 (en) Techniques for managing deduplication based on recently written extents
US10120795B2 (en) Wear-leveling nandflash memory reading/writing method
JP5369807B2 (ja) ストレージ装置
WO2016082559A1 (fr) Procédé d'écriture de données et dispositif de stockage
TWI603194B (zh) 資料儲存裝置以及其資料存取方法
US9116904B2 (en) File system operation on multi-tiered volume
US8478933B2 (en) Systems and methods for performing deduplicated data processing on tape
JP2016526737A (ja) Ｐｏｓｉｘ互換なファイル・システム、ファイル・リストを生成する方法および記憶デバイス
CN107135662B (zh) 一种差异数据备份方法、存储系统和差异数据备份装置
JP2017204037A (ja) 情報処理装置、重複除去プログラム、及び重複除去方法
US20170083537A1 (en) Mapping logical identifiers using multiple identifier spaces
US9898468B2 (en) Single pass file system repair with copy on write
US11321002B2 (en) Converting a virtual volume between volume types
US20160070648A1 (en) Data storage system and operation method thereof
US11176089B2 (en) Systems and methods for implementing dynamic file systems
US10268421B2 (en) Information recording device and information recording method
KR20090042570A (ko) 파일 관리 장치 및 방법과 기억 장치
US9977599B2 (en) Data deduplication with support for both thick and thin provisioning of storage objects
US8655892B2 (en) Data reorganization
JP2005108239A (ja) 階層的データ構造体にデータを記憶する記憶システム
JPH06103128A (ja) 記憶装置
US10740015B2 (en) Optimized management of file system metadata within solid state storage devices (SSDs)
US20230112221A1 (en) System and method to conserve device lifetime for snapshot generation

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 15863823

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 15863823

Country of ref document: EP

Kind code of ref document: A1