Data storage device supporting accelerated database operations

Information

  • Patent Grant
  • 9330143
  • Patent Number
    9,330,143
  • Date Filed
    Wednesday, December 18, 2013
    10 years ago
  • Date Issued
    Tuesday, May 3, 2016
    8 years ago
Abstract
Disclosed herein are data storage device embodiments for accelerating database operations and associated methods. In one embodiment, the data storage device includes a controller; an array of one or more solid-state memory storage devices; a first memory for storing processor executable instructions associated with database operations; and a second memory for storing data related to the database operations; wherein the controller is configured to execute the instructions to: cause data to be read from the solid-state memory storage devices into the second memory; determine whether the data match a query specified by the instructions; and perform a database operation based on the query match determination.
Description
BACKGROUND

1. Technical Field


This disclosure relates to non-volatile data storage devices and methods for accelerating data operations in such devices.


2. Description of the Related Art


Database operations are often performed in an environment where speed of execution is of great importance. Common operations such as returning query results and indexing are often I/O-intensive and consume much data bandwidth between a host system (e.g., computing device) and a data storage device at which such operations are executed.





BRIEF DESCRIPTION OF THE DRAWINGS

Systems and methods that embody the various features of the various embodiments of the invention will now be described with reference to the following drawings, in which:



FIG. 1A illustrates an example data storage device according to one embodiment of the invention.



FIG. 1B illustrates an example database operation acceleration method according to one embodiment of the invention.



FIG. 2 shows the internal data layout of the data storage device according to one embodiment.



FIGS. 3A and 3B are block diagrams showing example layouts of database elements according to one embodiment.



FIGS. 4A and 4B are flow diagrams showing how a filtered read operation may be executed according to one embodiment.



FIG. 5 is a flow diagram showing how an indexing operation may be executed according to one embodiment.





DETAILED DESCRIPTION

Some embodiments of this disclosure are directed to a data storage device (e.g., solid-state drive (SSD)) that is configured to accelerate database operations. In an embodiment, the data storage device supports a variable sized logical page whose size can be customized to match the individual data units (e.g., tuples) within a database data structure. As a result, certain database operations can be accelerated as certain data may be skipped by logical address range(s) to reduce the number of data read out of the storage media and transferred to the host, which results in more efficient database operations.


While certain embodiments of the disclosure are described, these embodiments are presented by way of example only, and are not intended to limit the scope of the disclosure. Indeed, the novel methods and systems described herein may be embodied in a variety of other forms. Furthermore, various omissions, substitutions and changes in the form of the methods and systems described herein may be made without departing from the spirit of the disclosure.


Data Storage System Overview



FIG. 1A illustrates an example data storage device 120 according to one embodiment of the invention. As is shown, a data storage device 120 (e.g., solid state drive, hybrid drive, etc.) includes a controller 130 and a non-volatile solid-state memory 140, which comprises one or more units of storage, such as blocks of storage. FIG. 1A illustrates an example where the blocks are identified as block “A” 142 through block “N.” While a single non-volatile solid-state memory 140 is illustrated for convenience, the storage device may include multiple of such memories. Each block of the non-volatile solid-state memory 140 comprises a plurality of flash pages (F-pages). For example, block A 142 of FIG. 1A includes a plurality of F-pages, identified as F-pages A 143, B, through N. In some embodiments, each “F-page” is a smallest grouping of memory cells in the non-volatile solid-state memory 140 that can be programmed in a single operation or as a unit. In lieu of or in addition to the non-volatile solid-state memory 140, a magnetic rotating media and/or other non-volatile memory such as MRAM and/or phase change memory may be used.


The controller 130 can receive data and/or storage access commands from a storage interface 112 (e.g., a device driver) in a host system 110. Storage access commands communicated by the storage interface 112 can include write and read commands issued by the host system 110. The commands can specify a logical block address in the data storage device 120, and the controller 130 can execute the received commands in the non-volatile solid-state memory 140. In a hybrid hard drive, data may be stored in magnetic media storage component (not shown in FIG. 1A) in addition to the non-volatile solid-state memory 140.


