WO2015047697A1 - High performance system providing selective merging of dataframe segments in hardware - Google Patents

High performance system providing selective merging of dataframe segments in hardware Download PDF

Info

Publication number
WO2015047697A1
WO2015047697A1 PCT/US2014/054426 US2014054426W WO2015047697A1 WO 2015047697 A1 WO2015047697 A1 WO 2015047697A1 US 2014054426 W US2014054426 W US 2014054426W WO 2015047697 A1 WO2015047697 A1 WO 2015047697A1
Authority
WO
WIPO (PCT)
Prior art keywords
logical
logical page
page
data
blocks
Prior art date
Application number
PCT/US2014/054426
Other languages
French (fr)
Other versions
WO2015047697A9 (en
Inventor
Jack W. Flinsbaugh
Justin Jones
Rodney N. Mullendore
Andrew J. Tomlin
Original Assignee
Western Digital Technologies, Inc.
Skyera, Inc.
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 Western Digital Technologies, Inc., Skyera, Inc. filed Critical Western Digital Technologies, Inc.
Priority to CN201480055094.0A priority Critical patent/CN105612500B/en
Priority to KR1020167009003A priority patent/KR101905280B1/en
Priority to AU2014328501A priority patent/AU2014328501B2/en
Priority to CA2923444A priority patent/CA2923444C/en
Priority to EP14849803.3A priority patent/EP3042290A4/en
Priority to JP2016540450A priority patent/JP2016530648A/en
Publication of WO2015047697A1 publication Critical patent/WO2015047697A1/en
Publication of WO2015047697A9 publication Critical patent/WO2015047697A9/en
Priority to AU2018247214A priority patent/AU2018247214B2/en

Links

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
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0638—Organizing or formatting or addressing of data
    • G06F3/064—Management of blocks
    • 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
    • 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
    • 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
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
    • G06F3/0604—Improving or facilitating administration, e.g. storage management
    • 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
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
    • G06F3/061—Improving I/O performance
    • 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
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
    • G06F3/061—Improving I/O performance
    • G06F3/0613—Improving I/O performance in relation to throughput
    • 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
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0655—Vertical data movement, i.e. input-output transfer; data movement between one or more hosts and one or more storage devices
    • G06F3/0656—Data buffering arrangements
    • 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
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0655—Vertical data movement, i.e. input-output transfer; data movement between one or more hosts and one or more storage devices
    • G06F3/0659—Command handling arrangements, e.g. command buffers, queues, command scheduling
    • 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
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0655—Vertical data movement, i.e. input-output transfer; data movement between one or more hosts and one or more storage devices
    • G06F3/0661—Format or protocol conversion arrangements
    • 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
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0668—Interfaces specially adapted for storage systems adopting a particular infrastructure
    • G06F3/0671—In-line storage system
    • G06F3/0673—Single storage device
    • 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
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0668—Interfaces specially adapted for storage systems adopting a particular infrastructure
    • G06F3/0671—In-line storage system
    • G06F3/0673—Single storage device
    • G06F3/0679—Non-volatile semiconductor memory device, e.g. flash memory, one time programmable memory [OTP]

Definitions

  • This disclosure relates to data storage systems for computer systems. More particularly, the disclosure relates to writing selected data to a storage medium.
  • Data storage systems provide storage for data of a host system.
  • Data is grouped for storage in units of predetermined size referred to as logical blocks which are written to storage media.
  • logical blocks When writing the logical blocks of data to storage media, for example, in a solid state drive (SSD) or hybrid drive, data may be written in larger units, for example logical pages (L-pages), made up of a plurality of logical blocks.
  • SSD solid state drive
  • L-pages logical pages
  • FIG. 1 is a block diagram illustrating a data storage apparatus for writing the same new data in a large number of logical blocks according to an example embodiment of the present inventive concept
  • FIG. 2 is a flowchart illustrating a method for implementing a write-same operation according to an example embodiment of the present inventive concept
  • FIG. 3 is a block diagram illustrating a data storage apparatus for performing a skip-write operation according to an example embodiment of the present inventive concept
  • FIG. 4 is a flowchart illustrating a method of implementing a skip-write operation according to an example embodiment of the present inventive concept
  • FIG. 5A is a diagram illustrating a write mask according to an example embodiment of the present inventive concept
  • FIG. 5B is a diagram illustrating a write mask divided into portions corresponding to a number of logical blocks contained in a logical page according to an example embodiment of the present inventive concept.
  • FIG. 6 is a diagram illustrating a method of merging of a first logical page and a second logical page using a corresponding portion of a write mask according to an example embodiment of the present inventive concept.
  • SSDs Solid state drives
  • data may be written in larger units, for example logical pages, made up of a plurality of logical blocks.
  • logical pages For example, a 4 kilobyte (kB) logical page may consist of eight 512 byte logical blocks.
  • One aspect of the present inventive concept is directed to a Write Same apparatus and method which writes the same data into a sequential plurality of logical blocks.
  • the apparatus receives a command including a starting logical block address (LBA), a range of LBA's (i.e., a value indicating the number of logical blocks into which data is to be written), and a block of data to be written into the logical blocks.
  • LBA starting logical block address
  • the Write Same apparatus operates to write the received block of data into each logical block in the specified range of LBA's beginning at the starting LBA.
  • the Write Same apparatus performs a read-modify-write operation (RMW) if the first write operation does not begin on a logical page boundary or the last write operation does not end on a logical page boundary, merging logical page blocks on-the-fly and performing the appropriate bit-modifications.
  • RMW read-modify-write operation
  • Another aspect of the present inventive concept is directed to a Skip Write apparatus and method.
  • the apparatus receives a command including a starting logical block address, a value indicating a range of logical block addresses, and a write mask.
  • Output logical pages are generated by merging logical blocks into logical pages based on corresponding portions of the write mask.
  • the Skip Write apparatus operates on the logical pages as determined by a write mask, applying hardware optimization to what were formerly software processes.
  • the Skip Write apparatus merges logical page blocks on-the-fly and performs the appropriate bit-modifications based on the write mask.
  • FIG. 1 is a block diagram illustrating a data storage apparatus for writing the same new data in a large number of logical blocks according to an example embodiment of the present inventive concept.
  • a data storage apparatus 100 may include a command input device 1 10, a first temporary storage 120, a processor 130, a second temporary storage 140, cyclic redundancy check (CRC) generation circuitry 150, comparison circuitry 160, write circuitry 170, a counter 180, and a storage medium 190.
  • Storage medium may include non-volatile memory such as solid-state semiconductor memory (e.g., NAND).
  • the elements of the data storage apparatus 100 may be integrated on one semiconductor chip or may be separate dies integrated into one semiconductor package.
  • One of ordinary skill in the art will understand that other configurations are possible and are included within the scope of the present inventive concept.
  • the functionalities performed by the described elements may be performed by other elements, and the elements may be combined into fewer elements and/or sub-divided into a greater number of elements.
  • the command input device 1 10 receives a command including a starting logical block address (LBA), a value indicating a range of LBAs, and a logical block of data to be written into the logical blocks within the range of LBAs.
  • the command may be received from a host that is connected to the data storage apparatus 100.
  • the received logical block of data is transferred to the first temporary storage 120.
  • the first temporary storage 120 may be internal or external to the processor 130.
  • the processor 130 duplicates the received logical block of data to generate a logical page with each logical block having the same data as the received logical block of data. For example, for logical page containing eight logical blocks, the processor 130 duplicates the received logical block seven times to generate a logical page containing eight logical blocks each containing the same data.
  • Each logical block may include, for example but not limited to, about 512 bytes of data, about 1 ,024 bytes of data, about 2,048 bytes of data, or about 4,096 bytes of data.
  • the received logical block of data may contain all ones or all zeros, and the value indicating the range of logical block addresses may indicate all of the logical block addresses of the storage medium.
  • the processor 130 causes the generated logical page to be transferred to the second temporary storage 140.
  • the second temporary storage 140 may be a queue included in a (RMW) module 195.
  • the processor 130 may cause the second temporary storage 140 to be reserved prior to transferring the generated logical page.
  • the RMW module 195 may additionally include the CRC circuitry 150 and the write circuitry 170.
  • the CRC circuitry 150 generates a CRC value based on at least the data and the LBA of each logical block and compares the CRC of the logical block data ready to be written with the CRC of the logical block data as received. If the CRCs do not match, the logical block data to be written is marked invalid.
  • CRCs are mentioned in the example embodiments in this disclosure, the use of other error detection mechanisms for example, but not limited to, checksums and hash functions, etc., are possible in some embodiments.
  • the write circuitry 170 outputs valid data to the storage medium 190.
  • the counter 180 counts the number of logical blocks written to the storage medium 190 and generates a count value.
  • the comparison circuitry 170 compares the count value to the value indicating a range of LBAs to be written. If the values match, the comparison circuitry 160 generates a signal indicating that the write same operation is complete.
  • the write same operation is subordinated to other (RMW) operations, so the write circuitry writes the logical page from the second temporary storage into the storage medium as a background task to other write operations involving merging.
  • the first write operation does not begin on a logical page boundary and/or the last write operation does not end on a logical page boundary.
  • the (RMW) module 195 performs a RMW operation to modify only the logical blocks specified for the write mask for the corresponding logical page.
  • the generated logical page may be stored in the second temporary storage 140.
  • a second logical page including a plurality of blocks is retrieved from the storage medium 190 by the RMW module 195. Sectors of the generated logical page and second logical page are merged via a plurality of data paths and multiplexers to generate a merged output logical page.
  • a CRC for the merged output logical page is generated by calculating and accumulating on a block-by-block basis CRC data of the generated logical page and second logical page blocks merged to generate the merged output logical page.
  • the blocks of at least one of the generated logical page and second logical page are reconstructed into a check-data logical page as the merged output logical page is being generated.
  • both of the generated logical page and second logical page may be reconstructed into check-data logical pages as the merged output logical page as being generated.
  • a CRC is calculated and accumulated on a block-by-block basis for the check-data logical page, and an error check is performed on the at least one check- data logical page comprising blocks corresponding to those of the generated logical page and second logical page to verify the corresponding blocks of the merged output logical page. Since at least some of the blocks in the check-data logical page are transmitted on a subset of the plurality of data paths that transmits blocks of the merged output logical page, the error check of the at least one check-data logical page verifies the blocks from the at least one check-data logical page in the merged output logical page. In one example embodiment, the error check of both check-data logical pages verifies the blocks of the first and second check-data logical pages in the merged output logical page.
  • the RMW module is further configured to calculate a data integrity field for each block and insert the calculated data integrity field between the blocks.
  • Protection schemes for preventing data integrity errors during data transfer are defined by the ANSI T10 Data Integrity Feature (T10 DIF) standard.
  • T10 DIF provides a way to check the integrity of data read and written from a host bus adapter to the disk and back through the storage area network (SAN) fabric. This check is implemented through a data integrity field (DIF) defined in the T10 standard.
  • FIG. 2 is a flowchart illustrating a method for implementing a write-same operation according to an example embodiment of the present inventive concept.
  • a command comprising a starting logical block address, a value indicating a range of logical block addresses to be written, and a logical block of data is received (210).
  • the logical block of data is transferred to a first temporary storage and stored (215).
  • the first temporary storage may be memory internal to a processor or may be other memory integrated on the semiconductor chip.
  • a logical page is generated by duplicating the logical block of data stored in the first temporary storage a number of times corresponding to the number of logical blocks contained in a logical page, for example eight logical blocks (220).
  • the logical page thus generated is transported to a second temporary storage, for example, a queue (225).
  • a RMW operation is performed to merge the corresponding logical blocks of the duplicated logical page into the current logical page (255).
  • the counter is updated with the number of blocks in the range of logical block addresses written (240). If the value in the counter does not equal the number of logical blocks in the range of logical block addresses to be written (245-N), the LBA is incremented by the number of logical blocks, in the range of logical block addresses, that are written in the current logical page (260), and the process repeats from operation 230. If all the blocks in the range of logical block addresses to be written have been written (245- Y) a write complete signal is generated (250) in the process ends.
  • FIG. 3 is a block diagram illustrating a data storage apparatus for performing a skip-write operation according to an example embodiment of the present inventive concept.
  • a data storage apparatus 300 may include a command input device 310, a storage 320, input logic device 330, multiplexers 340, a first logic device 350, a second logic device 360, and a counter 370.
  • the elements of the data storage apparatus 300 may be integrated on one semiconductor chip or may be separate dies integrated into one semiconductor package.
  • One of ordinary skill in the art will understand that other configurations are possible and are included within the scope of the present inventive concept.
  • the functionalities performed by the described elements may be performed by other elements, and the elements may be combined into fewer elements and/or sub-divided into a greater number of elements.
  • the command input device 310 receives a command including a starting logical block address (LBA), a value indicating a range of LBAs, and a write mask.
  • the write mask specifies LBAs of logical blocks into which logical blocks containing different data will be merged.
  • the new logical blocks associated with the command are received and stored in temporary storage 320.
  • Each logical block may include, for example but not limited to, about 512 bytes of data, about 1 ,024 bytes of data, about 2,048 bytes of data, or about 4,096 bytes of data.
  • the input logic device 330 divides the write mask into portions corresponding to a number of logical blocks comprising a logical page and constructs a first logical page based on a corresponding portion of the write mask. For example, for logical pages containing eight logical blocks, the write mask is divided into portions each containing eight bits as merge indicators associated with LBAs.
  • FIG. 5A is a diagram illustrating a write mask according to an example embodiment of the present inventive concept.
  • the write mask contains 2,048 bits, each bit corresponding to an LBA beginning with the starting LBA received with the command.
  • FIG. 5A illustrates a starting LBA of '8' and an ending LBA of'2055'. Bits zero, two, and three of the write mask are set to '1 ' indicating that new logical blocks will be inserted at the corresponding LBAs.
  • the LBAs of the logical blocks to be merged may be consecutive or nonconsecutive.
  • FIG. 5B is a diagram illustrating a write mask divided into portions corresponding to a number of logical blocks contained in a logical page according to an example embodiment of the present inventive concept.
  • the write mask is divided into 256 portions each containing eight bits corresponding to the LBAs in a logical page.
  • logical blocks corresponding to LBAs 8, 10, and 1 1 will be replaced by inserting logical blocks associated with the received command into the logical page at those LBAs.
  • this example is merely to enhance understanding and is applicable to other configurations of logical pages, logical blocks, and LBAs.
  • the input logic device 330 constructs the first logical page and retrieves a second logical page from a storage medium, for example storage medium 190 illustrated in FIG. 1 , and verifies CRCs contained in the headers of each logical page.
  • a storage medium for example storage medium 190 illustrated in FIG. 1
  • CRCs are mentioned in the example embodiments in this disclosure, the use of other error detection mechanisms for example, but not limited to, checksums and hash functions, etc., are possible in some embodiments. Also, in some embodiments, the CRC verification may be performed elsewhere in the apparatus.
  • the first and second logical pages are transferred block-by-block from the input logic device 330 in synchronization with the system clock to the data path circuitry 340 where the sectors of the first and second logical pages are merged at about the same speed as the system clock speed based on a corresponding portion of the write mask.
  • the first logical page is stored until a second logical page is retrieved.
  • the second logical page is passed through the Skip Write apparatus 300 block-by-block at about the system clock speed and is merged with the stored first logical page.
  • the first and second logical pages are processed by the first logic device 350 to determine whether the merged output logical page is valid.
  • FIG. 6 is a diagram illustrating merging of a first logical page and a second logical page using a corresponding portion of a write mask according to an example embodiment of the present inventive concept.
  • the write mask indicates a logical block to merge into the output logical page with a "1 " and a logical block to discard with a "0" with respect to the second logical page, and indicates a logical block to merge into the output logical page with a "0" and a logical block to discard with a "1 " with respect to the first logical page.
  • the designations "1 " and "0" are merely exemplary and that other designations are possible without departing from the scope of the inventive concept.
  • a corresponding portion of a write mask 670 specifies logical blocks of the second logical page 640 which will be merged with logical blocks of the first logical page 610 in place of logical blocks of the first logical page 610 which will be discarded (shown as LBs to discard 620).
  • Logical blocks of the second logical page 640 which are not specified to merge into the output logical page by the corresponding portion of the write mask 670 are discarded (shown as LBs to discard 650) while logical blocks of the second logical page 640 which are specified to merge into the output logical page by the corresponding portion of the write mask 670 (shown as LBs to keep 660) are merged with the first logical page 610 to generate a merged output logical page 680.
  • logical blocks of the first logical page specified by the corresponding portion of the write mask are replaced by corresponding logical blocks of the second logical page in order to generate the merged output logical page and the unused sectors of the first and second logical pages are discarded.
  • the second logic device 360 calculates and accumulates a CRC for the merged output logical page.
  • Each logical block of the merged output logical page is outputted from the Skip Write apparatus 300 on a block-by-block basis.
  • Generation of the merged output logical page is performed at about the same speed as the system clock speed.
  • the first logic device 350 reconstructs the first and second logical pages as first and second check-data pages, respectively, and the CRCs of the check-data pages are calculated and accumulated by the first logic device 350 on a block-by-block basis.
  • the first check-data page may include logical blocks that are transmitted on a first subset of data paths different from a subset of data paths that logical blocks of the first logical page merged into the output logical page are transmitted on
  • the second check-data page may include logical blocks that are transmitted on a second subset of data paths different from the subset of data paths that logical blocks of the second logical page merged into the output logical page are transmitted on.
  • the CRC of the first logical page is transmitted to the first logic device 350.
  • the CRC of the second logical page is transmitted to the first logic device 350.
  • the first logic device 350 performs an error check by comparing the transmitted CRC of the first logical page to the CRC calculated for the first check-data page and compares the transmitted CRC of the second logical page to the CRC calculated for the second check-data page. If the received logical page CRCs matches the CRCs of the check-data pages, the merged output logical page will be valid since logical blocks of the merged output logical page passed through the same logic as the logical blocks of the check-data pages and no errors were introduced. If the CRCs do not match, a message is generated indicating that the merged output logical page is invalid.
  • the validity can be verified this way because at least some of the logical blocks in the check-data page are transmitted on a subset of the plurality of data paths that also transmits logical blocks of the merged output logical page, so that the error check of the at least one check- data page verifies the merged output logical page.
  • the use of output data from the actual merged logical page as part of the calculation of the check-data page CRC ensures that any error introduced along the path of the logical page merging mechanism is detected.
  • the second logic device 360 Concurrently with the generation of the merged output logical page, the second logic device 360 generates a CRC for the merged output logical page on a block-by-block basis. After the final logical block of the merged output logical page is outputted, the CRC generated by the second logic device 360 for the merged output logical page is outputted.
  • the counter 370 is incremented based on the number of logical blocks written to the storage medium.
  • the value on the counter 370 is compared to the value of the LBA range received in the command and if the counter value matches the LBA range the counter 370 generates a signal indicating that the skip write process is complete.
  • FIG. 4 is a flowchart illustrating a method of implementing a skip-write operation according to an example embodiment of the present inventive concept.
  • a command including a starting logical block address (LBA), a value indicating a range of LBAs, and a write mask is received (410).
  • New logical blocks associated with the command are received and stored in temporary storage (415).
  • the write mask is divided into portions corresponding to a number of logical blocks comprising a logical page (425), and a portion of the write mask
  • a first logical page is constructed using the received logical blocks associated with the command (450).
  • a CRC is calculated for the logical page thus constructed and the logical page is written to the storage medium (470).
  • the counter is incremented based on the number of LBAs processed (475).
  • the value on the counter is compared to the value of the LBA range received in the command (480), and if the counter value matches the LBA range (480-Y), the counter generates a signal indicating that the skip write process is complete (485). Otherwise, the process returns to operation 430.
  • the first and second logical pages are merged with a RMW operation as described above (465).
  • a CRC is calculated for the logical page thus constructed and the logical page is written to the storage medium (470).
  • the counter is incremented based on the number of LBAs processed (475).
  • the value on the counter is compared to the value of the LBA range received in the command (480), and if the counter value matches the LBA range (480-Y), the counter generates a signal indicating that the skip write process is complete (485). Otherwise, the process returns to operation 430.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Human Computer Interaction (AREA)
  • Techniques For Improving Reliability Of Storages (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Detection And Correction Of Errors (AREA)

Abstract

A method of writing data to a range of logical blocks in a storage medium includes: receiving a command including a starting logical block address, a value indicating a range of logical block addresses to be written, and a logical block of data; storing the logical block in a first temporary storage; generating a logical page by duplicating the logical block a plurality of times corresponding to a number of logical blocks in a logical page and transporting the generated logical page to a second temporary storage and storing the generated logical page in the second temporary storage; writing the generated logical page from the second temporary storage into the storage medium beginning from the starting logical block address; and performing a read-modify-write operation if the first write operation does not begin on a logical page boundary or the last write operation does not end on a logical page boundary.

Description

HIGH PERFORMANCE SYSTEM PROVIDING SELECTIVE MERGING OF DATAFRAME SEGMENTS IN HARDWARE
BACKGROUND
Technical Field
[0001] This disclosure relates to data storage systems for computer systems. More particularly, the disclosure relates to writing selected data to a storage medium.
Related Art
[0002] Data storage systems provide storage for data of a host system. Data is grouped for storage in units of predetermined size referred to as logical blocks which are written to storage media. When writing the logical blocks of data to storage media, for example, in a solid state drive (SSD) or hybrid drive, data may be written in larger units, for example logical pages (L-pages), made up of a plurality of logical blocks. At times it becomes advantageous to write the same new data in a large number of logical blocks spanning several logical pages in the storage medium, or to write new different data to only some of the logical blocks included in a logical page in the storage medium.
BRIEF DESCRIPTION OF THE DRAWINGS
[0003] Aspects and features of the present inventive concept will be more apparent by describing example embodiments with reference to the accompanying drawings, in which:
[0004] FIG. 1 is a block diagram illustrating a data storage apparatus for writing the same new data in a large number of logical blocks according to an example embodiment of the present inventive concept;
[0005] FIG. 2 is a flowchart illustrating a method for implementing a write-same operation according to an example embodiment of the present inventive concept;
[0006] FIG. 3 is a block diagram illustrating a data storage apparatus for performing a skip-write operation according to an example embodiment of the present inventive concept;
[0007] FIG. 4 is a flowchart illustrating a method of implementing a skip-write operation according to an example embodiment of the present inventive concept; [0008] FIG. 5A is a diagram illustrating a write mask according to an example embodiment of the present inventive concept;
[0009] FIG. 5B is a diagram illustrating a write mask divided into portions corresponding to a number of logical blocks contained in a logical page according to an example embodiment of the present inventive concept; and
[0010] FIG. 6 is a diagram illustrating a method of merging of a first logical page and a second logical page using a corresponding portion of a write mask according to an example embodiment of the present inventive concept.
DETAILED DESCRIPTION
[0011] While certain embodiments are described, these embodiments are presented by way of example only, and are not intended to limit the scope of protection. The methods and apparatuses described herein may be embodied in a variety of other forms. Furthermore, various omissions, substitutions, and changes in the form of the example methods and apparatuses described herein may be made without departing from the scope of protection.
OVERVIEW
[0012] Solid state drives (SSDs) are employed as data storage systems for computer systems. To modify data stored in a memory location of such a data storage system, data may be written in larger units, for example logical pages, made up of a plurality of logical blocks. For example, a 4 kilobyte (kB) logical page may consist of eight 512 byte logical blocks. At times it becomes advantageous to write identical data into a range of consecutive logical blocks or to modify data in non- consecutive logical blocks within a range of consecutive logical blocks.
SYSTEM OVERVIEW
[0013] One aspect of the present inventive concept is directed to a Write Same apparatus and method which writes the same data into a sequential plurality of logical blocks. In one example embodiment of the Write Same apparatus, the apparatus receives a command including a starting logical block address (LBA), a range of LBA's (i.e., a value indicating the number of logical blocks into which data is to be written), and a block of data to be written into the logical blocks. [0014] The Write Same apparatus operates to write the received block of data into each logical block in the specified range of LBA's beginning at the starting LBA. The Write Same apparatus performs a read-modify-write operation (RMW) if the first write operation does not begin on a logical page boundary or the last write operation does not end on a logical page boundary, merging logical page blocks on-the-fly and performing the appropriate bit-modifications.
[0015] Another aspect of the present inventive concept is directed to a Skip Write apparatus and method. In one example embodiment of the Skip Write apparatus, the apparatus receives a command including a starting logical block address, a value indicating a range of logical block addresses, and a write mask. Output logical pages are generated by merging logical blocks into logical pages based on corresponding portions of the write mask.
[0016] The Skip Write apparatus operates on the logical pages as determined by a write mask, applying hardware optimization to what were formerly software processes. The Skip Write apparatus merges logical page blocks on-the-fly and performs the appropriate bit-modifications based on the write mask.
WRITE SAME
[0017] FIG. 1 is a block diagram illustrating a data storage apparatus for writing the same new data in a large number of logical blocks according to an example embodiment of the present inventive concept. Referring to FIG. 1 , in one example embodiment of the present inventive concept a data storage apparatus 100 may include a command input device 1 10, a first temporary storage 120, a processor 130, a second temporary storage 140, cyclic redundancy check (CRC) generation circuitry 150, comparison circuitry 160, write circuitry 170, a counter 180, and a storage medium 190. Storage medium may include non-volatile memory such as solid-state semiconductor memory (e.g., NAND).
[0018] The elements of the data storage apparatus 100 may be integrated on one semiconductor chip or may be separate dies integrated into one semiconductor package. One of ordinary skill in the art will understand that other configurations are possible and are included within the scope of the present inventive concept. For example, the functionalities performed by the described elements may be performed by other elements, and the elements may be combined into fewer elements and/or sub-divided into a greater number of elements.
[0019] In one embodiment, the command input device 1 10 receives a command including a starting logical block address (LBA), a value indicating a range of LBAs, and a logical block of data to be written into the logical blocks within the range of LBAs. For example, the command may be received from a host that is connected to the data storage apparatus 100. The received logical block of data is transferred to the first temporary storage 120. The first temporary storage 120 may be internal or external to the processor 130. The processor 130 duplicates the received logical block of data to generate a logical page with each logical block having the same data as the received logical block of data. For example, for logical page containing eight logical blocks, the processor 130 duplicates the received logical block seven times to generate a logical page containing eight logical blocks each containing the same data.
[0020] Each logical block may include, for example but not limited to, about 512 bytes of data, about 1 ,024 bytes of data, about 2,048 bytes of data, or about 4,096 bytes of data. In some cases, for example when a storage medium is erased or reformatted, the received logical block of data may contain all ones or all zeros, and the value indicating the range of logical block addresses may indicate all of the logical block addresses of the storage medium.
[0021] The processor 130 causes the generated logical page to be transferred to the second temporary storage 140. The second temporary storage 140 may be a queue included in a (RMW) module 195. The processor 130 may cause the second temporary storage 140 to be reserved prior to transferring the generated logical page. As shown, the RMW module 195 may additionally include the CRC circuitry 150 and the write circuitry 170.
[0022] In one embodiment, the CRC circuitry 150 generates a CRC value based on at least the data and the LBA of each logical block and compares the CRC of the logical block data ready to be written with the CRC of the logical block data as received. If the CRCs do not match, the logical block data to be written is marked invalid. Although CRCs are mentioned in the example embodiments in this disclosure, the use of other error detection mechanisms for example, but not limited to, checksums and hash functions, etc., are possible in some embodiments.
[0023] In one embodiment, the write circuitry 170 outputs valid data to the storage medium 190. The counter 180 counts the number of logical blocks written to the storage medium 190 and generates a count value. The comparison circuitry 170 compares the count value to the value indicating a range of LBAs to be written. If the values match, the comparison circuitry 160 generates a signal indicating that the write same operation is complete. In some embodiments, the write same operation is subordinated to other (RMW) operations, so the write circuitry writes the logical page from the second temporary storage into the storage medium as a background task to other write operations involving merging.
[0024] In some cases, the first write operation does not begin on a logical page boundary and/or the last write operation does not end on a logical page boundary. In such cases, the (RMW) module 195 performs a RMW operation to modify only the logical blocks specified for the write mask for the corresponding logical page.
[0025] In the RMW operation, the generated logical page may be stored in the second temporary storage 140. A second logical page including a plurality of blocks is retrieved from the storage medium 190 by the RMW module 195. Sectors of the generated logical page and second logical page are merged via a plurality of data paths and multiplexers to generate a merged output logical page. In addition, a CRC for the merged output logical page is generated by calculating and accumulating on a block-by-block basis CRC data of the generated logical page and second logical page blocks merged to generate the merged output logical page.
[0026] The blocks of at least one of the generated logical page and second logical page are reconstructed into a check-data logical page as the merged output logical page is being generated. Alternatively, both of the generated logical page and second logical page may be reconstructed into check-data logical pages as the merged output logical page as being generated.
[0027] A CRC is calculated and accumulated on a block-by-block basis for the check-data logical page, and an error check is performed on the at least one check- data logical page comprising blocks corresponding to those of the generated logical page and second logical page to verify the corresponding blocks of the merged output logical page. Since at least some of the blocks in the check-data logical page are transmitted on a subset of the plurality of data paths that transmits blocks of the merged output logical page, the error check of the at least one check-data logical page verifies the blocks from the at least one check-data logical page in the merged output logical page. In one example embodiment, the error check of both check-data logical pages verifies the blocks of the first and second check-data logical pages in the merged output logical page.
[0028] In one embodiment, the RMW module is further configured to calculate a data integrity field for each block and insert the calculated data integrity field between the blocks. Protection schemes for preventing data integrity errors during data transfer are defined by the ANSI T10 Data Integrity Feature (T10 DIF) standard. T10 DIF provides a way to check the integrity of data read and written from a host bus adapter to the disk and back through the storage area network (SAN) fabric. This check is implemented through a data integrity field (DIF) defined in the T10 standard.
[0029] FIG. 2 is a flowchart illustrating a method for implementing a write-same operation according to an example embodiment of the present inventive concept. Referring to FIG. 2, a command comprising a starting logical block address, a value indicating a range of logical block addresses to be written, and a logical block of data is received (210). The logical block of data is transferred to a first temporary storage and stored (215). The first temporary storage may be memory internal to a processor or may be other memory integrated on the semiconductor chip. A logical page is generated by duplicating the logical block of data stored in the first temporary storage a number of times corresponding to the number of logical blocks contained in a logical page, for example eight logical blocks (220). The logical page thus generated is transported to a second temporary storage, for example, a queue (225).
[0030] A determination is made whether the first logical block address of the duplicated logical page begins at a logical page boundary of a current logical page or if the last logical block address of the duplicated logical page ends at a logical page boundary of a current logical page (230). If so (230-Y), a CRC is calculated as described above in the logical pages written to the storage medium (235). If the first logical block address of the duplicated logical page does not begin at a logical page boundary of a current logical page, or the last logical block address of the duplicated logical page does not correspond to a last logical block address of a current logical page (230-N), a RMW operation is performed to merge the corresponding logical blocks of the duplicated logical page into the current logical page (255).
[0031] After the logical page is written to the storage medium, the counter is updated with the number of blocks in the range of logical block addresses written (240). If the value in the counter does not equal the number of logical blocks in the range of logical block addresses to be written (245-N), the LBA is incremented by the number of logical blocks, in the range of logical block addresses, that are written in the current logical page (260), and the process repeats from operation 230. If all the blocks in the range of logical block addresses to be written have been written (245- Y) a write complete signal is generated (250) in the process ends.
SKIP WRITE
[0032] FIG. 3 is a block diagram illustrating a data storage apparatus for performing a skip-write operation according to an example embodiment of the present inventive concept. Referring to FIG. 3, in one example embodiment of the present inventive concept a data storage apparatus 300 may include a command input device 310, a storage 320, input logic device 330, multiplexers 340, a first logic device 350, a second logic device 360, and a counter 370.
[0033] The elements of the data storage apparatus 300 may be integrated on one semiconductor chip or may be separate dies integrated into one semiconductor package. One of ordinary skill in the art will understand that other configurations are possible and are included within the scope of the present inventive concept. For example, the functionalities performed by the described elements may be performed by other elements, and the elements may be combined into fewer elements and/or sub-divided into a greater number of elements.
[0034] The command input device 310 receives a command including a starting logical block address (LBA), a value indicating a range of LBAs, and a write mask. The write mask specifies LBAs of logical blocks into which logical blocks containing different data will be merged. The new logical blocks associated with the command are received and stored in temporary storage 320. Each logical block may include, for example but not limited to, about 512 bytes of data, about 1 ,024 bytes of data, about 2,048 bytes of data, or about 4,096 bytes of data.
[0035] In one embodiment, the input logic device 330 divides the write mask into portions corresponding to a number of logical blocks comprising a logical page and constructs a first logical page based on a corresponding portion of the write mask. For example, for logical pages containing eight logical blocks, the write mask is divided into portions each containing eight bits as merge indicators associated with LBAs.
[0036] FIG. 5A is a diagram illustrating a write mask according to an example embodiment of the present inventive concept. Referring to FIG. 5A, the write mask contains 2,048 bits, each bit corresponding to an LBA beginning with the starting LBA received with the command. As an example, FIG. 5A illustrates a starting LBA of '8' and an ending LBA of'2055'. Bits zero, two, and three of the write mask are set to '1 ' indicating that new logical blocks will be inserted at the corresponding LBAs. The LBAs of the logical blocks to be merged may be consecutive or nonconsecutive.
[0037] FIG. 5B is a diagram illustrating a write mask divided into portions corresponding to a number of logical blocks contained in a logical page according to an example embodiment of the present inventive concept. As illustrated in FIG. 5B, for logical pages containing eight LBAs the write mask is divided into 256 portions each containing eight bits corresponding to the LBAs in a logical page. In the portion corresponding to the first logical page, logical blocks corresponding to LBAs 8, 10, and 1 1 will be replaced by inserting logical blocks associated with the received command into the logical page at those LBAs. One of ordinary skill in the art will appreciate that this example is merely to enhance understanding and is applicable to other configurations of logical pages, logical blocks, and LBAs.
[0038] In one embodiment, the input logic device 330 constructs the first logical page and retrieves a second logical page from a storage medium, for example storage medium 190 illustrated in FIG. 1 , and verifies CRCs contained in the headers of each logical page. It must be noted that although CRCs are mentioned in the example embodiments in this disclosure, the use of other error detection mechanisms for example, but not limited to, checksums and hash functions, etc., are possible in some embodiments. Also, in some embodiments, the CRC verification may be performed elsewhere in the apparatus. The first and second logical pages are transferred block-by-block from the input logic device 330 in synchronization with the system clock to the data path circuitry 340 where the sectors of the first and second logical pages are merged at about the same speed as the system clock speed based on a corresponding portion of the write mask.
[0039] In one example embodiment, the first logical page is stored until a second logical page is retrieved. The second logical page is passed through the Skip Write apparatus 300 block-by-block at about the system clock speed and is merged with the stored first logical page. The first and second logical pages are processed by the first logic device 350 to determine whether the merged output logical page is valid.
[0040] FIG. 6 is a diagram illustrating merging of a first logical page and a second logical page using a corresponding portion of a write mask according to an example embodiment of the present inventive concept. In the example illustration of FIG. 6, the write mask indicates a logical block to merge into the output logical page with a "1 " and a logical block to discard with a "0" with respect to the second logical page, and indicates a logical block to merge into the output logical page with a "0" and a logical block to discard with a "1 " with respect to the first logical page. One of ordinary skill in the art will understand that the designations "1 " and "0" are merely exemplary and that other designations are possible without departing from the scope of the inventive concept.
[0041] Referring to FIG. 6, a corresponding portion of a write mask 670 specifies logical blocks of the second logical page 640 which will be merged with logical blocks of the first logical page 610 in place of logical blocks of the first logical page 610 which will be discarded (shown as LBs to discard 620). Logical blocks of the second logical page 640 which are not specified to merge into the output logical page by the corresponding portion of the write mask 670 are discarded (shown as LBs to discard 650) while logical blocks of the second logical page 640 which are specified to merge into the output logical page by the corresponding portion of the write mask 670 (shown as LBs to keep 660) are merged with the first logical page 610 to generate a merged output logical page 680.
[0042] Conversely, logical blocks of the first logical page 610 which are not specified to merge into the output logical page by the corresponding portion of the write mask 670 are discarded (shown as LBs to discard 620) while logical blocks of the first logical page 610 which are specified to merge into the output logical page (shown as LBs to merge 630) by the corresponding portion of the write mask 670 are merged with the logical blocks to merge 660 of the second logical page 640 to generate the merged output logical page 680. In other words, logical blocks of the first logical page specified by the corresponding portion of the write mask are replaced by corresponding logical blocks of the second logical page in order to generate the merged output logical page and the unused sectors of the first and second logical pages are discarded.
[0043] While the above merge operations are described in terms of specified logical blocks of the second logical page which may be merged with logical blocks of the first logical page, one of ordinary skill in the art will appreciate that the scope of the present inventive concept also includes merging specified logical blocks of the first logical page with logical blocks of the second logical page. Also, while illustrated as such in FIG. 6, the number of logical blocks in the plurality of logical blocks of the first logical page and the second logical page may not be identical.
[0044] Referring again to FIG. 3, in one example embodiment the second logic device 360 calculates and accumulates a CRC for the merged output logical page. Each logical block of the merged output logical page is outputted from the Skip Write apparatus 300 on a block-by-block basis. Generation of the merged output logical page is performed at about the same speed as the system clock speed.
[0045] In one example embodiment, the first logic device 350 reconstructs the first and second logical pages as first and second check-data pages, respectively, and the CRCs of the check-data pages are calculated and accumulated by the first logic device 350 on a block-by-block basis. The first check-data page may include logical blocks that are transmitted on a first subset of data paths different from a subset of data paths that logical blocks of the first logical page merged into the output logical page are transmitted on, and the second check-data page may include logical blocks that are transmitted on a second subset of data paths different from the subset of data paths that logical blocks of the second logical page merged into the output logical page are transmitted on. [0046] After processing the last logical block of the first and second logical pages, the CRC of the first logical page is transmitted to the first logic device 350.
Simultaneously, the CRC of the second logical page is transmitted to the first logic device 350.
[0047] In one example embodiment, the first logic device 350 performs an error check by comparing the transmitted CRC of the first logical page to the CRC calculated for the first check-data page and compares the transmitted CRC of the second logical page to the CRC calculated for the second check-data page. If the received logical page CRCs matches the CRCs of the check-data pages, the merged output logical page will be valid since logical blocks of the merged output logical page passed through the same logic as the logical blocks of the check-data pages and no errors were introduced. If the CRCs do not match, a message is generated indicating that the merged output logical page is invalid. The validity can be verified this way because at least some of the logical blocks in the check-data page are transmitted on a subset of the plurality of data paths that also transmits logical blocks of the merged output logical page, so that the error check of the at least one check- data page verifies the merged output logical page. The use of output data from the actual merged logical page as part of the calculation of the check-data page CRC ensures that any error introduced along the path of the logical page merging mechanism is detected.
[0048] Concurrently with the generation of the merged output logical page, the second logic device 360 generates a CRC for the merged output logical page on a block-by-block basis. After the final logical block of the merged output logical page is outputted, the CRC generated by the second logic device 360 for the merged output logical page is outputted.
[0049] In a case where the values of a logical page portion of the write mask are all ones, the second logical page is outputted as the output logical page without being merged. Conversely, in a case where a logical page portion of the write mask values are all zeros, no logical page is outputted and the corresponding logical page data stored in the storage medium is not changed.
[0050] Referring again to FIG. 3, the counter 370 is incremented based on the number of logical blocks written to the storage medium. The value on the counter 370 is compared to the value of the LBA range received in the command and if the counter value matches the LBA range the counter 370 generates a signal indicating that the skip write process is complete.
[0051] FIG. 4 is a flowchart illustrating a method of implementing a skip-write operation according to an example embodiment of the present inventive concept. Referring to FIG. 4, a command including a starting logical block address (LBA), a value indicating a range of LBAs, and a write mask is received (410). New logical blocks associated with the command are received and stored in temporary storage (415). The write mask is divided into portions corresponding to a number of logical blocks comprising a logical page (425), and a portion of the write mask
corresponding the current logical page is obtained (430).
[0052] If the values in the corresponding portion of the write mask are all the same (435-Y), either new data will be written in all of the LBAs in the logical page corresponding to that portion of the write mask, for example all bits in the
corresponding portion of the write mask are set to Ί ', or no new data needs to be written in the logical page, for example all bits in the corresponding portion of the write mask are set to Ό'. In the case where new data will be written in all of the LBAs in the logical page (440-Y), a first logical page is constructed using the received logical blocks associated with the command (450). A CRC is calculated for the logical page thus constructed and the logical page is written to the storage medium (470). The counter is incremented based on the number of LBAs processed (475). The value on the counter is compared to the value of the LBA range received in the command (480), and if the counter value matches the LBA range (480-Y), the counter generates a signal indicating that the skip write process is complete (485). Otherwise, the process returns to operation 430.
[0053] In the case where no new data needs to be written in the logical page (440-N), no write operation to the storage medium takes place (445). The counter is incremented based on the number of LBAs processed (475). The value on the counter is compared to the value of the LBA range received in the command (480), and if the counter value matches the LBA range (480-Y), the counter generates a signal indicating that the skip write process is complete (485). Otherwise, the process returns to operation 430. [0054] In the case where all the write mask values are not the same (435-N), a second logical page is retrieved (455), and a first logical page is constructed using the received logical blocks associated with the command based on a corresponding portion of the write mask (460). The first and second logical pages are merged with a RMW operation as described above (465). A CRC is calculated for the logical page thus constructed and the logical page is written to the storage medium (470). The counter is incremented based on the number of LBAs processed (475). The value on the counter is compared to the value of the LBA range received in the command (480), and if the counter value matches the LBA range (480-Y), the counter generates a signal indicating that the skip write process is complete (485). Otherwise, the process returns to operation 430.
[0055] Operations of the present inventive concept may be performed in the order described, in a different order, or operations may be combined. One of ordinary skill in the art will appreciate that the foregoing processes are exemplary and that other variations are possible without departing from the inventive concept.
[0056] While certain embodiments have been described, these embodiments have been presented by way of example only, and are not intended to limit the scope of the protection. The methods and apparatuses described herein may be embodied in a variety of other forms. Various omissions, substitutions, and/or changes in the form of the example methods and apparatuses described herein may be made without departing from the spirit of the protection.
[0057] The accompanying claims and their equivalents are intended to cover such forms or modifications as would fall within the scope and spirit of the protection. For example, the example apparatuses and methods disclosed herein can be applied to solid-state drives, hard disk drives, hybrid hard drives, and the like. In addition, other forms of storage, for example, but not limited to, DRAM or SRAM, battery backed-up volatile DRAM or SRAM devices, EPROM, EEPROM memory, etc., may additionally or alternatively be used. As another example, the various components illustrated in the figures may be implemented as software and/or firmware on a processor, ASIC/FPGA, or dedicated hardware. Also, the features and attributes of the specific example embodiments disclosed above may be combined in different ways to form additional embodiments, all of which fall within the scope of the present disclosure.
[0058] Although the present disclosure provides certain example embodiments and applications, other embodiments that are apparent to those of ordinary skill in the art, including embodiments which do not provide all of the features and advantages set forth herein, are also within the scope of this disclosure.
Accordingly, the scope of the present disclosure is intended to be defined only by reference to the appended claims.

Claims

WHAT IS CLAIMED IS:
1. A method of writing data to a range of logical blocks in a storage medium, the method comprising:
receiving a command comprising a starting logical block address, a value indicating a range of logical block addresses to be written, and a logical block of data;
storing the logical block of data in a first temporary storage;
generating a logical page by duplicating the logical block of data a plurality of times corresponding to a number of logical blocks comprising a logical page and transporting the generated logical page to a second temporary storage and storing the generated logical page in the second temporary storage;
writing the generated logical page from the second temporary storage into the storage medium beginning from the starting logical block address; and
performing a read-modify-write operation if the first write operation does not begin on a logical page boundary or the last write operation does not end on a logical page boundary.
2. The method of claim 1 , wherein the second temporary storage is a queue in a read-modify-write module.
3. The method of claim 2, further comprising reserving the queue in a read-modify-write module prior to transporting and storing the generated logical page in the queue.
4. The method of claim 1 , further comprising:
updating a count based on a number of logical blocks in the range of logical block addresses written to the storage medium in a current logical page and comparing the count to the value indicating the range of logical block addresses; and if the count matches the value indicating the range of logical block addresses, generating a signal indicating the writing is complete.
5. The method of claim 1 , wherein each logical page comprises a predetermined number of logical blocks.
6. The method of claim 5, wherein each logical block comprises one of about 512 bytes of data, about 1024 bytes of data, about 2048 bytes of data, and about 4096 bytes of data.
7. The method of claim 6, wherein the data bytes comprise all ones or all zeros.
8. The method of claim 6, wherein the data bytes comprise predetermined data.
9. The method of claim 6, wherein each logical block further comprises additional bytes of metadata.
10. The method of claim 9, wherein the metadata for each logical block is updated with the logical block address into which the logical block is to be written.
1 1 . The method of claim 1 , wherein the value indicating the range of logical block addresses is a value indicating all of the logical block address of the storage medium.
12. The method of claim 1 , wherein the generating a logical page is performed by a processor.
13. The method of claim 1 , wherein the writing the generated logical page is performed as a background task to other write operations involving merging.
14. An apparatus for writing data to a range of logical blocks, the apparatus comprising: a first device configured to receive a command comprising a starting logical block address, a value indicating a range of logical block addresses, and a logical block of data;
a first temporary storage configured to store the logical block of data;
a processor configured to generate a logical page by duplicating the logical block of data a plurality of times corresponding to a number of logical blocks comprising a logical page, and transport the generated logical page to a second temporary storage;
a storage medium configured to store logical pages;
write circuitry configured to write the generated logical page from the second temporary storage into the storage medium beginning from the starting logical block address; and
a read-modify-write module configured to perform a read-modify-write operation if the first write operation does not begin on a logical page boundary or the last write operation does not end on a logical page boundary.
15. The apparatus of claim 14, wherein the second temporary storage is a queue in the read-modify-write module.
16. The apparatus of claim 15, further comprising reserving the queue in the read-modify-write module prior to transporting and storing the generated logical page in the queue.
17. The apparatus of claim 14, further comprising a counter configured to count a number of logical blocks in the range of logical block addresses written to the storage medium in a current logical page and compare the count to the value indicating the range of logical block addresses.
18. The apparatus of claim 17, further comprising circuitry configured to generate an indication signal when the comparison indicates that the value indicating the range of logical block addresses is reached.
19. The apparatus of claim 14, wherein the write circuitry writes the logical page from the second temporary storage into the storage medium as a background task to other write operations involving merging.
20. The apparatus of claim 14, further comprising a read-modify-write module comprising circuitry configured to generate a cyclic redundancy code (CRC) for the generated logical page by accumulating CRC data of the logical blocks written into the output logical page on a block-by-block basis.
21 . The apparatus of claim 20, wherein the read-modify-write module is further configured to calculate a data integrity field for each block and insert the calculated data integrity field between the blocks.
22. A method of merging logical pages of data, the method comprising: receiving a command comprising a starting logical block address, a value indicating a range of logical block addresses, and a write mask;
receiving a first plurality of logical blocks associated with the command; dividing the write mask into portions corresponding to a number of logical blocks comprising a logical page;
obtaining a portion of the write mask corresponding to a current logical page; constructing a first logical page based on the corresponding portion of the write mask using the first plurality of logical blocks; and
retrieving from a storage medium a second logical page comprising a second plurality of logical blocks;
generating a merged output logical page by merging logical blocks of the second logical page with logical blocks of the first logical page based on a corresponding logical page portion of the write mask beginning from the starting logical block address.
23. The method of claim 22, wherein if the values of a logical page portion of the write mask are all ones, the second logical page is outputted as the output logical page without being merged.
24. The method of claim 22, wherein if the values of a logical page portion of the write mask are all zeros, no logical page is outputted.
25. The method of claim 22, wherein the merging is performed over a plurality of data paths comprising a plurality of multiplexers.
26. The method of claim 22, wherein the write mask indicates for the range of logical block addresses beginning at and indexed from the starting logical block address which logical blocks of the first and second logical pages are to be merged into the output logical page.
27. The method of claim 26, wherein each logical page comprises a predetermined number of logical blocks; and
additional first logical pages are constructed based on corresponding logical page portions of the write mask and additional second logical pages are retrieved from the storage medium and a plurality of merged output logical pages is generated by merging corresponding first and second logical pages based on the range of logical block addresses and the predetermined number of logical blocks comprising a logical page.
28. The method of claim 26, wherein the addresses of the logical block to be merged are non-consecutive.
29. The method of claim 22, further comprising generating a cyclic redundancy code (CRC) for the merged output logical page by accumulating CRC data of the logical blocks merged into the output logical page on a block-by-block basis.
30. An apparatus for merging logical pages of data, the apparatus comprising: a command input device configured to receive a command comprising a starting logical block address, a value indicating a range of logical block addresses, and a write mask;
a temporary storage configured to receive and store a first plurality of logical blocks associated with the command;
an input logic device configured to receive the first plurality of logical blocks associated with the command from the temporary storage and retrieve from a storage medium a second logical page comprising a second plurality of logical blocks, divide the write mask into portions corresponding to a number of logical blocks comprising a logical page, and construct a first logical page based on a corresponding portion of the write mask using the first plurality of logical blocks; and data path circuitry comprising a plurality of data paths comprising a plurality of multiplexers, the circuitry configured to generate, using the plurality of data paths, a merged output logical page by merging, beginning from the starting logical block address, logical blocks of the second logical page with logical blocks of the first logical page based on a corresponding logical page portion of the write mask.
31 . The apparatus of claim 30, wherein if the values of a logical page portion of the write mask are all ones, the second logical page is outputted as the output logical page without being merged.
32. The apparatus of claim 30, wherein if the values of a logical page portion of the write mask are all zeros, no logical page is outputted.
33. The apparatus of claim 30, further comprising a logical block counter configured to count a number of logical blocks processed beginning from the starting logical block address up to the value indicating the range,
wherein the logical block counter generates an indication signal when the count value matches the logical block address range value received in the command.
34. The apparatus of claim 30, wherein the write mask indicates for the range of logical block addresses beginning at and indexed from the starting logical block address which logical blocks of the first and second logical pages are to be merged into the output logical page.
35. The apparatus of claim 34, wherein each logical page comprises a predetermined number of logical blocks; and
additional first logical pages are constructed based on corresponding logical page portions of the write mask and additional second logical pages are retrieved from the storage medium and a plurality of merged output logical pages is generated by merging corresponding first and second logical pages based on the range of logical block addresses and the predetermined number of logical blocks comprising a logical page.
36. The apparatus of claim 34, wherein the addresses of the logical blocks to be merged are non-consecutive.
37. The apparatus of claim 34, wherein the addresses of the logical blocks to be merged are consecutive.
38. The apparatus of claim 30, further comprising a second logic device configured to generate a cyclic redundancy code (CRC) for the output logical page by accumulating CRC data of the logical blocks merged into the output logical page on a block-by-block basis.
PCT/US2014/054426 2013-09-06 2014-09-05 High performance system providing selective merging of dataframe segments in hardware WO2015047697A1 (en)

Priority Applications (7)

Application Number Priority Date Filing Date Title
CN201480055094.0A CN105612500B (en) 2013-09-06 2014-09-05 The high performance system that the selectivity of data frame section in hardware merges is provided
KR1020167009003A KR101905280B1 (en) 2013-09-06 2014-09-05 High performance system providing selective merging of dataframe segments in hardware
AU2014328501A AU2014328501B2 (en) 2013-09-06 2014-09-05 High performance system providing selective merging of dataframe segments in hardware
CA2923444A CA2923444C (en) 2013-09-06 2014-09-05 High performance system providing selective merging of dataframe segments in hardware
EP14849803.3A EP3042290A4 (en) 2013-09-06 2014-09-05 High performance system providing selective merging of dataframe segments in hardware
JP2016540450A JP2016530648A (en) 2013-09-06 2014-09-05 A high performance system that provides selective merging of data frame segments in hardware
AU2018247214A AU2018247214B2 (en) 2013-09-06 2018-10-09 High performance system providing selective merging of dataframe segments in hardware

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US14/020,653 US9304709B2 (en) 2013-09-06 2013-09-06 High performance system providing selective merging of dataframe segments in hardware
US14/020,653 2013-09-06

Publications (2)

Publication Number Publication Date
WO2015047697A1 true WO2015047697A1 (en) 2015-04-02
WO2015047697A9 WO2015047697A9 (en) 2015-07-02

Family

ID=52626709

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US2014/054426 WO2015047697A1 (en) 2013-09-06 2014-09-05 High performance system providing selective merging of dataframe segments in hardware

Country Status (8)

Country Link
US (2) US9304709B2 (en)
EP (1) EP3042290A4 (en)
JP (1) JP2016530648A (en)
KR (1) KR101905280B1 (en)
CN (1) CN105612500B (en)
AU (1) AU2014328501B2 (en)
CA (1) CA2923444C (en)
WO (1) WO2015047697A1 (en)

Families Citing this family (56)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9304709B2 (en) 2013-09-06 2016-04-05 Western Digital Technologies, Inc. High performance system providing selective merging of dataframe segments in hardware
KR102249810B1 (en) * 2014-07-23 2021-05-11 삼성전자주식회사 Storage device and operating method of storage device
US10209897B2 (en) 2016-12-01 2019-02-19 Toshiba Memory Corporation Storage device and control method of the same
US10243583B2 (en) * 2017-06-16 2019-03-26 Western Digital Technologies, Inc. CPU error remediation during erasure code encoding
US11947489B2 (en) 2017-09-05 2024-04-02 Robin Systems, Inc. Creating snapshots of a storage volume in a distributed storage system
US10579276B2 (en) 2017-09-13 2020-03-03 Robin Systems, Inc. Storage scheme for a distributed storage system
US10430105B2 (en) 2017-09-13 2019-10-01 Robin Systems, Inc. Storage scheme for a distributed storage system
US10452267B2 (en) 2017-09-13 2019-10-22 Robin Systems, Inc. Storage scheme for a distributed storage system
US10534549B2 (en) * 2017-09-19 2020-01-14 Robin Systems, Inc. Maintaining consistency among copies of a logical storage volume in a distributed storage system
US10423344B2 (en) 2017-09-19 2019-09-24 Robin Systems, Inc. Storage scheme for a distributed storage system
US10846001B2 (en) 2017-11-08 2020-11-24 Robin Systems, Inc. Allocating storage requirements in a distributed storage system
US10782887B2 (en) 2017-11-08 2020-09-22 Robin Systems, Inc. Window-based prority tagging of IOPs in a distributed storage system
US10430110B2 (en) 2017-12-19 2019-10-01 Robin Systems, Inc. Implementing a hybrid storage node in a distributed storage system
US10430292B2 (en) 2017-12-19 2019-10-01 Robin Systems, Inc. Snapshot deletion in a distributed storage system
US10452308B2 (en) 2017-12-19 2019-10-22 Robin Systems, Inc. Encoding tags for metadata entries in a storage system
US10896102B2 (en) 2018-01-11 2021-01-19 Robin Systems, Inc. Implementing secure communication in a distributed computing system
US10642697B2 (en) 2018-01-11 2020-05-05 Robin Systems, Inc. Implementing containers for a stateful application in a distributed computing system
US10628235B2 (en) 2018-01-11 2020-04-21 Robin Systems, Inc. Accessing log files of a distributed computing system using a simulated file system
US11748203B2 (en) 2018-01-11 2023-09-05 Robin Systems, Inc. Multi-role application orchestration in a distributed storage system
US11582168B2 (en) 2018-01-11 2023-02-14 Robin Systems, Inc. Fenced clone applications
US11099937B2 (en) 2018-01-11 2021-08-24 Robin Systems, Inc. Implementing clone snapshots in a distributed storage system
US11392363B2 (en) 2018-01-11 2022-07-19 Robin Systems, Inc. Implementing application entrypoints with containers of a bundled application
US10846137B2 (en) 2018-01-12 2020-11-24 Robin Systems, Inc. Dynamic adjustment of application resources in a distributed computing system
US10845997B2 (en) 2018-01-12 2020-11-24 Robin Systems, Inc. Job manager for deploying a bundled application
US10579364B2 (en) 2018-01-12 2020-03-03 Robin Systems, Inc. Upgrading bundled applications in a distributed computing system
US10642694B2 (en) 2018-01-12 2020-05-05 Robin Systems, Inc. Monitoring containers in a distributed computing system
US10976938B2 (en) 2018-07-30 2021-04-13 Robin Systems, Inc. Block map cache
US11023328B2 (en) 2018-07-30 2021-06-01 Robin Systems, Inc. Redo log for append only storage scheme
US10817380B2 (en) 2018-07-31 2020-10-27 Robin Systems, Inc. Implementing affinity and anti-affinity constraints in a bundled application
US10599622B2 (en) 2018-07-31 2020-03-24 Robin Systems, Inc. Implementing storage volumes over multiple tiers
US11036439B2 (en) 2018-10-22 2021-06-15 Robin Systems, Inc. Automated management of bundled applications
US10908848B2 (en) 2018-10-22 2021-02-02 Robin Systems, Inc. Automated management of bundled applications
US10620871B1 (en) 2018-11-15 2020-04-14 Robin Systems, Inc. Storage scheme for a distributed storage system
US11086725B2 (en) 2019-03-25 2021-08-10 Robin Systems, Inc. Orchestration of heterogeneous multi-role applications
US11256434B2 (en) 2019-04-17 2022-02-22 Robin Systems, Inc. Data de-duplication
US10831387B1 (en) 2019-05-02 2020-11-10 Robin Systems, Inc. Snapshot reservations in a distributed storage system
US10877684B2 (en) 2019-05-15 2020-12-29 Robin Systems, Inc. Changing a distributed storage volume from non-replicated to replicated
US11226847B2 (en) 2019-08-29 2022-01-18 Robin Systems, Inc. Implementing an application manifest in a node-specific manner using an intent-based orchestrator
US11520650B2 (en) 2019-09-05 2022-12-06 Robin Systems, Inc. Performing root cause analysis in a multi-role application
US11249851B2 (en) 2019-09-05 2022-02-15 Robin Systems, Inc. Creating snapshots of a storage volume in a distributed storage system
US11347684B2 (en) 2019-10-04 2022-05-31 Robin Systems, Inc. Rolling back KUBERNETES applications including custom resources
US11113158B2 (en) 2019-10-04 2021-09-07 Robin Systems, Inc. Rolling back kubernetes applications
US11403188B2 (en) 2019-12-04 2022-08-02 Robin Systems, Inc. Operation-level consistency points and rollback
US11294824B2 (en) 2020-01-03 2022-04-05 Western Digital Technologies, Inc. System and method for reduced latency of read-modify-write operations
KR20210121660A (en) * 2020-03-31 2021-10-08 에스케이하이닉스 주식회사 Memory system and operating method thereof
US11108638B1 (en) 2020-06-08 2021-08-31 Robin Systems, Inc. Health monitoring of automatically deployed and managed network pipelines
US11528186B2 (en) 2020-06-16 2022-12-13 Robin Systems, Inc. Automated initialization of bare metal servers
US11740980B2 (en) 2020-09-22 2023-08-29 Robin Systems, Inc. Managing snapshot metadata following backup
US11743188B2 (en) 2020-10-01 2023-08-29 Robin Systems, Inc. Check-in monitoring for workflows
US11271895B1 (en) 2020-10-07 2022-03-08 Robin Systems, Inc. Implementing advanced networking capabilities using helm charts
US11456914B2 (en) 2020-10-07 2022-09-27 Robin Systems, Inc. Implementing affinity and anti-affinity with KUBERNETES
US11750451B2 (en) 2020-11-04 2023-09-05 Robin Systems, Inc. Batch manager for complex workflows
US11556361B2 (en) 2020-12-09 2023-01-17 Robin Systems, Inc. Monitoring and managing of complex multi-role applications
CN115794700A (en) * 2022-11-28 2023-03-14 无锡众星微系统技术有限公司 Aggregation management disc access method and device
CN116248573B (en) * 2022-12-01 2024-06-18 中国联合网络通信集团有限公司 Link splicing method, device and storage medium
CN117369729B (en) * 2023-12-04 2024-02-06 武汉麓谷科技有限公司 Additional writing implementation method of ZNS SSD

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2006062511A1 (en) 2004-12-06 2006-06-15 Teac Aerospace Technologies, Inc. System and method of erasing non-volatile recording media
US20090138672A1 (en) * 2007-11-22 2009-05-28 Hitachi, Ltd. Storage controller and storage controller control method
US20110060887A1 (en) * 2009-09-09 2011-03-10 Fusion-io, Inc Apparatus, system, and method for allocating storage
US20120239869A1 (en) * 2010-01-19 2012-09-20 Chiueh Tzi-Cker Random write optimization techniques for flash disks
US20120284587A1 (en) * 2008-06-18 2012-11-08 Super Talent Electronics, Inc. Super-Endurance Solid-State Drive with Endurance Translation Layer (ETL) and Diversion of Temp Files for Reduced Flash Wear
US20130191594A1 (en) * 2011-09-30 2013-07-25 International Business Machines Corporation Direct Memory Address for Solid-State Drives

Family Cites Families (179)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5008886A (en) 1989-01-27 1991-04-16 Digital Equipment Corporation Read-modify-write operation
US5477541A (en) 1989-09-29 1995-12-19 White; Richard E. Addressing technique for storing and referencing packet data
EP0609595B1 (en) 1993-02-05 1998-08-12 Hewlett-Packard Company Method and apparatus for verifying CRC codes by combination of partial CRC codes
US7313639B2 (en) 2003-01-13 2007-12-25 Rambus Inc. Memory system and device with serialized data transfer
KR100739681B1 (en) 2003-03-24 2007-07-13 삼성전자주식회사 Method of overwriting in write-once information storage medium
US6856556B1 (en) 2003-04-03 2005-02-15 Siliconsystems, Inc. Storage subsystem with embedded circuit for protecting against anomalies in power signal from host
US7240180B2 (en) * 2003-06-12 2007-07-03 International Business Machines Corporation Method and system for simultaneously supporting different block sizes on a single hard drive
US7010469B2 (en) 2003-09-30 2006-03-07 International Business Machines Corporation Method of computing partial CRCs
US7171604B2 (en) 2003-12-30 2007-01-30 Intel Corporation Method and apparatus for calculating cyclic redundancy check (CRC) on data using a programmable CRC engine
US7203890B1 (en) 2004-06-16 2007-04-10 Azul Systems, Inc. Address error detection by merging a polynomial-based CRC code of address bits with two nibbles of data or data ECC bits
US7328317B2 (en) 2004-10-21 2008-02-05 International Business Machines Corporation Memory controller and method for optimized read/modify/write performance
US7502256B2 (en) 2004-11-30 2009-03-10 Siliconsystems, Inc. Systems and methods for reducing unauthorized data recovery from solid-state storage devices
KR100667784B1 (en) 2004-12-15 2007-01-11 삼성전자주식회사 Recording/reproducing apparatus for performing RMW for LOW, recording/reproducing method therefore and information recording medium therefore
US8140813B2 (en) 2005-09-15 2012-03-20 Eye-Fi, Inc. Endless memory
US8683144B2 (en) 2005-09-16 2014-03-25 Inmage Systems, Inc. Causation of a data read against a first storage system to optionally store a data write to preserve the version to allow viewing and recovery
JP2007122410A (en) * 2005-10-28 2007-05-17 Nec Electronics Corp Bus arbitration circuit and method
JP2007184046A (en) * 2006-01-10 2007-07-19 Hitachi Global Storage Technologies Netherlands Bv Rotary disk type storage device and recording method
US7653778B2 (en) 2006-05-08 2010-01-26 Siliconsystems, Inc. Systems and methods for measuring the useful life of solid-state storage devices
US8108692B1 (en) 2006-06-27 2012-01-31 Siliconsystems, Inc. Solid-state storage subsystem security solution
US7765373B1 (en) 2006-06-27 2010-07-27 Siliconsystems, Inc. System for controlling use of a solid-state storage subsystem
US7509441B1 (en) 2006-06-30 2009-03-24 Siliconsystems, Inc. Systems and methods for segmenting and protecting a storage subsystem
US7447807B1 (en) 2006-06-30 2008-11-04 Siliconsystems, Inc. Systems and methods for storing data in segments of a storage subsystem
JP4612604B2 (en) 2006-09-28 2011-01-12 Ｎｅｃパーソナルプロダクツ株式会社 Content writing device
US8161227B1 (en) 2006-10-30 2012-04-17 Siliconsystems, Inc. Storage subsystem capable of programming field-programmable devices of a target computer system
US7949794B2 (en) 2006-11-02 2011-05-24 Intel Corporation PCI express enhancements and extensions
WO2008056410A1 (en) 2006-11-07 2008-05-15 Hitachi Software Engineering Co., Ltd. Data processing control method, information processor, and data processing control system
US8549236B2 (en) 2006-12-15 2013-10-01 Siliconsystems, Inc. Storage subsystem with multiple non-volatile memory arrays to protect against data losses
US7596643B2 (en) 2007-02-07 2009-09-29 Siliconsystems, Inc. Storage subsystem with configurable buffer
US8086793B2 (en) 2007-02-16 2011-12-27 Mediatek Inc. Optical disc recorder and buffer management method thereof
JP4900807B2 (en) 2007-03-06 2012-03-21 株式会社日立製作所 Storage system and data management method
JP4992515B2 (en) * 2007-03-30 2012-08-08 ソニー株式会社 Information processing apparatus, information processing method, and computer program
JP4457240B2 (en) 2007-05-09 2010-04-28 フェリカネットワークス株式会社 Data management system, management server, data management method, and program
US7685337B2 (en) 2007-05-24 2010-03-23 Siliconsystems, Inc. Solid state storage subsystem for embedded applications
US7685338B2 (en) 2007-05-24 2010-03-23 Siliconsystems, Inc. Solid state storage subsystem for embedded applications
US7870350B1 (en) * 2007-06-07 2011-01-11 Nvidia Corporation Write buffer for read-write interlocks
US7836372B2 (en) 2007-06-08 2010-11-16 Apple Inc. Memory controller with loopback test interface
US20080320253A1 (en) 2007-06-19 2008-12-25 Andrew Tomlin Memory device with circuitry for writing data of an atomic transaction
US7685186B2 (en) 2007-06-25 2010-03-23 Microsoft Corporation Optimized and robust in-place data transformation
US7685374B2 (en) 2007-07-26 2010-03-23 Siliconsystems, Inc. Multi-interface and multi-bus structured solid-state storage subsystem
JP5059524B2 (en) 2007-09-05 2012-10-24 ルネサスエレクトロニクス株式会社 MEMORY CONTROL CIRCUIT, SEMICONDUCTOR INTEGRATED CIRCUIT, AND NONVOLATILE MEMORY VERIFY METHOD
US8095851B2 (en) 2007-09-06 2012-01-10 Siliconsystems, Inc. Storage subsystem capable of adjusting ECC settings based on monitored conditions
US8868873B2 (en) 2007-09-27 2014-10-21 Rambus Inc. Reconfigurable memory system data strobes
US7934072B2 (en) 2007-09-28 2011-04-26 Lenovo (Singapore) Pte. Ltd. Solid state storage reclamation apparatus and method
JP2009098887A (en) 2007-10-16 2009-05-07 Hitachi Ltd Storage system and data erasing method
US8327090B2 (en) 2007-10-22 2012-12-04 Advantest Corporation Histogram generation with mixed binning memory
US7870351B2 (en) 2007-11-15 2011-01-11 Micron Technology, Inc. System, apparatus, and method for modifying the order of memory accesses
US20090132772A1 (en) 2007-11-21 2009-05-21 Inventec Corporation System and method for performing data reading and writing on physical storage device
US7934052B2 (en) * 2007-12-27 2011-04-26 Pliant Technology, Inc. System and method for performing host initiated mass storage commands using a hierarchy of data structures
US8200914B2 (en) 2008-01-03 2012-06-12 International Business Machines Corporation Apparatus, system, and method for a read-before-write storage controller instruction
US8078918B2 (en) 2008-02-07 2011-12-13 Siliconsystems, Inc. Solid state storage subsystem that maintains and provides access to data reflective of a failure risk
US7962792B2 (en) 2008-02-11 2011-06-14 Siliconsystems, Inc. Interface for enabling a host computer to retrieve device monitor data from a solid state storage subsystem
US8250336B2 (en) 2008-02-25 2012-08-21 International Business Machines Corporation Method, system and computer program product for storing external device result data
JP5315739B2 (en) 2008-03-21 2013-10-16 富士通株式会社 Memory device and memory control method
JP2009230293A (en) 2008-03-21 2009-10-08 Fujitsu Ltd Information processor, storage control device, and control method
JP5141606B2 (en) 2008-03-26 2013-02-13 セイコーエプソン株式会社 Printing device
KR20090109345A (en) 2008-04-15 2009-10-20 삼성전자주식회사 Nonvolatile memory device using variable resistive element, memory system comprising the same
US20090276587A1 (en) 2008-04-30 2009-11-05 Moyer William C Selectively performing a single cycle write operation with ecc in a data processing system
US8112595B1 (en) 2008-05-01 2012-02-07 Marvell Semiconductor Israel Ltd. Command cancellation channel for read—modify—write operation in a memory
US8275970B2 (en) 2008-05-15 2012-09-25 Microsoft Corp. Optimizing write traffic to a disk
US8583880B2 (en) 2008-05-15 2013-11-12 Nxp B.V. Method for secure data reading and data handling system
US7733712B1 (en) 2008-05-20 2010-06-08 Siliconsystems, Inc. Storage subsystem with embedded circuit for protecting against anomalies in power signal from host
JP2009289170A (en) 2008-05-30 2009-12-10 Nec Electronics Corp Data processor, memory controller, and its access control method
KR101315462B1 (en) 2008-07-04 2013-10-04 삼성전자주식회사 Memory controller, printed circuit board, computer system and method for adjusting signal output from memory
JP4970378B2 (en) 2008-07-31 2012-07-04 株式会社東芝 Memory controller and image processing apparatus
US8375151B1 (en) 2009-02-12 2013-02-12 Siliconsystems, Inc. Command portal for securely communicating and executing non-standard storage subsystem commands
US8583835B1 (en) 2008-08-06 2013-11-12 Siliconsystems, Inc. Command portal for executing non-standard storage subsystem commands
JP4924574B2 (en) 2008-08-29 2012-04-25 富士通株式会社 Storage device control unit and control method
KR101339869B1 (en) 2008-09-22 2013-12-10 삼성전자주식회사 Image forming apparatus and method of overwriting for storage unit in image forming apparatus
JP2010080021A (en) * 2008-09-29 2010-04-08 Toshiba Storage Device Corp Recording control method, recording controller, and storage device
JP4582232B2 (en) 2008-09-30 2010-11-17 Ｔｄｋ株式会社 MEMORY CONTROLLER, FLASH MEMORY SYSTEM HAVING MEMORY CONTROLLER, AND FLASH MEMORY CONTROL METHOD
US8122181B2 (en) 2008-11-13 2012-02-21 Spansion Llc Systems and methods for enhancing a data store for handling semantic information
JP4693893B2 (en) * 2008-11-25 2011-06-01 株式会社日立製作所 Storage control device and control method of storage control device
JP2010160653A (en) 2009-01-07 2010-07-22 Renesas Electronics Corp Ring buffer circuit and control circuit for the same
US9176859B2 (en) 2009-01-07 2015-11-03 Siliconsystems, Inc. Systems and methods for improving the performance of non-volatile memory operations
US8024530B2 (en) 2009-01-14 2011-09-20 Cms Products, Inc. Security erase of a delete file and of sectors not currently assigned to a file
KR20110132553A (en) 2009-02-23 2011-12-08 소니 주식회사 Memory device
US8090899B1 (en) 2009-03-04 2012-01-03 Western Digital Technologies, Inc. Solid state drive power safe wear-leveling
US10079048B2 (en) 2009-03-24 2018-09-18 Western Digital Technologies, Inc. Adjusting access of non-volatile semiconductor memory based on access time
US8250328B2 (en) 2009-03-24 2012-08-21 Micron Technology, Inc. Apparatus and method for buffered write commands in a memory
US20100250875A1 (en) 2009-03-25 2010-09-30 Silicon Laboratories Inc. Eeprom emulation using flash memory
US20100250850A1 (en) * 2009-03-25 2010-09-30 Faraday Technology Corp. Processor and method for executing load operation and store operation thereof
EP2239712A1 (en) 2009-04-09 2010-10-13 Gemalto SA Method for personalising an electronic device, associated data processing method and device
US8055816B2 (en) 2009-04-09 2011-11-08 Micron Technology, Inc. Memory controllers, memory systems, solid state drives and methods for processing a number of commands
US8127074B2 (en) 2009-06-09 2012-02-28 Red Hat, Inc. Mechanism for a reader page for a ring buffer
TW201044371A (en) 2009-06-15 2010-12-16 Novatek Microelectronics Corp Memory architecture of display device and reading method thereof
JP2011028559A (en) 2009-07-27 2011-02-10 Denso Corp Relay program and electronic control device
US8402217B2 (en) * 2009-09-15 2013-03-19 Marvell International Ltd. Implementing RAID in solid state memory
US8230276B2 (en) 2009-09-28 2012-07-24 International Business Machines Corporation Writing to memory using adaptive write techniques
TW201111986A (en) 2009-09-29 2011-04-01 Silicon Motion Inc Memory apparatus and data access method for memories
US8254172B1 (en) 2009-09-30 2012-08-28 Western Digital Technologies, Inc. Wear leveling non-volatile semiconductor memory based on erase times and program times
US8243525B1 (en) 2009-09-30 2012-08-14 Western Digital Technologies, Inc. Refreshing non-volatile semiconductor memory by reading without rewriting
US9753847B2 (en) 2009-10-27 2017-09-05 Western Digital Technologies, Inc. Non-volatile semiconductor memory segregating sequential, random, and system data to reduce garbage collection for page based mapping
US8135903B1 (en) 2009-10-30 2012-03-13 Western Digital Technologies, Inc. Non-volatile semiconductor memory compressing data to improve performance
US8261012B2 (en) 2009-10-30 2012-09-04 Western Digital Technologies, Inc. Non-volatile semiconductor memory comprising power fail circuitry for flushing write data in response to a power fail signal
US8397107B1 (en) 2009-12-11 2013-03-12 Western Digital Technologies, Inc. Data storage device employing data path protection using both LBA and PBA
US8443167B1 (en) 2009-12-16 2013-05-14 Western Digital Technologies, Inc. Data storage device employing a run-length mapping table and a single address mapping table
US8473695B2 (en) 2011-03-31 2013-06-25 Mosys, Inc. Memory system including variable write command scheduling
JP5402693B2 (en) 2010-02-05 2014-01-29 富士通株式会社 Disk array device control method and disk array device
US8316176B1 (en) 2010-02-17 2012-11-20 Western Digital Technologies, Inc. Non-volatile semiconductor memory segregating sequential data during garbage collection to reduce write amplification
US8407449B1 (en) 2010-02-26 2013-03-26 Western Digital Technologies, Inc. Non-volatile semiconductor memory storing an inverse map for rebuilding a translation table
CN102193882B (en) 2010-03-15 2014-09-10 京瓷办公信息系统株式会社 Data processing apparatus and data processing method
JP2011192239A (en) 2010-03-17 2011-09-29 Sony Corp Storage device and storage system
TW201133240A (en) 2010-03-22 2011-10-01 Phison Electronics Corp System recovery method, and storage medium controller and storage system using the same
US8725931B1 (en) 2010-03-26 2014-05-13 Western Digital Technologies, Inc. System and method for managing the execution of memory commands in a solid-state memory
US8713066B1 (en) 2010-03-29 2014-04-29 Western Digital Technologies, Inc. Managing wear leveling and garbage collection operations in a solid-state memory using linked lists
US8782327B1 (en) 2010-05-11 2014-07-15 Western Digital Technologies, Inc. System and method for managing execution of internal commands and host commands in a solid-state memory
US9026716B2 (en) 2010-05-12 2015-05-05 Western Digital Technologies, Inc. System and method for managing garbage collection in solid-state memory
TWI446351B (en) 2010-05-27 2014-07-21 Wistron Corp Data writing method and computer system
US8725915B2 (en) 2010-06-01 2014-05-13 Qualcomm Incorporated Virtual buffer interface methods and apparatuses for use in wireless devices
DE102010017215A1 (en) 2010-06-02 2011-12-08 Aicas Gmbh Method for carrying out a memory management
US8341339B1 (en) 2010-06-14 2012-12-25 Western Digital Technologies, Inc. Hybrid drive garbage collecting a non-volatile semiconductor memory by migrating valid data to a disk
US8612669B1 (en) 2010-06-28 2013-12-17 Western Digital Technologies, Inc. System and method for performing data retention in solid-state memory using copy commands and validity and usage data
US8447920B1 (en) 2010-06-29 2013-05-21 Western Digital Technologies, Inc. System and method for managing data access in non-volatile memory
US8521972B1 (en) 2010-06-30 2013-08-27 Western Digital Technologies, Inc. System and method for optimizing garbage collection in data storage
US8639872B1 (en) 2010-08-13 2014-01-28 Western Digital Technologies, Inc. Hybrid drive comprising write cache spanning non-volatile semiconductor memory and disk
US8775720B1 (en) 2010-08-31 2014-07-08 Western Digital Technologies, Inc. Hybrid drive balancing execution times for non-volatile semiconductor memory and disk
US8638602B1 (en) 2010-09-10 2014-01-28 Western Digital Technologies, Inc. Background selection of voltage reference values for performing memory read operations
US8769190B1 (en) 2010-09-15 2014-07-01 Western Digital Technologies, Inc. System and method for reducing contentions in solid-state memory access
US8788779B1 (en) 2010-09-17 2014-07-22 Western Digital Technologies, Inc. Non-volatile storage subsystem with energy-based performance throttling
US8612804B1 (en) 2010-09-30 2013-12-17 Western Digital Technologies, Inc. System and method for improving wear-leveling performance in solid-state memory
US8850137B2 (en) 2010-10-11 2014-09-30 Cisco Technology, Inc. Memory subsystem for counter-based and other applications
KR101688051B1 (en) 2010-11-08 2016-12-20 삼성전자 주식회사 Data processing device and method using error detection code, method for compensating data skew and semiconductor device having data processing device
JP2012119038A (en) 2010-12-02 2012-06-21 Toshiba Corp Nonvolatile semiconductor memory and storage device
US8601313B1 (en) 2010-12-13 2013-12-03 Western Digital Technologies, Inc. System and method for a data reliability scheme in a solid state memory
US8601311B2 (en) 2010-12-14 2013-12-03 Western Digital Technologies, Inc. System and method for using over-provisioned data capacity to maintain a data redundancy scheme in a solid state memory
US8615681B2 (en) 2010-12-14 2013-12-24 Western Digital Technologies, Inc. System and method for maintaining a data redundancy scheme in a solid state memory in the event of a power loss
EP2466451A1 (en) 2010-12-14 2012-06-20 STMicroelectronics Srl Method for controlling operation of a memory, corresponding system, and computer program product
US8458435B1 (en) 2010-12-20 2013-06-04 Western Digital Technologies, Inc. Sequential write thread detection
US8392635B2 (en) 2010-12-22 2013-03-05 Western Digital Technologies, Inc. Selectively enabling a host transfer interrupt
EP2667308A1 (en) 2011-01-19 2013-11-27 Fujitsu Limited Data writing control device, data writing control method, and information processing device
US8683113B2 (en) 2011-02-04 2014-03-25 Western Digital Technologies, Inc. Concurrently searching multiple devices of a non-volatile semiconductor memory
US8700950B1 (en) 2011-02-11 2014-04-15 Western Digital Technologies, Inc. System and method for data error recovery in a solid state subsystem
EP2678769B1 (en) 2011-02-23 2017-01-04 ST-Ericsson SA A device controller for a memory device
US20120221809A1 (en) 2011-02-28 2012-08-30 Hitachi, Ltd. Storage apparatus and data processing method of the same
US8700951B1 (en) 2011-03-09 2014-04-15 Western Digital Technologies, Inc. System and method for improving a data redundancy scheme in a solid state subsystem with additional metadata
JP5712713B2 (en) * 2011-03-18 2015-05-07 富士通株式会社 Control device, control method, and storage device
US8769232B2 (en) 2011-04-06 2014-07-01 Western Digital Technologies, Inc. Non-volatile semiconductor memory module enabling out of order host command chunk media access
JP2012221333A (en) 2011-04-12 2012-11-12 Sony Corp Memory management device, memory management method and control program
US8751728B1 (en) 2011-04-29 2014-06-10 Western Digital Technologies, Inc. Storage system bus transfer optimization
US8909888B2 (en) 2011-04-29 2014-12-09 Seagate Technology Llc Secure erasure of data from a non-volatile memory
US8862804B2 (en) 2011-04-29 2014-10-14 Western Digital Technologies, Inc. System and method for improved parity determination within a data redundancy scheme in a solid state memory
US9021178B2 (en) 2011-05-02 2015-04-28 Western Digital Technologies, Inc. High performance path for command processing
US8503237B1 (en) 2011-05-18 2013-08-06 Western Digital Technologies, Inc. System and method for data recovery in a solid state storage device
US8793429B1 (en) 2011-06-03 2014-07-29 Western Digital Technologies, Inc. Solid-state drive with reduced power up time
US8719531B2 (en) 2011-06-14 2014-05-06 Western Digital Technologies, Inc. System and method for performing data retention that incorporates environmental conditions
WO2012172602A1 (en) 2011-06-15 2012-12-20 Hitachi, Ltd. Storage control apparatus and storage control method
CN102881324B (en) 2011-07-11 2015-07-08 澜起科技（上海）有限公司 Write circuit, readout circuit, memory buffer and memory bank
US8423722B1 (en) 2011-08-26 2013-04-16 Western Digital Technologies, Inc. System and method for high performance command processing in solid state drives
US8700879B2 (en) 2011-08-31 2014-04-15 Micron Technology, Inc. Concurrent memory operations
KR20130025223A (en) 2011-09-01 2013-03-11 삼성전자주식회사 Method for managing memory and image forming apparatus performing the same
US8700834B2 (en) 2011-09-06 2014-04-15 Western Digital Technologies, Inc. Systems and methods for an enhanced controller architecture in data storage systems
US8713357B1 (en) 2011-09-06 2014-04-29 Western Digital Technologies, Inc. Systems and methods for detailed error reporting in data storage systems
US8707104B1 (en) 2011-09-06 2014-04-22 Western Digital Technologies, Inc. Systems and methods for error injection in data storage systems
US8510523B2 (en) 2011-09-12 2013-08-13 Microsoft Corporation Memory dump with expanded data and user privacy protection
US8977803B2 (en) 2011-11-21 2015-03-10 Western Digital Technologies, Inc. Disk drive data caching using a multi-tiered memory
JP2013131192A (en) 2011-12-22 2013-07-04 Fujitsu Ltd Storage device and method for controlling storage device
JP5687639B2 (en) 2012-02-08 2015-03-18 株式会社東芝 Controller, data storage device and program
US8724422B1 (en) 2012-02-29 2014-05-13 Western Digital Technologies, Inc. System and method for charging back-up charge storage element for data storage device using spindle phase switching elements
JP5853899B2 (en) 2012-03-23 2016-02-09 ソニー株式会社 Storage control device, storage device, information processing system, and processing method therefor
JP5938997B2 (en) 2012-03-30 2016-06-22 富士通株式会社 Information storage device, information storage device control program, and information storage device control method
JP5867264B2 (en) 2012-04-24 2016-02-24 ソニー株式会社 Storage control device, memory system, information processing system, and storage control method
US9003224B2 (en) 2012-04-25 2015-04-07 Western Digital Technologies, Inc. Managing unreliable memory in data storage systems
CN103455280B (en) 2012-05-31 2016-12-14 国际商业机器公司 For performing the method and system of memory copy
US8788778B1 (en) 2012-06-04 2014-07-22 Western Digital Technologies, Inc. Garbage collection based on the inactivity level of stored data
JP5929790B2 (en) 2012-06-19 2016-06-08 ソニー株式会社 Storage control device, storage device, information processing system, and processing method therefor
US9304953B2 (en) 2012-06-29 2016-04-05 Cypress Semiconductor Corporation Memory controller devices, systems and methods for translating memory requests between first and second formats for high reliability memory devices
US9703482B2 (en) 2012-06-29 2017-07-11 Vmware, Inc. Filter appliance for object-based storage system
US8966343B2 (en) 2012-08-21 2015-02-24 Western Digital Technologies, Inc. Solid-state drive retention monitor using reference blocks
US8788880B1 (en) 2012-08-22 2014-07-22 Western Digital Technologies, Inc. Efficient retry mechanism for solid-state memory failures
KR20140028618A (en) 2012-08-29 2014-03-10 삼성전자주식회사 Memory device for reducimg write fail, system includinmg tha same, and method there-of
KR101975534B1 (en) 2012-09-11 2019-05-07 삼성전자주식회사 Semiconductor memory device with operation functions
US9268682B2 (en) 2012-10-05 2016-02-23 Skyera, Llc Methods, devices and systems for physical-to-logical mapping in solid state drives
US8972826B2 (en) 2012-10-24 2015-03-03 Western Digital Technologies, Inc. Adaptive error correction codes for data storage systems
US9740485B2 (en) 2012-10-26 2017-08-22 Micron Technology, Inc. Apparatuses and methods for memory operations having variable latencies
US9177638B2 (en) 2012-11-13 2015-11-03 Western Digital Technologies, Inc. Methods and devices for avoiding lower page corruption in data storage devices
US8954694B2 (en) 2012-11-15 2015-02-10 Western Digital Technologies, Inc. Methods, data storage devices and systems for fragmented firmware table rebuild in a solid state drive
US9021339B2 (en) 2012-11-29 2015-04-28 Western Digital Technologies, Inc. Data reliability schemes for data storage systems
US9064606B2 (en) * 2012-12-20 2015-06-23 Advanced Micro Devices, Inc. Memory interface supporting both ECC and per-byte data masking
US9304709B2 (en) 2013-09-06 2016-04-05 Western Digital Technologies, Inc. High performance system providing selective merging of dataframe segments in hardware

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2006062511A1 (en) 2004-12-06 2006-06-15 Teac Aerospace Technologies, Inc. System and method of erasing non-volatile recording media
US20090138672A1 (en) * 2007-11-22 2009-05-28 Hitachi, Ltd. Storage controller and storage controller control method
US20120284587A1 (en) * 2008-06-18 2012-11-08 Super Talent Electronics, Inc. Super-Endurance Solid-State Drive with Endurance Translation Layer (ETL) and Diversion of Temp Files for Reduced Flash Wear
US20110060887A1 (en) * 2009-09-09 2011-03-10 Fusion-io, Inc Apparatus, system, and method for allocating storage
US20120239869A1 (en) * 2010-01-19 2012-09-20 Chiueh Tzi-Cker Random write optimization techniques for flash disks
US20130191594A1 (en) * 2011-09-30 2013-07-25 International Business Machines Corporation Direct Memory Address for Solid-State Drives

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP3042290A4

Also Published As

Publication number Publication date
JP2016530648A (en) 2016-09-29
CN105612500B (en) 2019-04-12
US9304709B2 (en) 2016-04-05
CA2923444C (en) 2019-11-19
KR101905280B1 (en) 2018-10-05
EP3042290A4 (en) 2017-08-30
AU2014328501B2 (en) 2018-11-08
CN105612500A (en) 2016-05-25
US20150074358A1 (en) 2015-03-12
CA2923444A1 (en) 2015-04-02
US9760304B2 (en) 2017-09-12
WO2015047697A9 (en) 2015-07-02
KR20160052690A (en) 2016-05-12
EP3042290A1 (en) 2016-07-13
US20160132248A1 (en) 2016-05-12

Similar Documents

Publication Publication Date Title
US9760304B2 (en) High performance system for selective merging of dataframe segments
AU2014328501A1 (en) High performance system providing selective merging of dataframe segments in hardware
TWI514139B (en) Physical page, logical page, and codeword correspondence
US9208018B1 (en) Systems and methods for reclaiming memory for solid-state memory
US9009565B1 (en) Systems and methods for mapping for solid-state memory
US9377960B2 (en) System and method of using stripes for recovering data in a flash storage system
US9026867B1 (en) Systems and methods for adapting to changing characteristics of multi-level cells in solid-state memory
US20070268905A1 (en) Non-volatile memory error correction system and method
US9053012B1 (en) Systems and methods for storing data for solid-state memory
US9058288B2 (en) Redundant storage in non-volatile memory by storing redundancy information in volatile memory
US20100211834A1 (en) Data integrity in memory controllers and methods
US11138069B2 (en) Providing additional parity for non-standard sized parity data sets
US20140115422A1 (en) Non-volatile memory error correction
US9948322B1 (en) High performance read-modify-write system providing line-rate merging of dataframe segments in hardware
CN103197985B (en) Storage control device
US20180157428A1 (en) Data protection of flash storage devices during power loss
US9081701B1 (en) Systems and methods for decoding data for solid-state memory
US20120233382A1 (en) Data storage apparatus and method for table management
US20200042386A1 (en) Error Correction With Scatter-Gather List Data Management
AU2018247214B2 (en) High performance system providing selective merging of dataframe segments in hardware

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: 14849803

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2923444

Country of ref document: CA

Ref document number: 2016540450

Country of ref document: JP

Kind code of ref document: A

NENP Non-entry into the national phase

Ref country code: DE

REEP Request for entry into the european phase

Ref document number: 2014849803

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 2014849803

Country of ref document: EP

ENP Entry into the national phase

Ref document number: 2014328501

Country of ref document: AU

Date of ref document: 20140905

Kind code of ref document: A

ENP Entry into the national phase

Ref document number: 20167009003

Country of ref document: KR

Kind code of ref document: A