US11127466B2 - Read data sorting method and storage device for sequentially transmitting read data of continuous logic block addresses to host - Google Patents

Read data sorting method and storage device for sequentially transmitting read data of continuous logic block addresses to host Download PDF

Info

Publication number
US11127466B2
US11127466B2 US16/503,641 US201916503641A US11127466B2 US 11127466 B2 US11127466 B2 US 11127466B2 US 201916503641 A US201916503641 A US 201916503641A US 11127466 B2 US11127466 B2 US 11127466B2
Authority
US
United States
Prior art keywords
logic block
data
address
host
block addresses
Prior art date
Legal status (The legal status 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 status listed.)
Active
Application number
US16/503,641
Other versions
US20200168281A1 (en
Inventor
Tsan-Lin Chen
Chih-Jhen Chen
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shenzhen Epostar Electronics Ltd Co
Original Assignee
Shenzhen Epostar Electronics Ltd Co
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 Shenzhen Epostar Electronics Ltd Co filed Critical Shenzhen Epostar Electronics Ltd Co
Assigned to SHENZHEN EPOSTAR ELECTRONICS LIMITED CO. reassignment SHENZHEN EPOSTAR ELECTRONICS LIMITED CO. ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: CHEN, CHIH-JHEN, CHEN, TSAN-LIN
Publication of US20200168281A1 publication Critical patent/US20200168281A1/en
Application granted granted Critical
Publication of US11127466B2 publication Critical patent/US11127466B2/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G11—INFORMATION STORAGE
    • G11C—STATIC STORES
    • G11C16/00—Erasable programmable read-only memories
    • G11C16/02—Erasable programmable read-only memories electrically programmable
    • G11C16/06—Auxiliary circuits, e.g. for writing into memory
    • G11C16/26—Sensing or reading circuits; Data output circuits
    • G—PHYSICS
    • G11—INFORMATION STORAGE
    • G11C—STATIC STORES
    • G11C16/00—Erasable programmable read-only memories
    • G11C16/02—Erasable programmable read-only memories electrically programmable
    • G11C16/06—Auxiliary circuits, e.g. for writing into memory
    • G11C16/10—Programming or data input circuits
    • G11C16/107—Programming all cells in an array, sector or block to the same state prior to flash erasing
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; 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 OR CALCULATING; 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/0614—Improving the reliability of storage systems
    • G06F3/0619—Improving the reliability of storage systems in relation to data integrity, e.g. data losses, bit errors
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; 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 OR CALCULATING; 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 OR CALCULATING; 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 OR CALCULATING; 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]
    • G—PHYSICS
    • G11—INFORMATION STORAGE
    • G11C—STATIC STORES
    • G11C11/00—Digital stores characterised by the use of particular electric or magnetic storage elements; Storage elements therefor
    • G11C11/21—Digital stores characterised by the use of particular electric or magnetic storage elements; Storage elements therefor using electric elements
    • G11C11/34—Digital stores characterised by the use of particular electric or magnetic storage elements; Storage elements therefor using electric elements using semiconductor devices
    • G11C11/40—Digital stores characterised by the use of particular electric or magnetic storage elements; Storage elements therefor using electric elements using semiconductor devices using transistors
    • G11C11/401—Digital stores characterised by the use of particular electric or magnetic storage elements; Storage elements therefor using electric elements using semiconductor devices using transistors forming cells needing refreshing or charge regeneration, i.e. dynamic cells
    • G11C11/4063—Auxiliary circuits, e.g. for addressing, decoding, driving, writing, sensing or timing
    • G11C11/407—Auxiliary circuits, e.g. for addressing, decoding, driving, writing, sensing or timing for memory cells of the field-effect type
    • G11C11/409—Read-write [R-W] circuits 
    • G11C11/4096—Input/output [I/O] data management or control circuits, e.g. reading or writing circuits, I/O drivers or bit-line switches 
    • G—PHYSICS
    • G11—INFORMATION STORAGE
    • G11C—STATIC STORES
    • G11C16/00—Erasable programmable read-only memories
    • G11C16/02—Erasable programmable read-only memories electrically programmable
    • G11C16/06—Auxiliary circuits, e.g. for writing into memory
    • G11C16/08—Address circuits; Decoders; Word-line control circuits
    • G—PHYSICS
    • G11—INFORMATION STORAGE
    • G11C—STATIC STORES
    • G11C7/00—Arrangements for writing information into, or reading information out from, a digital store
    • G11C7/10—Input/output [I/O] data interface arrangements, e.g. I/O data control circuits, I/O data buffers
    • G11C7/1006—Data managing, e.g. manipulating data before writing or reading out, data bus switches or control circuits therefor
    • G—PHYSICS
    • G11—INFORMATION STORAGE
    • G11C—STATIC STORES
    • G11C7/00—Arrangements for writing information into, or reading information out from, a digital store
    • G11C7/10—Input/output [I/O] data interface arrangements, e.g. I/O data control circuits, I/O data buffers
    • G11C7/1006—Data managing, e.g. manipulating data before writing or reading out, data bus switches or control circuits therefor
    • G11C7/1012—Data reordering during input/output, e.g. crossbars, layers of multiplexers, shifting or rotating
    • G—PHYSICS
    • G11—INFORMATION STORAGE
    • G11C—STATIC STORES
    • G11C7/00—Arrangements for writing information into, or reading information out from, a digital store
    • G11C7/10—Input/output [I/O] data interface arrangements, e.g. I/O data control circuits, I/O data buffers
    • G11C7/1051—Data output circuits, e.g. read-out amplifiers, data output buffers, data output registers, data output level conversion circuits
    • G11C7/1057—Data output buffers, e.g. comprising level conversion circuits, circuits for adapting load
    • G—PHYSICS
    • G11—INFORMATION STORAGE
    • G11C—STATIC STORES
    • G11C8/00—Arrangements for selecting an address in a digital store
    • G11C8/04—Arrangements for selecting an address in a digital store using a sequential addressing device, e.g. shift register, counter
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2212/00—Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
    • G06F2212/72—Details relating to flash memory management
    • G06F2212/7203—Temporary buffering, e.g. using volatile buffer or dedicated buffer blocks

Definitions

  • the disclosure relates to a read data sorting method and a storage device, and particularly to a read data sorting method and a storage device that are capable of transmitting read data of continuous logic block addresses to a host sequentially.
  • an output read data sequence may be interrupted by the location of data or bus resources.
  • Some interfaces of the hosts does not support the output of non-ordering read data sequence; and extra firmwares are needed in the hosts to rearrange the non-ordering read data sequence. Without the abovementioned firmwares, read errors may occur to the hosts.
  • a media controller 132 may transmit read data from a storage media 131 to a data buffer 133 .
  • the output data sequence may become a non-ordering read data output 141 and non-ordering read data output 142 due to the different speeds of the read channel.
  • the first host 110 may correctly process the non-ordering read data output 141 .
  • the second host 120 may only receive the ordering read data output of data ( 0 ), data ( 1 ), . . . , data ( 7 ). Therefore, the second host 120 may cause a system failure when receiving the non-ordering read data output 142 .
  • how to output the read data to the host sequentially should be a goal that persons skilled in the art dedicate to achieve.
  • the disclosure provide a read data sorting method and storage device, allowing read data to be output to a host.
  • the disclosure provide a read data sorting method including: receiving a read command to read multiple logic block addresses, wherein the logic block addresses are continuous; initializing an address counter as an initial logic block address of the logic block addresses; storing a first logic block address in a sorting buffer and setting a tag corresponding to the first logic block address as valid when a first data corresponding to the first logic block address of the logic block addresses is transmitted to a data buffer; and transmitting a second data corresponding to a second logic block address to a host and accumulating the address counter when the tag corresponding to a second logic block address of the logic block addresses in the sorting buffer is valid and the second logic block address equals to the address counter.
  • the abovementioned read data sorting method further includes: when the second data is transmitted to the host, the tag corresponding to the second logic block is set as invalid.
  • the size of the abovementioned sorting buffer is related to the number of the logic block addresses corresponding to the read command.
  • the value of accumulating the address counter each time equals to a deviation of the directly adjacent logic block addresses.
  • the value of the tag when the tag is set as valid, the value of the tag is 1; when the tag is set as invalid, the value of the tag is 0.
  • the disclosure provides a storage device including a processor, a sorting buffer coupled to the processor, and a data buffer coupled to the sorting buffer.
  • the processor receives a read command to read multiple logic block addresses, wherein the logic block addresses are continuous.
  • the processor initialize an address counter as an initial logic block address of the logic block addresses.
  • the processor stores the first logic block address in a sorting buffer, and set a tag corresponding to the first logic address as valid.
  • the processor transmits a second data corresponding to the second logic block address to a host and accumulate the address counter.
  • a processor sets a tag corresponding to a second logic block address as invalid.
  • the size of the abovementioned sorting buffer is related to the number of logic block addresses corresponding to a read command.
  • a value of accumulating an address counter equals to the deviation of the directly adjacent logic block addresses.
  • the value of the tag when a tag is set as valid, the value of the tag is 1, and when the tag is set as invalid, the value of the tag is 0.
  • the read data sorting method and the storage device of the disclosure initialize the address counter when reading multiple logic block addresses.
  • the processor transmits the logic block addresses corresponding to the data to the sorting buffer, and set the tag of the logic block addresses as valid to represent that the data corresponding to the logic block addresses is transmitted to the data buffer.
  • the processor transmits the data corresponding to the logic block addresses to the host and accumulate the address counter.
  • the read data may be output to the host according to the order of the logic block addresses.
  • FIG. 1 is a schematic view of a known storage device.
  • FIG. 2 is a block diagram of a storage device according to an embodiment of the disclosure.
  • FIG. 3A to FIG. 3H is a schematic view of a read data sorting method according to an embodiment of the disclosure.
  • FIG. 4 is a process chart of a read data sorting method according to an embodiment of the disclosure.
  • FIG. 2 is a block diagram of a storage device according to an embodiment of the disclosure.
  • a storage device 230 of the disclosure includes a storage media 231 , and media controller 232 , a data buffer 233 and a sorting buffer 234 .
  • the media controller 232 may transmit the read data from the storage media 231 to the data buffer 233 .
  • the read data may be transmitted directly from the data buffer 233 to the non-ordering data channel 211 .
  • the read data may be transmitted to the non-ordering data channel 211 of the first host 210 immediately.
  • the storage device 230 may include one to multiple processors (not shown in the drawings) to be in charge of the commands of input and output of the host or processes of other types of orders.
  • FIG. 3A to FIG. 3H is an example of read data sorting method according to an embodiment of the disclosure.
  • a second host 220 transmits a read command to read the data of logical block addresses LBA ( 0 ), LBA ( 1 ), LBA ( 2 ) and LBA ( 3 ), which are data ( 0 ), data ( 1 ), data ( 2 ) and data ( 3 ) respectively.
  • LBA logical block addresses
  • the storage device 230 may initialize an address counter as a logic block address LBA ( 0 ) such as an initial address of a LBA ( 0 ).
  • the data ( 2 ) may be transmitted to the data buffer 233 from a media controller 232 .
  • the sorting buffer 234 may store the LBA ( 2 ) and set a tag corresponding to the LBA ( 2 ) as valid (for example, 1).
  • the tag being set as valid represent that the data ( 2 ) corresponding to the LBA ( 2 ) have been temporarily stored in the data buffer 233 . Since the LBA ( 2 ) does not equal to the value of the current address counter, the data ( 2 ) may not be transmitted to the second host 220 .
  • the data ( 1 ) is transmitted to the data buffer 233 from the media controller 232 .
  • the sorting buffer 234 may store the LBA ( 1 ) and set the tag corresponding to the LBA ( 1 ) as valid (for example, 1). Since LBA ( 1 ) does not equal to the value of the current address counter, the data ( 1 ) may not be transmitted to the second host 220 .
  • the data ( 0 ) is transmitted to the data buffer 233 from the media controller 232 .
  • the sorting buffer 234 may store the LBA ( 0 ) and set the tag corresponding to the LBA ( 0 ) as valid (for example, 1). Since the LBA ( 0 ) equals to the value of the current address counter and the tag corresponding to the LBA ( 0 ) in the sorting buffer is 1, the data ( 0 ) may be transmitted to the second host 220 from the data buffer 233 as shown in FIG. 3D .
  • the tag corresponding to the LBA ( 0 ) in the sorting buffer 234 may be set as invalid (for example, 0), and the address counter may be accumulated.
  • the address counter is set as the LBA ( 1 ) to represent the logic block address of the data that is going to be transmitted next.
  • the address counter may be initialized as 0 and added by 1 in each accumulation.
  • the value of the address counter represent the number the logic block address among the continuous logic block addresses corresponding to the read command.
  • the address counter 0 corresponds to LBA ( 0 )
  • the address counter 1 corresponds to LBA ( 1 ) and so on.
  • the address counter is 0 corresponding to the LBA ( 4 )
  • the address counter is 1 corresponding to the LBA ( 5 ), and so on.
  • the data ( 3 ) is transmitted to the data buffer 233 from the media controller 232 .
  • the sorting buffer 234 may store the LBA ( 3 ) and set the tag corresponding to the LBA ( 3 ) as valid (for example, 1). Since LBA ( 1 ) equals to the value of the current address counter and the tag corresponding to the LBA ( 1 ) in the sorting buffer 234 is 1, the data ( 1 ) may be transmitted to the second host 220 from the data buffer 233 as shown in FIG. 3F .
  • the tag corresponding to the LBA ( 1 ) in the sorting buffer 234 may be set as invalid (for example, 0), and the address counter may be accumulated.
  • the address counter is set as LBA ( 2 ) to represent the logic block address of the data that is going to be transmitted next.
  • the data ( 2 ) may be transmitted to the second host 220 from the data buffer 233 as shown in FIG. 3G .
  • the tag corresponding to the LBA ( 2 ) in the sorting buffer 234 may be set as invalid (for example, 0), and the address counter may be accumulated.
  • the address counter is set as LBA ( 3 ) to represent the logic block address of the data that is going to be transmitted next.
  • the data ( 3 ) may be transmitted to the second host 220 from the data buffer 233 . Therefore, the data ( 0 ), data ( 1 ), data ( 2 ) and data ( 3 ) may be transmitted to the second host 220 according to the order of the read data sorting method of an embodiment of the disclosure, so that errors may not occur to the second host 220 having the ordering data channel 221 .
  • the size of the sorting buffer 234 needs to be designated as being able to store at most the number of the logic block addresses read by the read command, so as to contain all the logic block addresses corresponding to the read command in the worst scenario such as the scenario of the data ( 0 ) being transmitted to the data buffer 233 at last as shown in the examples of FIGS. 3A to 3H .
  • FIG. 4 is a process chart of a read data sorting method according to an embodiment of the disclosure.
  • step S 401 a read command is received to read multiple logic block addresses, wherein the logic block addresses are continuous.
  • step S 402 an address counter is initialized as an initial logic block address of the logic block addresses.
  • step S 403 when a first data corresponding to a first logic block address of the logic block addresses is transmitted to the data buffer, the first logic block address is stored in a sorting buffer and a tag corresponding to the first logic block address is set as valid.
  • step S 404 when a tag corresponding to a second logic block address of the logic block addresses in the sorting buffer is valid and the second logic block address equals to the address counter, a second data corresponding to the second logic block address is transmitted to the host and the address counter is accumulated.
  • the read data sorting method and storage device of the disclosure may initialize the address counter when reading multiple logic block addresses.
  • the processor may transmit the logic block address corresponding to the data to the sorting buffer, and set the tag of the logic block address as valid to represent the data corresponding to the logic block address.
  • the processor may transmit the data corresponding to the logic block address to the host the accumulate the address counter.
  • the read data may be transmitted to the host according to the order of the logic block addresses.

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)
  • Microelectronics & Electronic Packaging (AREA)
  • Computer Security & Cryptography (AREA)
  • Databases & Information Systems (AREA)
  • Computer Hardware Design (AREA)
  • Memory System Of A Hierarchy Structure (AREA)
  • Computer And Data Communications (AREA)

