![]() ![]() However, the size of the L2P indirection table is dependent on the user-capacity of the solid state drive (for example, about one Mega Byte (MB) per Giga Byte (GB) of user-capacity). ![]() The performance of the write to the L2P table is based on the longest write time, that is, the time to write to the block addressable non-volatile memory or the host memory buffer.The L2P indirection table can be stored in a byte-addressable volatile memory in the solid state drive. On every write (update) to the L2P indirection table in the host memory buffer, the L2P indirection table stored in the block addressable non-volatile memory in the solid state drive is written at the same time (write-through mode). ![]() The byte-addressable volatile memory to store the L2P indirection table can be included in the solid state drive or in a host communicatively coupled to the solid state drive.The L2P indirection table can be stored in a host memory buffer, for example in a portion of system DRAM. The L2P table is stored in byte-addressable volatile memory to speed up the reading of the physical block address from the L2P indirection table to access the physical block in block addressable non-volatile memory (for example, NAND flash memory) in the solid state drive. Accordingly, it is intended that the claimed subject matter be viewed broadly, and be defined as set forth in the accompanying claims.DESCRIPTION OF EMBODIMENTSAn L2P address table (also referred to as an L2P indirection table or L2P table) is stored in a byte-addressable volatile memory (for example, Dynamic Random Access Memory (DRAM) or Synchronous Dynamic Random Access memory (SDRAM)). 6is a block diagram of an embodiment of a computer system that includes a persistent memory in a solid state drive to store a L2P indirection table.Although the following Detailed Description will proceed with reference being made to illustrative embodiments of the claimed subject matter, many alternatives, modifications, and variations thereof will be apparent to those skilled in the art. 5is a flowgraph of operations performed in the solid state drive in response to a TRIM command received from an operating system executing on the host system andFig. 4is a flowgraph of operations performed in the solid state drive in response to a read command received from an operating system executing on the host system Fig. 3is a flowgraph of operations performed in the solid state drive in response to a write command received from an operating system executing on the host system Fig. 2is an example of the solid state drive L2P Indirection Table shown inFig. Typically, the size of the L2P address table is about one Mega Byte (MB) per Giga Byte (GB) of user-capacity in the solid state drive.BRIEF DESCRIPTION OF THE DRAWINGSFeatures of embodiments of the claimed subject matter will become apparent as the following detailed description proceeds, and upon reference to the drawings, in which like numerals depict like parts, and in which:Fig.1is a block diagram of an embodiment of a solid state drive Fig. The size of the L2P address table is dependent on the user-capacity of the solid state drive. The address of the logical block is commonly referred to as a Logical Block Address (LBA).A logical to physical (L2P) address indirection table stores a physical block address in block addressable non-volatile memory in the solid state drive corresponding to each LBA. The storage device may be a solid state Drive (SSD) that includes block addressable non-volatile memory.A logical block is the smallest addressable data unit for read and write commands to access the block addressable non-volatile memory in the solid state Drive. FIELDThis disclosure relates to storage devices and in particular to a Logical to Physical (L2P) address indirection table stored in a persistent memory in a solid state drive.BACKGROUNDA computer system typically includes a volatile system memory, for example, a Dynamic Random Access Memory (DRAM) and a storage device. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |