Systems for managing access to solid-state memory often perform complicated tasks such as maintaining drive coherency and mapping logical to physical addresses. In addition to receiving and processing memory access requests from host systems, these management systems often also process memory access requests related to internal maintenance operations such as garbage collection and wear leveling. The management systems may also be configured to respond to changing conditions in the physical memory media, including handling return status of memory commands executed in the media.
Systems and methods which embody the various features of the invention will now be described with reference to the following drawings, in which:
While certain embodiments of the inventions will be described, these embodiments are presented by way of example only, and are not intended to limit the scope of the inventions. 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 inventions. The accompanying claims and their equivalents are intended to cover such forms or modifications as would fall within the scope and spirit of the inventions.
Overview
Embodiments of the invention described herein are directed to pipelined or multi-staged systems and methods for controlling and managing access to physical memory media in solid-state storage subsystems. In an embodiment, the system separates media access request management tasks such as address translation, preparation for execution at the physical memory media, and completion status reporting into discrete stages and processing components to improve performance. In an embodiment, the components in the various stages of processing media access requests cooperate with one another by using a common data structure termed a media access request object to share information on a pending request that is being processed and report any result data and/or completion status information to an entity that originated the media access request. In an embodiment, the components in the various stages of processing media access requests are executed on different processors and/or processor threads. In an embodiment, the system manages the execution timing of requests on memory units (e.g., dies) of a solid-state storage subsystem to improve concurrent use of the memory units.
An overview of a solid state storage subsystem 120 implementing a multi-stage media access control system embodiment is presented in
As shown in this embodiment, the plurality of media requesters 101 send media access requests to a media access request manager 102 in the storage subsystem 120. In an embodiment, the media access request manager 102 performs any necessary processing including address translation and ensures the media requests can be executed on the memory arrays 105. The address translation performed by the media access request manager 102 can include translation from a logical to a physical address. In an embodiment, once translation is complete, the media access request manager 102 then sends the media access requests to a media access request executor 103 in the storage subsystem 120. The media access request executor 103 is in communication with a media controller 104, and in an embodiment the media access request executor 103 determines when to send media requests to the media controller 104 for execution in the memory arrays 105. In an embodiment, since the media access requests are embedded in media access request objects, the media access request executor, as part of the sending process, may also perform any required translation of data within the media access request objects to data in a format that is understandable by the media controller 104. The media controller 104 performs media requests on the memory arrays 105 and returns a status and/or an error message to the media access request executor 103. In an embodiment, the media access request executor 103 in turn returns the status/error message of media access requests to the plurality of media access requesters 101.
Storage Subsystem Overview with Media Request Objects and Pointers
In an embodiment, the shared pointer memory 202 includes a memory structure 202b with memory allocated to memory access request objects. The shared pointer memory 202 can also include a plurality of pointers to the memory access request objects. In an embodiment, each media access requester is associated with a dedicated pool of memory and may maintain its own free pointer pool.
As described below, in an embodiment, each component may access and update information in a memory access request object located in shared pointer memory 202. Each component's access is denoted by dotted lines in
Returning to the top of
Once the media access request object is populated with request data, the media access requesters 201 can then pass the pointer for the media access request object to the media access request manager 203. The passing of the pointer, rather than the object itself, reduces the memory footprint necessary to implement this shared message architecture and improves system performance. In an embodiment, the media access request manager 203 maintains an invalid page table 205 and a mapping table 204. The mapping table 204 maintains a mapping between logical and physical addresses, while the invalid page table 205 maintains a list of physical addresses that contain invalid data. Typically, addresses (e.g., pages) referenced by the invalid page table can be freed through a garbage collection operation and made ready for further use. In an embodiment, the media access request manager 203 processes the incoming requests and resolves any contention between requests submitted by the plurality of media access requesters 201. For example, if the execution of a request requires an alteration to the mapping table 204 and/or invalid page table 205, the media access request manager 203 may update the tables to reflect the alteration. In certain circumstances, a media request may specify a media operation on data that has been altered since the request was first issued by the originating media access requester. In these circumstances, the media access request manager 203 may alter the request to conform to the alterations, or the media access request manager 203 may reject the request due to the conflict and return the associated media access request pointer to the originating media access requester.
In an embodiment, the media access request manager 203 may also populate the physical address field of the media access request object with a physical address that corresponds to a logical address indicated in the media access request object. For a read operation, determining a physical address that corresponds to a logical address may involve a simple lookup in the mapping table 204. For write operations, the media access request manager 203 may maintain a list of upcoming physical write locations associated with the media access requester that submitted the request. In an embodiment, the upcoming physical write locations may be associated with an open group of blocks, and the media access request manager 203 can choose a write location from the open group of blocks that is currently assigned to the requester. In an embodiment, the media access request manager 203 is configured to assign one or more open groups of blocks to individual requesters 201. In further embodiments, other ways of assigning a write location to a logical address may be implemented in any way understood to one skilled in the art.
In an embodiment, after processing the request as described above, the media access request manager 203 passes the media access request pointer to a media access request executor 206. The media access request executor 206 may be in communication with a media controller 207 to execute commands on memory arrays 208. The media access executor 206 schedules execution of requests on the memory arrays 208. In an embodiment, each memory array 208 has an associated execution queue, which stores commands issued by the media controller 207 in response to requests dispatched by the media access executor 206. In an embodiment, the media access request executor 206 maintains a record of the outstanding commands in each execution queue, and passes requests to the media controller according to the outstanding commands in each execution queue. In some embodiments, the media access request executor 206 passes the media access request pointer to the media controller 207, and the media controller 207 executes a command specified by the referenced media access request object on the memory arrays 208. In other embodiments, the media access request executor 206 translates data within the media access request object into a format executable by the media controller 207 on the memory arrays 208.
After execution of the media request on the memory arrays 208, the memory arrays 208 and/or media controller 207 in an embodiment return result data such as a status (e.g., indicating success or failure) and any other information associated with the execution to the media access request executor 206. For example, associated information for a read operation may include the data read from the memory arrays. In certain embodiments, the media access request executor 206 populates a status field in the media access request object with the returned result data and other returned information. In other embodiments, the media controller 207 populates the media request object data fields with result data.
Once result data is inserted into the media request object, in an embodiment the associated media access request pointer can then be passed from the media access request executor 206 to a request status pool/status reporter 209. In an embodiment, the media access requesters 201 will poll the request status reporter/pool 209 to retrieve any updated status for requests referenced by media access request pointers associated with that requester.
In another embodiment, the request status pool/reporter can push status information to the associated requester(s).
Media Access Request Processing Cycle
Media Access Request Object Structure
As the media access request object is passed among the components of the media request control system within the storage subsystem, various portions of the media access request object are populated. For example, the media access requester may populate fields such as the requester ID data field 406 (indicating the originating requester), the operation data field 408, and the logical chunk number data field 402. For a write request, the media access requester may populate data to be written into buffers 411. In an embodiment, when the media access request object is passed to the media access request manager, the physical chunk number field 404, and the plane field 405 are populated. In an embodiment, if the request cannot be executed, the media access request manager can update the result data field 407. After the execution of the media request in the physical memory media, the media access executor and/or the media controller can update the result data field 408, and for some operations, e.g., a read operation, the buffers 411 with data read from the target physical address.
Media Access Request Manager
A detailed view of an embodiment of the media access request manager is shown in
In an embodiment, the media access request manager 505 receives media access request pointers from the request queues 504a-c. After receiving the media access request pointers, the media access request manager 505 in an embodiment updates the media access request object with reference to a mapping table 506 and an invalid page table 507. In an embodiment, the media access request manager 505 maintains a designated write location for each requester or request queue. In an embodiment, the media access request manager 505 determines a physical address for the write location corresponding to an open block in a group of blocks for each requester or request queue. In an embodiment, after receiving a write command request at the media access request manager 505, the mapping table 506 is updated with the new physical address corresponding to the logical address of the request. The invalid page table 507 is then updated to indicate that the physical address formerly mapped to the logical address is invalid. In an embodiment, the media access request manager 505 also updates an invalid page counter for the block or group of blocks corresponding to the old physical address. In an embodiment, the media access request manager 505 is the only entity with access rights to write to the mapping table 506 and the invalid page table 507. Restricting write accesses to the media access request manager 505 ensures a single point of control for these tables, and prevents possible contentions and data coherency errors that may result if the requesters were granted direct access to the tables.
In an embodiment, when the media access request manager 505 receives media access request pointers from the request queues 504a-c, the media access request manager 505 may determine a ratio at which to process media access request pointers from each queue. While requests from each requester must generally be executed in-order relative to other requests from that requester, requests from each requester may generally be executed in a different order than received relative to requests from another requester. For example, if a read command from the user data manager 502 is directed to the same logical address as a garbage collection command from the garbage collector 503, the media access request manager 505 can ensure that the physical address of each command is updated to appropriately compensate for the order of execution. If the garbage collection command is processed first, the read command can be directed to the new physical address corresponding to the same logical address. If the read command is processed first, the read command is executed prior to any data movement associated with the garbage collection command and revisions to the physical addresses of the data. As such, the media access request manager ensures coherency with the mapping and invalid page tables, thereby preventing downstream request execution conflicts.
In an embodiment, the option of processing requests from the queues in different ratios allows the media access request manager 505 to throttle, or provide dynamic ratios, of requests received from each request queue 504 and thereby prioritize a specific requester over other requesters. For example, the media access request manager 505 can receive and process two or three or more requests from the user data manager 502 for every request from garbage collector 503 (or vice versa). In an embodiment, the media access request manager 505 temporarily halts receiving media access request pointers from a request queue when certain conditions are met. For example, if the invalid page table shows a high need for garbage collection, the requests for user data manager 502 may be throttled down or halted to allow for more garbage collection requests to be processed. Alternatively, if the user data manager 502 has an unusually high number of requests, or if the request queue 504a for the user data manager 502 is nearing a threshold, the requests associated with the garbage collector 503 may be throttled down or halted. After preparing the media access request for execution, the media access request manager 505 passes the media access request pointer to the media access request executor.
Media Access Request Executor
In an embodiment, when the media access request executor 602 has determined that a media access request should be executed, the media access request executor 602 will pass the media access request to media controller 605. As described above, in certain embodiments the media access request executor 602 can pass a media access request pointer to media controller 605, while in other embodiments the media access request executor 602 performs a translation to a format acceptable to the media controller 605. Media controller 605 directs each media access request to an execution queue 606 associated with each memory arrays 607. Each memory array 607 may be accessed via an associated data channel. The execution queue 606 for each memory array 607 may be maintained on the memory arrays 607, or may be maintained as a part of media controller 605. As media access requests are completed on memory arrays 607, the media controller 605 will return a status and any associated information to the media access request executor 602. As necessary, the media access request executor 602 incorporates the status and associated information into the media access request object and passes the media access request pointer to status pool 608. In an embodiment, the media controller 605 populates the status and associated information fields of the media access request object instead of the media access request executor 602. As described above, the media access requesters receive media access request pointers from the status pool 608.
Request Execution Handling
One example method of determining when to execute media access requests is shown in
In various embodiments, each memory unit is capable of having a certain threshold number of outstanding requests at once. As such, the media access request executor cannot send additional requests past this outstanding request threshold. The outstanding request threshold is typically dictated by the depth of the execution queue 606 depicted in
In an embodiment, as the request list is traversed, the current position in the request list will reach a reset point and return to the first skipped request to determine if that request can now be executed. The reset point can be determined in a variety of ways. The current position can return to the first skipped request upon the triggering of a condition. As examples, the condition can be based at least partially on any of: the number of requests that have been skipped (in total or for a particular memory unit), receiving an indication notifying of a request completion from a memory unit that has been skipped, and reaching the end of the request list. In various embodiments, as the request list is continually changing to reflect processed requests and new incoming requests from the media access request manager, periodic snapshots of the request list are taken and the aforementioned condition for reset may also be based on reaching the end of a snapshot of the request list.
In alternate embodiments, other methods for maintaining a list of requests to be executed may be used. For example, at the media access request executor level, the received requests may be placed in individual queues associated with each memory unit. The media access request executor may then send media access requests from the queues to the media controller by checking whether the associated media unit has reached a threshold in the media execution counter. In an embodiment, the media access request executor may check only those queues which have not reached the threshold in the execution counter. In an embodiment, the media access request executor checks the queues associated with each memory unit by a round robin algorithm. A flag can be used to designate which memory units have an execution counter that has reached the threshold. According to another embodiment, the media access request executor reorders the media access requests in the request list at least partly based on the status of the associated memory units. The status of the associated memory units may be determined with reference to the execution counters. Other data management means can be used to control the flow of media requests to the media controller in accordance with this disclosure.
By temporarily skipping certain requests, the media access request executor increases the concurrent use of the memory units (by sending requests to those units before other units have finished requests). Further, by using a reset point, the media access request executor can return to process skipped requests to preserve data coherency.
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.
The present application claims priority from provisional U.S. Patent Application Ser. No. 61/385,143, filed on Sep. 21, 2010, the specification of which is incorporated herein by reference.
Number | Name | Date | Kind |
---|---|---|---|
5093780 | Sunahara | Mar 1992 | A |
5123094 | MacDougall | Jun 1992 | A |
5634099 | Andrews et al. | May 1997 | A |
6064656 | Angal et al. | May 2000 | A |
6088740 | Ghaffari et al. | Jul 2000 | A |
6205521 | Schumann | Mar 2001 | B1 |
6338122 | Baumgartner et al. | Jan 2002 | B1 |
6381682 | Noel et al. | Apr 2002 | B2 |
6393536 | Hughes et al. | May 2002 | B1 |
6430654 | Mehrotra et al. | Aug 2002 | B1 |
6475062 | Kubota et al. | Nov 2002 | B1 |
6574708 | Hayter et al. | Jun 2003 | B2 |
6678801 | Greim et al. | Jan 2004 | B1 |
6757781 | Williams et al. | Jun 2004 | B2 |
6760820 | Henson et al. | Jul 2004 | B2 |
6856556 | Hajeck | Feb 2005 | B1 |
6862151 | Hoskins et al. | Mar 2005 | B2 |
6969989 | Mei | Nov 2005 | B1 |
7082494 | Thelin et al. | Jul 2006 | B1 |
7114041 | Hammitt et al. | Sep 2006 | B2 |
7126857 | Hajeck | Oct 2006 | B2 |
7159084 | Dhanoa | Jan 2007 | B1 |
7174467 | Helms et al. | Feb 2007 | B1 |
7310699 | Sinclair | Dec 2007 | B2 |
7313641 | Koch et al. | Dec 2007 | B2 |
7315917 | Bennett et al. | Jan 2008 | B2 |
7340580 | Kinoshita | Mar 2008 | B2 |
7363396 | Liu et al. | Apr 2008 | B2 |
7363421 | Di Sena et al. | Apr 2008 | B2 |
7366826 | Gorobets et al. | Apr 2008 | B2 |
7406547 | Haines et al. | Jul 2008 | B2 |
7424587 | Caulkins et al. | Sep 2008 | B2 |
7430136 | Merry, Jr. et al. | Sep 2008 | B2 |
7441054 | Wu et al. | Oct 2008 | B2 |
7441067 | Gorobets et al. | Oct 2008 | B2 |
7447807 | Merry et al. | Nov 2008 | B1 |
7457903 | Purdham et al. | Nov 2008 | B2 |
7487286 | Nagano et al. | Feb 2009 | B2 |
7502256 | Merry, Jr. et al. | Mar 2009 | B2 |
7509441 | Merry et al. | Mar 2009 | B1 |
7582868 | Jiang et al. | Sep 2009 | B2 |
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 |
7831783 | Pandit et al. | Nov 2010 | B2 |
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 |
20010034809 | Ogawa | Oct 2001 | A1 |
20020040413 | Okada et al. | Apr 2002 | A1 |
20020083111 | Row et al. | Jun 2002 | A1 |
20040193743 | Byers et al. | Sep 2004 | A1 |
20050193081 | Gruber et al. | Sep 2005 | A1 |
20050204187 | Lee et al. | Sep 2005 | A1 |
20060123169 | Chai et al. | Jun 2006 | A1 |
20060155917 | Di Sena et al. | Jul 2006 | A1 |
20060161724 | Bennett et al. | Jul 2006 | A1 |
20070016721 | Gay | Jan 2007 | A1 |
20070033332 | Sinclair et al. | Feb 2007 | A1 |
20070043900 | Yun | Feb 2007 | A1 |
20070101075 | Jeddeloh | May 2007 | A1 |
20070186032 | Sinclair et al. | Aug 2007 | A1 |
20070186065 | Lee et al. | Aug 2007 | A1 |
20080082736 | Chow et al. | Apr 2008 | A1 |
20080091872 | Bennett et al. | Apr 2008 | A1 |
20080091881 | Brittain et al. | Apr 2008 | A1 |
20080126685 | Danilak | May 2008 | A1 |
20080126719 | Danilak | May 2008 | A1 |
20080126720 | Danilak | May 2008 | A1 |
20080126891 | Danilak | May 2008 | A1 |
20080155166 | James et al. | Jun 2008 | A1 |
20080162817 | Batterywala | Jul 2008 | A1 |
20080235443 | Chow et al. | Sep 2008 | A1 |
20080263305 | Shu et al. | Oct 2008 | A1 |
20080282024 | Biswas et al. | Nov 2008 | A1 |
20080288717 | Torabi | Nov 2008 | A1 |
20080307164 | Sinclair | Dec 2008 | A1 |
20090012976 | Kang et al. | Jan 2009 | A1 |
20090017220 | Muller et al. | Jan 2009 | A1 |
20090070502 | Noha et al. | Mar 2009 | A1 |
20090116475 | Krzyzanowski et al. | May 2009 | A1 |
20090129163 | Danilak | May 2009 | A1 |
20090150599 | Bennett | Jun 2009 | A1 |
20090154026 | Jiang et al. | Jun 2009 | A1 |
20090172250 | Allen et al. | Jul 2009 | A1 |
20090172258 | Olbrich et al. | Jul 2009 | A1 |
20090172260 | Olbrich et al. | Jul 2009 | A1 |
20090271562 | Sinclair | Oct 2009 | A1 |
20090313501 | Hallivuori | Dec 2009 | A1 |
20100023672 | Gorobets et al. | Jan 2010 | A1 |
20100037009 | Yano et al. | Feb 2010 | A1 |
20100174849 | Walston et al. | Jul 2010 | A1 |
20100185806 | Pruthi et al. | Jul 2010 | A1 |
20100250793 | Syu | Sep 2010 | A1 |
20100262760 | Swing et al. | Oct 2010 | A1 |
20100268882 | Cargnoni et al. | Oct 2010 | A1 |
20100313052 | Ueda | Dec 2010 | A1 |
20110022778 | Schibilla et al. | Jan 2011 | A1 |
20110055455 | Post et al. | Mar 2011 | A1 |
20110055458 | Kuehne | Mar 2011 | A1 |
20110099323 | Syu | Apr 2011 | A1 |
20110191566 | Takamiya et al. | Aug 2011 | A1 |
20110231624 | Fukutomi et al. | Sep 2011 | A1 |
20110283049 | Kang | Nov 2011 | A1 |
20120239851 | Calvert et al. | Sep 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 |
20130024595 | Subramaniyan et al. | Jan 2013 | 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 |
20140223255 | Lu et al. | Aug 2014 | A1 |
Entry |
---|
Hu et al., “Write Amplification Analysis in Flash-Based Solid State Drives”, SYSTOR'09, Haifa, 2009, Zurich Research Laboratory,copyright 2009 IBM Corporation, downloaded on May 12, 2010 from https://www.research.ibm.com/haifa/conferences/systor2009/papers/2—2—2.pdf, 13 pages. |
Taratorin, Alexander M. and Klaas B. Klassen, Observation of Recording Pole Instability in Perpendicular Recording, IEEE Transaction on Magnetics, vol. 42, No. 10, Oct. 2006, pp. 2267-2269. |
U.S. Appl. No. 12/777,771, filed May 11, 2010, to Kang et al., 19 pages. |
http://www.anandtech.com, PDF downloaded from website on Jun. 17, 2011. |
Ho-Fan Kang, U.S. Appl. No. 14/303,508, filed Jun. 12, 2014 16 pages. |
Lan D. Phan, U.S. Appl. No. 13/166,985, filed Jun. 23, 2011, 27 pages. |
Ho-Fan Kang, U.S. Appl. No. 12/778,740, filed May 12, 2010 17 pages. |
Number | Date | Country | |
---|---|---|---|
61385143 | Sep 2010 | US |