The data storage device 120 can store data received from the host system 110 so that the data storage device 120 can act as memory storage for the host system 110. To facilitate this function, the controller 130 can implement a logical interface. The logical interface can present to the host system 110 the storage device's memory as a set of logical addresses (e.g., contiguous address) where data can be stored. Internally, the controller 130 can map logical addresses to various physical memory addresses in the non-volatile solid-state memory 140 and/or other memory module(s).


In one embodiment, the controller 130 includes storage device hardware and firmware 148 and a memory for database operation code/firmware 150. The storage device hardware and firmware 148 is/are used to control data operations within the data storage device. In one embodiment, the database operation code/firmware in memory 150 is configurable by the host, and can be executed in its own dedicated processor (not shown in FIG. 1A). Those queries are executed against data stored in the non-volatile solid-state memory 140. Data related to the queries are temporarily stored in a query processing buffer 160 and results are returned to the host system 110 via a host response buffer 162. Additional details related to how the components interact are provided below. It is noted that these components may be arranged differently in various embodiments. They may be omitted, combined, or separated into further sub-components. Also, components 148, 150, 160, and 162 may be integrated into a single processor package or implemented as various discrete components in communication with one another.



FIG. 1B illustrates an example database operation acceleration method according to one embodiment. In one embodiment, the controller 130 is configured to perform the flow shown in FIG. 1B. At block 168, the controller is configured to load instructions/code into the memory 150. The instructions/code may be from a host system. At block 170, the controller is configured to execute instructions in the memory 150. In one embodiment, a dedicated processor may be used to handle the executions to provide further acceleration. At block 172, the controller is configured to cause data to be read from the solid-state memory 140 into the query processing buffer 160. At block 174, the controller is configured to determine whether the data match a database query specified by the instructions. At block 176, the controller is configured to perform a database operation based on the query match determination. In one embodiment, one or more actions in blocks 172-176 may be triggered as a result of executing the instructions. As will be explained further below, the database operation performed may include, for example, one or more of: (1) returning data matching the query to the host system 110; (2) adding an indication to an index when the data matches the query; (3) modifying the data matching the query and writing the modified data back to the solid-state memory.


Acceleration of Database Operations



FIG. 2 shows the internal data layout of the data storage device according to one embodiment. As shown, logical pages (L-Pages) 212 of variable size are stored across various error correction pages (E-Page 210), which are themselves physical sub-division of physical flash pages F-Pages 208. In some embodiments, there is one E-Page per F-Page, i.e., the F-Pages are not sub-divided. The L-Pages may cross the underlying physical boundaries of the E-Pages, F-Pages, as well as the boundaries of the dies/blocks/units within the non-volatile solid-state memory 140 (as shown by boundary 217). For example, as shown, L-Pages may be distributed across multiple E-Pages. In an example implementation, an E-Page 210 may have a data portion 214 protected by an ECC portion 216. In some implementations, compression may be used to further change the size of the L-Page as written to the non-volatile solid-state memory.


In one embodiment, the size of the logical page is configured to be equal to the size of a tuple of the database, or an integer multiple of it. Due to this flexibility in the logical page size, a database administrator, when designing/configuring the database, can create a matching correlation between the stored data and the access index. For example, as shown in FIG. 3A, if one tuple takes 2 logical pages, in order to read tuple 7, read logical block addresses (LBAs) 14 and 15 would be read. Having the data indexed based on logical address provides many advantages, including eliminating the overhead of partitioning by the host system's operating system (OS) and allowing the use of all available storage.