Abstract

A read data sorting method and a storage device are provided. The read data sorting method includes: receiving a read command to read multiple logic block addresses (LBAs), wherein the LBAs are continuous; initializing an address counter as an initial logic block address of the LBAs; storing a first logic block address in a sorting buffer and set a tag corresponding to the first logic block address as valid when a first data corresponding to the first logic block address of the LBAs is transmitted to the data buffer; and transmitting a second data corresponding to a second logic block address to a host and accumulating the address counter when the tag corresponding to the second logic block address of the LBAs in the sorting buffer is valid and the second logic block address equals to the address counter.

Description

CROSS-REFERENCE TO RELATED APPLICATION
This application claims the priority benefit of Taiwan application serial no. 107142111, filed on Nov. 26, 2018. The entirety of the above-mentioned patent application is hereby incorporated by reference herein and made a part of this specification.
BACKGROUND Technical Field
The disclosure relates to a read data sorting method and a storage device, and particularly to a read data sorting method and a storage device that are capable of transmitting read data of continuous logic block addresses to a host sequentially.
In a highly efficient storage device, an output read data sequence may be interrupted by the location of data or bus resources. Some interfaces of the hosts does not support the output of non-ordering read data sequence; and extra firmwares are needed in the hosts to rearrange the non-ordering read data sequence. Without the abovementioned firmwares, read errors may occur to the hosts.
Take FIG. 1 for instance. When a first host 110 or a second host 120 transmit a read command to a storage device 130, a media controller 132 may transmit read data from a storage media 131 to a data buffer 133. However, the output data sequence may become a non-ordering read data output 141 and non-ordering read data output 142 due to the different speeds of the read channel. When the first host 110 has a non-ordering data channel 111, the first host 110 may correctly process the non-ordering read data output 141. However, when the second host 120 has only an ordering data channel 121, the second host 120 may only receive the ordering read data output of data (0), data (1), . . . , data (7). Therefore, the second host 120 may cause a system failure when receiving the non-ordering read data output 142. Thus, how to output the read data to the host sequentially should be a goal that persons skilled in the art dedicate to achieve.
SUMMARY
The disclosure provide a read data sorting method and storage device, allowing read data to be output to a host.
The disclosure provide a read data sorting method including: receiving a read command to read multiple logic block addresses, wherein the logic block addresses are continuous; initializing an address counter as an initial logic block address of the logic block addresses; storing a first logic block address in a sorting buffer and setting a tag corresponding to the first logic block address as valid when a first data corresponding to the first logic block address of the logic block addresses is transmitted to a data buffer; and transmitting a second data corresponding to a second logic block address to a host and accumulating the address counter when the tag corresponding to a second logic block address of the logic block addresses in the sorting buffer is valid and the second logic block address equals to the address counter.
In an embodiment of the disclosure, the abovementioned read data sorting method further includes: when the second data is transmitted to the host, the tag corresponding to the second logic block is set as invalid.
In an embodiment of the disclosure, the size of the abovementioned sorting buffer is related to the number of the logic block addresses corresponding to the read command.
In an embodiment of the disclosure, the value of accumulating the address counter each time equals to a deviation of the directly adjacent logic block addresses.
In an embodiment of the disclosure, when the tag is set as valid, the value of the tag is 1; when the tag is set as invalid, the value of the tag is 0.
The disclosure provides a storage device including a processor, a sorting buffer coupled to the processor, and a data buffer coupled to the sorting buffer. The processor receives a read command to read multiple logic block addresses, wherein the logic block addresses are continuous. The processor initialize an address counter as an initial logic block address of the logic block addresses. When a first data corresponding to a first logic block address of the logic block addresses is transmitted to a data buffer, the processor stores the first logic block address in a sorting buffer, and set a tag corresponding to the first logic address as valid. When the tag corresponding to a second logic block address of the logic block addresses in the sorting buffer is valid and the second logic block address equals to the address counter, the processor transmits a second data corresponding to the second logic block address to a host and accumulate the address counter.
In an embodiment of the disclosure, wherein after second data is transmitted to a host, a processor sets a tag corresponding to a second logic block address as invalid.
In an embodiment of the disclosure, the size of the abovementioned sorting buffer is related to the number of logic block addresses corresponding to a read command.
In an embodiment of the disclosure, a value of accumulating an address counter equals to the deviation of the directly adjacent logic block addresses.
In an embodiment of the disclosure, when a tag is set as valid, the value of the tag is 1, and when the tag is set as invalid, the value of the tag is 0.
Based on the above, the read data sorting method and the storage device of the disclosure initialize the address counter when reading multiple logic block addresses. When the data is transmitted to the data buffer, the processor transmits the logic block addresses corresponding to the data to the sorting buffer, and set the tag of the logic block addresses as valid to represent that the data corresponding to the logic block addresses is transmitted to the data buffer. When the tag corresponding to the logic block addresses in the sorting buffer is valid and the logic block addresses equal to the address counter, the processor transmits the data corresponding to the logic block addresses to the host and accumulate the address counter. According to the abovementioned data sorting method, the read data may be output to the host according to the order of the logic block addresses.
In order to make the features and advantages of the disclosure mentioned above more understandable, embodiments will be described in detail below with reference to the accompanying drawings.
BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is a schematic view of a known storage device.
FIG. 2 is a block diagram of a storage device according to an embodiment of the disclosure.
FIG. 3A to FIG. 3H is a schematic view of a read data sorting method according to an embodiment of the disclosure.
FIG. 4 is a process chart of a read data sorting method according to an embodiment of the disclosure.
 DESCRIPTION OF THE EMBODIMENTS
