US 2014/0208003 A1Published application

Variable-size flash translation layer

AssigneeLSI Corporation

InventorEarl T. Cohen

Life of this patent

Estimating the term…

Loading patent…

Abstract

A method for using a variable-size flash transition layer is disclosed. Step (A) receives a read request to read data corresponding to a logical block address from a nonvolatile memory. Step (B) reads a particular entry of a map to obtain (i) a physical address of a particular page of the nonvolatile memory, (ii) an offset in the particular page to compressed data previously stored and (iii) a length of the compressed data. The particular entry is associated with the logical block address. Step (C) converts the offset and the length to (i) an address of a given read unit in the particular page and (ii) a number of the read units to be read. Step (D) reads from the particular page at most the number of the read units starting from the given read unit. An offset and length granularity are finer than one read unit.

Claims20

Dependent claims

A method for using a variable-size flash transition layer, comprising the steps of:

(A) receiving, at an apparatus from a host, a read request to read particular data corresponding to a logical block address from a nonvolatile memory of said apparatus;
(B) reading a particular one of a plurality of entries in a map to obtain (i) a physical address of a particular one of a plurality of pages of said nonvolatile memory, (ii) an offset in said particular page to compressed data previously stored in response to writing said compressed data corresponding to said logical block address and (iii) a length of said compressed data, wherein said particular entry is associated with said logical block address;
(C) converting said offset and said length to (i) an address of a given one of a plurality of read units in said particular page and (ii) a number of said read units to be read from said particular page;
and
(D) reading from said particular page at most said number of said read units starting from said given read unit, wherein a granularity of said offset and said length is finer than a size of one of said read units.

2 more elements

Dependencies are inferred from the claim text.

Facts

Application: 14/055,336Filed 16 Oct 2013
Priority: 22 Jan 2013
Published: 24 Jul 2014
Term ends: Not estimatedThe source records don’t support an estimate.

Classification23 codes

G06F 12/1009
Address translation: using page tables, e.g. page table structures
G06F 3/0619
Improving the reliability of storage systems: in relation to data integrity, e.g. data losses, bit errors
G06F 3/064
Organizing or formatting or addressing of data: management of blocks
G06F 3/0659
Vertical data movement, i.e. input-output transfer; data movement between one or more hosts and one or more storage devices: command handling…

Family

Application61/755,169Us provisional application · filed 22 Jan 2013
Application61/866,672Us provisional application · filed 16 Aug 2013
Application61/888,681Us provisional application · filed 9 Oct 2013
US 9,495,288 B2Related patent
US 2014/0208003 A1This patent

From the US filing history. Foreign family members aren’t listed.

Timeline

Citations

Open elsewhere

Building an agent or pulling many patents? Use the API or MCP server instead of scraping pages. Get an API key