In addition, the logical page and database data alignment may allow for selective skipping of certain logical page ranges in query operations (for example, during the execution of the action in the block 172 in FIG. 1B). For example, in FIG. 3B, the data record is set up so that the logical page boundaries are aligned with individual fields of a database record. For example, if a user is interested in accessing just the name and address fields, targeted reads can be executed to read L-Page 0 and L-Page 1. It can be appreciated that the example shown in FIG. 3B shows one record and that the same principle can be extended to the case when reading many different records. Following this example further, because of the field and logical address alignment, the index to certain fields can be accessed by a modulo operation on the logical address. By allowing the skipping of certain logical address(es) in the preconfigured logical page arrangement, the database performance can be substantially improved over conventional approaches in which all data is read and then matching results are filtered and provided. In addition, the logical page address can be accessed based on formula and/or condition. For example, different database users may have different access privileges. One user may only have access to the name, address, and phone fields. So for that user, a logic may be formulated such that his query would be blocked from accessing L-Page 3, N+3, 2N+3, etc., as well as L-Page 4, N+4, 2N+4, etc. where N is the number of fields in the record. Another user who has a higher access privilege may access additional fields such as social security number and account number, and a formula based on different logic can be used to allow that access. The different queries as a result of the different access privileges are efficiently handled when the fields are aligned with the logical page boundaries, allowing the data storage device to perform the filtering that is common to many database operations at the storage device's logical address level.


In one embodiment, the data storage device includes a dedicated buffer for query processing, e.g., the query processing buffer 160 shown in FIG. 1, or “QPB.” In one embodiment, the QPB is a part of a data path and is capable to hold one logical page.


In addition, in one embodiment, the data storage device includes a buffer to hold a response to the host query, e.g., the host response buffer 162 shown in FIG. 1, or “HRB.” The size of the buffer in one embodiment is an integer multiple of the logical page size but can be different depending on the configuration.


In addition, in one embodiment, the data storage device includes a dedicated processor to execute host-provided code (xenocode, or XC). In one embodiment, xenocode shall have as minimum read access to the query processing buffer 160 and read/write access to the host response buffer 162. In one embodiment, the data storage device includes a code memory for the xenocode (XC memory or XCM), as shown in element 150 of FIG. 1. The size of XCM may be sized to be large enough to execute queries. In addition, in one embodiment, the data storage device has a set of control registers (XCR) allowing the storage device's hardware and firmware (e.g., 148 in FIG. 1) to communicate with the xenocode and providing hardware mechanisms to reset and un-reset the xenocode. In one embodiment, a “watchdog” function is provided such that the execution of the xenocode is monitored for hung or timed-out condition so that the device's hardware/firmware can reset the execution of the xenocode and prevent the entire storage device from hanging and timing out.


In one embodiment, the data storage device is configured to provide to the host information about XC type, size of the XCM and HRB, XCR configuration, and execution timing. This information can be provided electronically or in the product documentation.


Query Execution Flows


In one embodiment, the data storage device may be filled with relational database tuples in accordance with the description above. FIGS. 4A and 4B shows how a filtered read may be executed. FIG. 4A shows some of the initialization that takes place in anticipation of the query execution. In block 400, the host system requests configuration information from the data storage device. The information may be related to various settings including xenocode set up information. In block 402, the data storage device responds with the requested configuration information, including details such as XC type, XCM size, QPB and HRB mapping, execution time, etc. In block 404, the host system sends a command (e.g., a vendor specific command (VSC)) to load the xenocode for execution. The xenocode could have been previously sent by the host system for storage in the XCM or the solid-state memory of the data storage device. This allows for maximum flexibility by the host to configure/alter the xenocode as needed, while offering the benefits of optimized query execution that is localized with the data storage. In one embodiment, hardware may be used to further speed up these operations. In block 406, the data storage device receives the command, starts preparation for the execution of the xenocode, and confirms readiness to the host system. The preparation work may include filling up the XCM with a given image, clearing up the HRB etc. In block 408, the host system sends a command (e.g., VSC) to start the operation (e.g., in this case, XC-filtered read with a set of logical pages).