FIG. 2 is a block diagram of a storage device according to an embodiment of the disclosure.
Please refer to FIG. 2, a storage device 230 of the disclosure includes a storage media 231, and media controller 232, a data buffer 233 and a sorting buffer 234. When a first host 210 or a second host 220 transmit a read command to the storage device 230, the media controller 232 may transmit the read data from the storage media 231 to the data buffer 233. When the first host 210 has a non-ordering data channel 211, the read data may be transmitted directly from the data buffer 233 to the non-ordering data channel 211. In other words, when a read data enters the data buffer 233, the read data may be transmitted to the non-ordering data channel 211 of the first host 210 immediately. When the second host 210 has an ordering data channel 221, an operation of the sorting buffer 234 needs to be performed to allow the read data in the data buffer 233 to be transmitted to the ordering data channel 221 of the second host 220 according to the predetermined order. The storage device 230 may include one to multiple processors (not shown in the drawings) to be in charge of the commands of input and output of the host or processes of other types of orders.
FIG. 3A to FIG. 3H is an example of read data sorting method according to an embodiment of the disclosure.
In FIG. 3A to FIG. 3H, assuming that a second host 220 transmits a read command to read the data of logical block addresses LBA (0), LBA (1), LBA (2) and LBA (3), which are data (0), data (1), data (2) and data (3) respectively. When the storage device 230 obtain the second host 220 having the data of ordering data channel 221, the storage device 230 may initialize an address counter as a logic block address LBA (0) such as an initial address of a LBA (0).
In FIG. 3A, the data (2), may be transmitted to the data buffer 233 from a media controller 232. The sorting buffer 234 may store the LBA (2) and set a tag corresponding to the LBA (2) as valid (for example, 1). The tag being set as valid represent that the data (2) corresponding to the LBA (2) have been temporarily stored in the data buffer 233. Since the LBA (2) does not equal to the value of the current address counter, the data (2) may not be transmitted to the second host 220.
In FIG. 3B, the data (1) is transmitted to the data buffer 233 from the media controller 232. Thus, the sorting buffer 234 may store the LBA (1) and set the tag corresponding to the LBA (1) as valid (for example, 1). Since LBA (1) does not equal to the value of the current address counter, the data (1) may not be transmitted to the second host 220.
In FIG. 3C, the data (0) is transmitted to the data buffer 233 from the media controller 232. Thus, the sorting buffer 234 may store the LBA (0) and set the tag corresponding to the LBA (0) as valid (for example, 1). Since the LBA (0) equals to the value of the current address counter and the tag corresponding to the LBA (0) in the sorting buffer is 1, the data (0) may be transmitted to the second host 220 from the data buffer 233 as shown in FIG. 3D. After the data (0) is transmitted to the second host 220, the tag corresponding to the LBA (0) in the sorting buffer 234 may be set as invalid (for example, 0), and the address counter may be accumulated. For example, the address counter is set as the LBA (1) to represent the logic block address of the data that is going to be transmitted next.
In an embodiment, the address counter may be initialized as 0 and added by 1 in each accumulation. Under this kind of circumstance, the value of the address counter represent the number the logic block address among the continuous logic block addresses corresponding to the read command. For examples, the address counter 0 corresponds to LBA (0) and the address counter 1 corresponds to LBA (1) and so on. In another embodiment, when the read command corresponds to LBA (4), LBA (5), LBA (6) and LBA (7), the address counter is 0 corresponding to the LBA (4), the address counter is 1 corresponding to the LBA (5), and so on.
In FIG. 3E, the data (3) is transmitted to the data buffer 233 from the media controller 232. Thus, the sorting buffer 234 may store the LBA (3) and set the tag corresponding to the LBA (3) as valid (for example, 1). Since LBA (1) equals to the value of the current address counter and the tag corresponding to the LBA (1) in the sorting buffer 234 is 1, the data (1) may be transmitted to the second host 220 from the data buffer 233 as shown in FIG. 3F. After the data (1) is transmitted to the second host 220, the tag corresponding to the LBA (1) in the sorting buffer 234 may be set as invalid (for example, 0), and the address counter may be accumulated. For example, the address counter is set as LBA (2) to represent the logic block address of the data that is going to be transmitted next.
In FIG. 3F, since the LBA (2) equals to the value of the current address counter and the tag corresponding to the LBA (2) in the sorting buffer 234 is 1, the data (2) may be transmitted to the second host 220 from the data buffer 233 as shown in FIG. 3G. After the data (2) is transmitted to the second host 220, the tag corresponding to the LBA (2) in the sorting buffer 234 may be set as invalid (for example, 0), and the address counter may be accumulated. For example, the address counter is set as LBA (3) to represent the logic block address of the data that is going to be transmitted next.
In FIG. 3G, since LBA (3) equals to the value of the current address counter and the tag corresponding to the LBA (3) in the sorting buffer 234 is 1, the data (3) may be transmitted to the second host 220 from the data buffer 233. Therefore, the data (0), data (1), data (2) and data (3) may be transmitted to the second host 220 according to the order of the read data sorting method of an embodiment of the disclosure, so that errors may not occur to the second host 220 having the ordering data channel 221.
It is worth noting that the size of the sorting buffer 234 needs to be designated as being able to store at most the number of the logic block addresses read by the read command, so as to contain all the logic block addresses corresponding to the read command in the worst scenario such as the scenario of the data (0) being transmitted to the data buffer 233 at last as shown in the examples of FIGS. 3A to 3H.
FIG. 4 is a process chart of a read data sorting method according to an embodiment of the disclosure.
Please refer to FIG. 4, in step S401, a read command is received to read multiple logic block addresses, wherein the logic block addresses are continuous.
In step S402, an address counter is initialized as an initial logic block address of the logic block addresses.
In step S403, when a first data corresponding to a first logic block address of the logic block addresses is transmitted to the data buffer, the first logic block address is stored in a sorting buffer and a tag corresponding to the first logic block address is set as valid.
In step S404, when a tag corresponding to a second logic block address of the logic block addresses in the sorting buffer is valid and the second logic block address equals to the address counter, a second data corresponding to the second logic block address is transmitted to the host and the address counter is accumulated.
Based on the above, the read data sorting method and storage device of the disclosure may initialize the address counter when reading multiple logic block addresses. When the data is transmitted to the data buffer, the processor may transmit the logic block address corresponding to the data to the sorting buffer, and set the tag of the logic block address as valid to represent the data corresponding to the logic block address. When the tag corresponding to the logic block address in the sorting buffer is valid and the logic block address equals to the address counter, the processor may transmit the data corresponding to the logic block address to the host the accumulate the address counter. According to the data sorting method above, the read data may be transmitted to the host according to the order of the logic block addresses.
Although the disclosure has been disclosed in the above embodiments, the embodiments are not intended to limit the disclosure, and those skilled in the art may make some modifications and refinements without departing from the spirit and scope of the disclosure. Therefore, the scope of the disclosure is defined by the claims attached below.