FIG. 4B shows a part of the flow of the filtered read operation. FIG. 4B shows the actions performed for every logical page in the set. In block 420, the data storage device reads the next logical page into the query processing buffer. In block 422, the data storage device releases the reset of the xenocode. The reset is related to the watchdog monitor to ensure that the code executes properly and does not result in a hung condition. Then in block 424, the code in the xenocode memory is executed. If the query result is successful, the xenocode writes an indication to the xenocode register (e.g., XCR.Good=1), in block 426. In one embodiment, when xenocode execution is completed, it writes a completion indication in the xenocode register (e.g., XCR.Done=1). This causes the data storage device to send the logical page to the host system (e.g., via the host response buffer) and reset xenocode (block 428). In one embodiment, if the xenocode takes too long to execute, the watchdog resets the xenocode. The logical page is considered to not match the query. As a result of the execution in FIGS. 4A and 4B, the data storage device may internally read all the database tuples, but only matching records are transferred to the host. This localized processing reduces the amount of data transfer and thus increases data throughput. The processing can further be coupled and/or supplemented with the storage device's hardware acceleration to deliver even better improvement. In one implementation, this filtered read operation may be performed in addition to the filtered reads based on logical addresses as previously described.


In one embodiment, an indexing operation may take place as follows. Much like FIG. 4A, the host system and the data storage device may perform some initialization operations. Once the initialization is completed, in one embodiment the host system sends a command (e.g., VSC) to create xenocode-assisted subset of logical pages with a set of logical pages. The process flows for each logical page in the set is shown in FIG. 5. The data storage device reads the next logical page to the query processing buffer in block 500. In block 502, the data storage device releases the reset of the xenocode. Then in block 504, the code in the xenocode memory is executed. If the query result is successful, the xenocode writes to the host response buffer the logical page number (e.g., XCR.Page), in block 506. In one embodiment, when xenocode execution is completed, it writes a completion indication in the xenocode register (e.g., XCR.Done=1). This causes the data storage device to reset xenocode (block 508). The logical page may also optionally be sent to the host system. In one embodiment, if the xenocode takes too long to execute, the watchdog resets the xenocode. In such case, the logical page is considered to not match the query. After the set is completed, the data storage device sends to the host system the content of the HRB, giving the host system the results of the index operation. In one embodiment, instead of, or in addition to, returning set of the matching pages, the xenocode may provide more sophisticated operations, such as calculating average values, or doing other statistical analysis.


In one embodiment, the data storage device may provide configurable watchdog timing to better match xenocode execution with expected traffic.


In one embodiment, the data storage device can go beyond read-only access to the data content. For example, the xenocode can provide read-modify-write operations if necessary. The data storage device may implement this functionality by supporting write access to the query processing buffer by the xenocode, and providing the ability to write the modified logical page back to the solid-state memory. The xenocode, for example, may be configured to read out a page matching certain value, perform some operation, and write the modified page back to the solid-state memory. This can be done without data transfer between the host system and the data storage device and without requiring the host system's processing power to perform such operations.


Other Variations


Those skilled in the art will appreciate that in some embodiments, other approaches and methods can be used. For example, the non-volatile solid-state memory array can be implemented using NAND flash memory devices. Other types of solid-state memory devices can alternatively be used, such as array of flash integrated circuits, Chalcogenide RAM (C-RAM), Phase Change Memory (PC-RAM or PRAM), Programmable Metallization Cell RAM (PMC-RAM or PMCm), Ovonic Unified Memory (OUM), Resistance RAM (RRAM), NOR memory, EEPROM, Ferroelectric Memory (FeRAM), Magnetoresistive RAM (MRAM), other discrete NVM (non-volatile solid-state memory) chips, or any combination thereof. In one embodiment, the non-volatile solid-state memory array preferably includes multi-level cell (MLC) devices having multi-level cells capable of storing more than a single bit of information, although single-level cell (SLC) memory devices or a combination of SLC and MLC devices may be used. In one embodiment, the data storage device 120 can include other memory modules, such as one or more magnetic memory modules. In addition, the systems and methods of this disclosure may also be useful in more conventional hard drives and hybrid drives including both solid-state and hard drive components. For example, certain hard disk drive employing magnetic recording technology may employ the data addressing and processing schemes described above.


While certain embodiments of the disclosure have been described, these embodiments have been presented by way of example only, and are not intended to limit the scope of the disclosure. Indeed, the novel methods and systems described herein may be embodied in a variety of other forms. Furthermore, various omissions, substitutions and changes in the form of the methods and systems described herein may be made without departing from the spirit of the disclosure. The accompanying claims and their equivalents are intended to cover such forms or modifications as would fall within the scope and spirit of the disclosure. For example, the various components described may be implemented as software and/or firmware on a processor, ASIC/FPGA, or dedicated hardware. For example, those skilled in the art will appreciate that in some embodiments, the actual steps taken in the processes of some embodiments may differ from those shown in the figures. Depending on the embodiment, certain of the steps described in the example above may be removed, others may be added, and the sequence of steps may be altered and/or performed in parallel. Also, the features and attributes of the specific embodiments disclosed above may be combined in different ways to form additional embodiments, all of which fall within the scope of the present disclosure. Although the present disclosure provides certain preferred 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
  • 1. A non-volatile data storage device, comprising: a controller;an array of one or more solid-state memory storage devices;wherein the array of one or more solid-state memory storage devices is configured to:store a plurality of logical pages, the size of the logical pages configured to correspond to a size of a tuple of a database; andstore data that is indexable based on a plurality of logical addresses corresponding to the plurality of logical pages;a first memory for storing processor executable instructions associated with database operation; anda second memory for storing data related to the database operations;wherein the controller is configured to execute the instructions, the instructions causing the controller to:cause data to be read from the solid-state memory storage devices into the second memory;determine whether the data match a query specified by the instructions; andperform a database operation based on the query match determination.
  • 2. The non-volatile data storage device of claim 1 wherein the database operation performed includes returning data matching the query to a host system coupled to the data storage device.
  • 3. The non-volatile data storage device of claim 1 wherein the database operation performed includes adding an indication to an index when the data matches the query.
  • 4. The non-volatile data storage device of claim 1 wherein the database operation performed includes modifying the data matching the query and writing the modified data back to the solid-state memory storage devices.
  • 5. The non-volatile data storage device of claim 1, wherein the first memory is configured to store database operations that are configurable by a host system coupled to the data storage device.
  • 6. The non-volatile data storage device of claim 1, wherein the controller is further configured to perform a query-related database operation by selectively skipping reading of the logical pages.
  • 7. The non-volatile data storage device of claim 6, wherein the selectively skipping is based on logic associated with user data access privilege.
  • 8. The non-volatile data storage device of claim 6, wherein the selectively skipping is based on logic associated with a query.
  • 9. The non-volatile data storage device of claim 6, wherein the selectively skipping is performed by a modulo operation on a logical address associated with one or more of the logical pages.
  • 10. The non-volatile data storage device of claim 1, wherein the controller is further configured to initiate a watchdog timer upon execution of the instructions to prevent a hung condition.
  • 11. The non-volatile data storage device of claim 1, wherein the controller is further configured to perform one or more logic operations on the data in the second memory.
  • 12. The non-volatile data storage device of claim 11, wherein the logic operations include an aggregation operation and a summing operation.
  • 13. The non-volatile data storage device of claim 1, wherein the controller comprises a processor dedicated to execute the instructions.
  • 14. The non-volatile data storage device of claim 1, wherein the instructions are received from a host system coupled to the data storage device.
  • 15. A method of performing data operation in a non-volatile data storage device comprising an array of one or more solid-state memory storage devices, a first memory, and a second memory, the method comprising: storing a plurality of logical pages in one or more solid-state memory storage devices, the size of the logical pages configured to correspond to a size of a tuple of a database;storing data pages in one or more solid-state memory storage devices, wherein the data is indexable based on a plurality of logical addresses corresponding to the plurality of logical pages;reading data from the solid-state memory storage devices of the non-volatile data storage device into the second memory;determining whether the data match a query specified; andperforming a database operation based on the query match determination, wherein:the first memory is configured to store processor executable instructions associated with database operations and the query is specified by the instructions; andthe second memory is configured to store data related to the database operations.
  • 16. The method of claim 15 wherein the database operation performed includes returning data matching the query to a host system coupled to the data storage device.
  • 17. The method of claim 15 wherein the database operation performed includes adding an indication to an index when the data matches the query.
  • 18. The method of claim 15 wherein the database operation performed includes modifying the data matching the query and writing the modified data back to the solid-state memory storage devices.
  • 19. The method of claim 15, wherein the first memory is configured to store database operations that are configurable by a host system coupled to the data storage device.
  • 20. The method of claim 15, further comprising: performing a query-related database operation by selectively skipping reading of the logical pages.
  • 21. The method of claim 20, wherein the selectively skipping is based on logic associated with user data access privilege.
  • 22. The method of claim 20, wherein the selectively skipping is based on logic associated with a query.
  • 23. The method of claim 20, wherein the selectively skipping is performed by a modulo operation on a logical address associated with one or more of the logical pages.
  • 24. The method of claim 15, further comprising: initiating a watchdog timer upon execution of the instructions to prevent a hung condition.
  • 25. The method of claim 15, further comprising: performing one or more logic operations on the data in the second memory.
  • 26. The method of claim 25, wherein the logic operations include an aggregation operation and a summing operation.
  • 27. The method of claim 15, wherein the instructions are executed in a dedicated processor.
  • 28. The method of claim 15, wherein the instructions are received from a host system coupled to the data storage device.