Claims (3)

What is claimed is:
1. A read data sorting method comprising:
receiving a read command to read multiple logic block addresses, wherein these logic block addresses are continuous;
initializing an address counter as an initial logic block address of the logic block addresses, wherein when the address counter is less than or equal to an end logic block address of the logic block addresses, the following steps are performed:
saving a first logic block address in a sorting buffer and setting a tag corresponding to the first logic address as valid when a first data corresponding to the first logic block address of the logic block addresses is transmitted to a data buffer; and
transmitting a second data corresponding to a second logic block address to a host and accumulating the address counter when the tag corresponding to the second logic block address of the logic block addresses in the sorting buffer is valid and the second logic block address equals to the address counter, wherein the value of accumulating the address counter each time equals to the deviation of the directly adjacent logic block addresses, and
setting the tag corresponding to the second logic block address as invalid after the second data is transmitted to the host.
2. The read data sorting method according to claim 1, wherein the size of the sorting buffer is related to the number of the logic block addresses corresponding to the read command.
3. The read data sorting method according to claim 1, wherein when the tag is set as valid, the value of the tag is 1; when the tag is set as invalid, the value of the tag is 0.
US16/503,641 2018-11-26 2019-07-05 Read data sorting method and storage device for sequentially transmitting read data of continuous logic block addresses to host Active US11127466B2 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
TW107142111A TW202020664A (en) 2018-11-26 2018-11-26 Read data sorting method and storage device
TW107142111 2018-11-26

Publications (2)

Publication Number Publication Date
US20200168281A1 US20200168281A1 (en) 2020-05-28
US11127466B2 true US11127466B2 (en) 2021-09-21

Family

ID=70770937

Family Applications (1)

Application Number Title Priority Date Filing Date
US16/503,641 Active US11127466B2 (en) 2018-11-26 2019-07-05 Read data sorting method and storage device for sequentially transmitting read data of continuous logic block addresses to host

Country Status (2)

Country Link
US (1) US11127466B2 (en)
TW (1) TW202020664A (en)

Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080056017A1 (en) * 2006-09-01 2008-03-06 Canon Kabushiki Kaisha Data output apparatus, memory system, data output method, and data processing method
US20080063078A1 (en) * 2006-07-19 2008-03-13 Satoshi Futenma Apparatus and Method of Information Processing, Program, and Recording Medium
US20110131375A1 (en) * 2009-11-30 2011-06-02 Noeldner David R Command Tag Checking in a Multi-Initiator Media Controller Architecture
US20130166855A1 (en) * 2011-12-22 2013-06-27 Fusion-Io, Inc. Systems, methods, and interfaces for vector input/output operations
US20140237170A1 (en) * 2011-09-13 2014-08-21 Kabushiki Kaisha Toshiba Storage device, and read command executing method
US8856438B1 (en) * 2011-12-09 2014-10-07 Western Digital Technologies, Inc. Disk drive with reduced-size translation table
US20150019797A1 (en) * 2013-07-14 2015-01-15 CNEXLABS, Inc. Method and Apparatus for Providing Improved Garbage Collection Process In Solid State Drive
US20160291868A1 (en) * 2015-03-31 2016-10-06 Kabushiki Kaisha Toshiba Out of order sgl read sorting in a mixed system with prp read or system that supports only sgl reads
US20160357483A1 (en) * 2014-06-05 2016-12-08 Kabushiki Kaisha Toshiba Memory system for controlling reading from non-volatile memory
US10339045B2 (en) * 2017-11-16 2019-07-02 Shenzhen Epostar Electronics Limited Co. Valid data management method and storage controller
US20200050370A1 (en) * 2016-12-30 2020-02-13 SK Hynix Inc. Controller and operation method thereof