CROSS-REFERENCE TO RELATED APPLICATION(S)

This application claims the benefit of U.S. provisional application No. 61/895,263, filed Oct. 24, 2013, entitled “Data Storage Device Supporting Accelerated Database Operations,” the disclosure of which is hereby incorporated in its entirety.

US Referenced Citations (115)
Number Name Date Kind
6401185 Sexton Jun 2002 B1
6446062 Levine Sep 2002 B1
6549977 Horst et al. Apr 2003 B1
6856556 Hajeck Feb 2005 B1
7055015 Shiota May 2006 B2
7126857 Hajeck Oct 2006 B2
7424478 Licon Sep 2008 B2
7430136 Merry, Jr. et al. Sep 2008 B2
7447807 Merry et al. Nov 2008 B1
7502256 Merry, Jr. et al. Mar 2009 B2
7509441 Merry et al. Mar 2009 B1
7596643 Merry, Jr. et al. Sep 2009 B2
7653778 Merry, Jr. et al. Jan 2010 B2
7685337 Merry, Jr. et al. Mar 2010 B2
7685338 Merry, Jr. et al. Mar 2010 B2
7685374 Diggs et al. Mar 2010 B2
7733712 Walston et al. Jun 2010 B1
7765373 Merry et al. Jul 2010 B1
7898855 Merry, Jr. et al. Mar 2011 B2
7912991 Merry et al. Mar 2011 B1
7936603 Merry, Jr. et al. May 2011 B2
7962792 Diggs et al. Jun 2011 B2
8078918 Diggs et al. Dec 2011 B2
8090899 Syu Jan 2012 B1
8095851 Diggs et al. Jan 2012 B2
8108692 Merry et al. Jan 2012 B1
8122185 Merry, Jr. et al. Feb 2012 B2
8127048 Merry et al. Feb 2012 B1
8135903 Kan Mar 2012 B1
8151020 Merry, Jr. et al. Apr 2012 B2
8161227 Diggs et al. Apr 2012 B1
8166245 Diggs et al. Apr 2012 B2
8243525 Kan Aug 2012 B1
8254172 Kan Aug 2012 B1
8261012 Kan Sep 2012 B2
8296625 Diggs et al. Oct 2012 B2
8312207 Merry, Jr. et al. Nov 2012 B2
8316176 Phan et al. Nov 2012 B1
8341339 Boyle et al. Dec 2012 B1
8375151 Kan Feb 2013 B1
8392635 Booth et al. Mar 2013 B2
8397107 Syu et al. Mar 2013 B1
8407449 Colon et al. Mar 2013 B1
8423722 Deforest et al. Apr 2013 B1
8433858 Diggs et al. Apr 2013 B1
8443167 Fallone et al. May 2013 B1
8447920 Syu May 2013 B1
8458435 Rainey, III et al. Jun 2013 B1
8478930 Syu Jul 2013 B1
8489854 Colon et al. Jul 2013 B1
8503237 Horn Aug 2013 B1
8521972 Boyle et al. Aug 2013 B1
8549236 Diggs et al. Oct 2013 B2
8583835 Kan Nov 2013 B1
8601311 Horn Dec 2013 B2
8601313 Horn Dec 2013 B1
8612669 Syu et al. Dec 2013 B1
8612804 Kang et al. Dec 2013 B1
8615681 Horn Dec 2013 B2
8638602 Horn Jan 2014 B1
8639872 Boyle et al. Jan 2014 B1
8683113 Abasto et al. Mar 2014 B2
8700834 Horn et al. Apr 2014 B2
8700950 Syu Apr 2014 B1
8700951 Call et al. Apr 2014 B1
8706985 Boyle et al. Apr 2014 B1
8707104 Jean Apr 2014 B1
8713066 Lo et al. Apr 2014 B1
8713357 Jean et al. Apr 2014 B1
8719531 Strange et al. May 2014 B2
8724422 Agness et al. May 2014 B1
8725931 Kang May 2014 B1
8745277 Kan Jun 2014 B2
8751728 Syu et al. Jun 2014 B1
8769190 Syu et al. Jul 2014 B1
8769232 Suryabudi et al. Jul 2014 B2
8775720 Meyer et al. Jul 2014 B1
8782327 Kang et al. Jul 2014 B1
8788778 Boyle Jul 2014 B1
8788779 Horn Jul 2014 B1
8788880 Gosla et al. Jul 2014 B1
8793429 Call et al. Jul 2014 B1
20020116457 Eshleman et al. Aug 2002 A1
20020178328 Honda et al. Nov 2002 A1
20040225831 Pail Nov 2004 A1
20060143238 Tamatsu Jun 2006 A1
20070204128 Lee Aug 2007 A1
20080071785 Kabra Mar 2008 A1
20080140918 Sutardja Jun 2008 A1
20090138654 Sutardja May 2009 A1
20090288101 Gandin Nov 2009 A1
20100174849 Walston et al. Jul 2010 A1
20100250793 Syu Sep 2010 A1
20110099323 Syu Apr 2011 A1
20110283049 Kang et al. Nov 2011 A1
20110296440 Laurich et al. Dec 2011 A1
20120179869 Flynn Jul 2012 A1
20120221534 Gao et al. Aug 2012 A1
20120260020 Suryabudi et al. Oct 2012 A1
20120278531 Horn Nov 2012 A1
20120284460 Guda Nov 2012 A1
20120324191 Strange et al. Dec 2012 A1
20130132638 Horn et al. May 2013 A1
20130145106 Kan Jun 2013 A1
20130290793 Booth et al. Oct 2013 A1
20140059405 Syu et al. Feb 2014 A1
20140101369 Tomlin et al. Apr 2014 A1
20140115427 Lu Apr 2014 A1
20140133220 Danilak et al. May 2014 A1
20140136753 Tomlin et al. May 2014 A1
20140149826 Lu et al. May 2014 A1
20140157078 Danilak et al. Jun 2014 A1
20140181432 Horn Jun 2014 A1
20140215129 Kuzmin Jul 2014 A1
20140223255 Lu et al. Aug 2014 A1
Non-Patent Literature Citations (2)
Entry
International Search Report and Written Opinion dated Jan. 27, 2015 from related PCT Serial No. PCT/US2014/062066, 9 pages.
Sungchan Kim, et al., “Fast, Energy Efficient Scan inside Flash Memory SSDs,” The Second International Workshop on Accelerating Data Management Systems using Modern Processor and Storage Architecture (ADMS' 11), 2011, pp. 1-8.
Related Publications (1)
Number Date Country
20150120770 A1 Apr 2015 US
Provisional Applications (1)
Number Date Country
61895263 Oct 2013 US