Patent Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080063078A1 (en) * 2006-07-19 2008-03-13 Satoshi Futenma Apparatus and Method of Information Processing, Program, and Recording Medium
US20080056017A1 (en) * 2006-09-01 2008-03-06 Canon Kabushiki Kaisha Data output apparatus, memory system, data output method, and data processing method
US20110131375A1 (en) * 2009-11-30 2011-06-02 Noeldner David R Command Tag Checking in a Multi-Initiator Media Controller Architecture
US20140237170A1 (en) * 2011-09-13 2014-08-21 Kabushiki Kaisha Toshiba Storage device, and read command executing method
US8856438B1 (en) * 2011-12-09 2014-10-07 Western Digital Technologies, Inc. Disk drive with reduced-size translation table
US20130166855A1 (en) * 2011-12-22 2013-06-27 Fusion-Io, Inc. Systems, methods, and interfaces for vector input/output operations
US20150019797A1 (en) * 2013-07-14 2015-01-15 CNEXLABS, Inc. Method and Apparatus for Providing Improved Garbage Collection Process In Solid State Drive
US20160357483A1 (en) * 2014-06-05 2016-12-08 Kabushiki Kaisha Toshiba Memory system for controlling reading from non-volatile memory
US20160291868A1 (en) * 2015-03-31 2016-10-06 Kabushiki Kaisha Toshiba Out of order sgl read sorting in a mixed system with prp read or system that supports only sgl reads
US20200050370A1 (en) * 2016-12-30 2020-02-13 SK Hynix Inc. Controller and operation method thereof
US10339045B2 (en) * 2017-11-16 2019-07-02 Shenzhen Epostar Electronics Limited Co. Valid data management method and storage controller

Also Published As

Publication number Publication date
US20200168281A1 (en) 2020-05-28
TW202020664A (en) 2020-06-01

Similar Documents

Publication Publication Date Title
US11151027B2 (en) Methods and apparatuses for requesting ready status information from a memory
US11023167B2 (en) Methods and apparatuses for executing a plurality of queued tasks in a memory
US10976939B2 (en) Address/command chip synchronized autonomous data chip address sequencer for a distributed buffer memory system
CN105612518B (en) Method and system for autonomous memory search
US20040093454A1 (en) USB endpoint controller flexible memory management
US20180113635A1 (en) Memory controller utilizing scatter gather list techniques
US20110289243A1 (en) Communication control device, data communication method and program
CN102460405A (en) Method and system for controlling host memory access by memory device
US8521938B2 (en) Universal serial bus host controller and control method thereof
US11199992B2 (en) Automatic host buffer pointer pattern detection
US20130173997A1 (en) Memory controller, memory system, and memory write method
US11455186B2 (en) Controller and memory system having the same
US8417853B2 (en) Universal serial bus host control methods and universal serial bus host controllers
US20160011969A1 (en) Method for accessing data in solid state disk
US8359425B2 (en) Memory control device, memory device, and shutdown control method
US10922022B2 (en) Method and system for managing LBA overlap checking in NVMe based SSDs
US8078771B2 (en) Sending large command descriptor block (CDB) structures in serial attached SCSI (SAS) controller
US6751686B2 (en) Automated transfer of a data unit comprising a plurality of fundamental data units between a host device and a storage medium
US11127466B2 (en) Read data sorting method and storage device for sequentially transmitting read data of continuous logic block addresses to host
CN118151851B (en) Solid state hard disk reading method, device, equipment and readable storage medium
US8667188B2 (en) Communication between a computer and a data storage device
US6745263B2 (en) Automated multiple data unit transfers between a host device and a storage medium
JPH10283302A (en) Method and system for supplying data to bus connected to plural processors
US20250383998A1 (en) Method and device for sequential read command throughput for logical-to-physical look-up
US7421459B2 (en) Buffer management for data transfers between a host device and a storage medium

Legal Events

Date Code Title Description
AS Assignment

Owner name: SHENZHEN EPOSTAR ELECTRONICS LIMITED CO., CHINA

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:CHEN, TSAN-LIN;CHEN, CHIH-JHEN;REEL/FRAME:049674/0074

Effective date: 20190502

FEPP Fee payment procedure

Free format text: ENTITY STATUS SET TO UNDISCOUNTED (ORIGINAL EVENT CODE: BIG.); ENTITY STATUS OF PATENT OWNER: SMALL ENTITY

FEPP Fee payment procedure

Free format text: ENTITY STATUS SET TO SMALL (ORIGINAL EVENT CODE: SMAL); ENTITY STATUS OF PATENT OWNER: SMALL ENTITY

STPP Information on status: patent application and granting procedure in general

Free format text: DOCKETED NEW CASE - READY FOR EXAMINATION

STPP Information on status: patent application and granting procedure in general

Free format text: NON FINAL ACTION MAILED

STPP Information on status: patent application and granting procedure in general

Free format text: RESPONSE TO NON-FINAL OFFICE ACTION ENTERED AND FORWARDED TO EXAMINER

STPP Information on status: patent application and granting procedure in general

Free format text: FINAL REJECTION MAILED

STPP Information on status: patent application and granting procedure in general

Free format text: RESPONSE AFTER FINAL ACTION FORWARDED TO EXAMINER

STPP Information on status: patent application and granting procedure in general

Free format text: NOTICE OF ALLOWANCE MAILED -- APPLICATION RECEIVED IN OFFICE OF PUBLICATIONS

STPP Information on status: patent application and granting procedure in general

Free format text: PUBLICATIONS -- ISSUE FEE PAYMENT VERIFIED

STCF Information on status: patent grant

Free format text: PATENTED CASE

MAFP Maintenance fee payment

Free format text: PAYMENT OF MAINTENANCE FEE, 4TH YR, SMALL ENTITY (ORIGINAL EVENT CODE: M2551); ENTITY STATUS OF PATENT OWNER: SMALL ENTITY

Year of fee payment: 4