Method and system for forward reference logging in a persistent datastore

Abstract
The embodiments described herein are methods and systems to enhance the reliability and performance of a persistent datastore (e.g., non-volatile memory such as flash memory). The method includes generating a log entry associated with first write data. The method also includes generating a first record including the log entry, the first write data, and pointer to a second record different from the first record. The method further includes performing a single write operation that includes writing the first record to the persistent datastore.
Description
TECHNICAL FIELD

The disclosed embodiments relate generally to memory systems, and in particular, to improving the reliability and performance of a storage medium (e.g., a persistent datastore including non-volatile memory such as flash memory).


BACKGROUND

Generally, when data is written to a database to be persisted, two writes are initiated to persistent storage, one for the data and a second for the corresponding log entry. The log entry is for recovering the data, or for reproducing the corresponding write operation. Performing two separate write operations introduces more latency than a single write operation, but writing the log entry to persistent storage provides recovery and database replication capabilities not otherwise available. Nevertheless, reducing the added latency associated with writing log entries would be desirable.


SUMMARY

The disclosed method and system improve the reliability and performance of a persistent datastore (e.g., non-volatile memory such as flash memory). A record including write data and a log entry is written to the persistent datastore with a single write operation.





BRIEF DESCRIPTION OF THE DRAWINGS

So that the present disclosure can be understood in greater detail, a more particular description may be had by reference to the features of various embodiments, some of which are illustrated in the appended drawings. The appended drawings, however, merely illustrate the more pertinent features of the present disclosure and are therefore not to be considered limiting, for the description may admit to other effective features.



FIG. 1 is a block diagram illustrating an implementation of a data storage system in accordance with some embodiments.



FIG. 2A is a block diagram illustrating an implementation of a management module in accordance with some embodiments.



FIG. 2B is a block diagram illustrating an implementation of a computer system (e.g., a host) in accordance with some embodiments.



FIG. 3 illustrates block diagrams of a plurality of related data structures in accordance with some embodiments.



FIG. 4 illustrate a flowchart representation of a method of generating the data structures in FIG. 3 in accordance with some embodiments.



FIG. 5 illustrates a block diagram of a log stream in accordance with some embodiments.



FIG. 6 illustrates a block diagram of a portion of a log stream in accordance with some embodiments.



FIG. 7 illustrates block diagrams of related data structures in accordance with some embodiments.



FIGS. 8A-8C illustrate a flowchart representation of a method of persisting data in accordance with some embodiments.





In accordance with common practice the various features illustrated in the drawings may not be drawn to scale. Accordingly, the dimensions of the various features may be arbitrarily expanded or reduced for clarity. In addition, some of the drawings may not depict all of the components of a given system, method or device. Finally, like reference numerals may be used to denote like features throughout the specification and figures.


DETAILED DESCRIPTION

The various embodiments described herein include methods and/or systems that improve the reliability and performance of a persistent datastore (e.g., non-volatile memory (NVM) such as flash memory). Some embodiments include methods and/or systems (or devices) for persisting data efficiently and reliably as part of a persistent datastore.


Some embodiments include a method of persisting data. In some embodiments, the method is performed by an electronic system (e.g., computer system 110, FIG. 1 or storage controller 120, FIG. 1) with one or more processors and memory that is operatively coupled with a persistent datastore. For example, the persistent datastore includes non-volatile memory such as one or more magnetic disk storage devices, optical disk storage devices, flash memory devices, or other non-volatile solid state storage devices. The method includes generating a log entry associated with first write data. The method also includes generating a first record including the log entry, the first write data, and a pointer to a second record different from the first record. The method further includes performing a single write operation that includes writing the first record to the persistent datastore.


Some embodiments include an electronic system (sometimes herein called an electronic device), comprising: one or more processors; and memory storing one or more programs to be executed by the one or more processors, the one or more programs comprising instructions for performing or controlling performance of any of the methods described herein. Some embodiments include a non-transitory computer readable storage medium, storing one or more programs for execution by one or more processors of an electronic system or device, the one or more programs including instructions for performing any of the methods described herein. Some embodiments include an electronic system or device comprising: means for performing the operations of any of the methods described herein.


Numerous details are described herein in order to provide a thorough understanding of the example embodiments illustrated in the accompanying drawings. However, some embodiments may be practiced without many of the specific details, and the scope of the claims is only limited by those features and aspects specifically recited in the claims. Furthermore, well-known methods, components, and circuits have not been described in exhaustive detail so as not to unnecessarily obscure more pertinent aspects of the embodiments described herein.



FIG. 1 is a diagram of an implementation of a data storage system 100 in accordance with some embodiments. While some example features are illustrated, various other features have not been illustrated for the sake of brevity and so as not to obscure more pertinent aspects of the example embodiments disclosed herein. To that end, as a non-limiting example, data storage system 100 includes a storage controller 120, and a storage medium 130, and is used in conjunction with a computer system 110. In some embodiments, storage medium 130 includes a single memory device (e.g., a non-volatile memory (NVM) device such as a flash memory device or a magnetic disk drive, sometimes called a hard drive) while in other implementations storage medium 130 includes a plurality of memory devices. In some embodiments, storage medium 130 includes NAND-type flash memory or NOR-type flash memory. Further, in some embodiments, storage controller 120 is a solid-state drive (SSD) controller. However, one or more other types of storage media may be included in accordance with aspects of a wide variety of embodiments.


Computer system 110 is coupled to storage controller 120 through data connections 101. However, in some embodiments computer system 110 includes storage controller 120 as a component and/or a sub-system. Computer system 110 may be any suitable computer device, such as a computer, a laptop computer, a tablet device, a netbook, an internet kiosk, a personal digital assistant, a mobile phone, a smart phone, a gaming device, a computer server, or any other computing device. Computer system 110 is sometimes called a host or host system. In some embodiments, computer system 110 includes one or more processors, one or more types of memory, a display and/or other user interface components such as a keyboard, a touch screen display, a mouse, a track-pad, a digital camera and/or any number of supplemental devices to add functionality.


Storage medium 130 is coupled to storage controller 120 through connections 103. Connections 103 are sometimes called data connections, but typically convey commands in addition to data, and optionally convey metadata, error correction information and/or other information in addition to data values to be stored in storage medium 130 and data values read from storage medium 130. In some embodiments, however, storage controller 120 and storage medium 130 are included in the same device as components thereof. Furthermore, in some implementations storage controller 120 and storage medium 130 are embedded in a host device, such as a mobile device, tablet, other computer or computer controlled device, and the methods described herein are performed by the embedded storage controller. Storage medium 130 may include any number (i.e., one or more) of memory devices including, without limitation, non-volatile semiconductor memory devices, such as flash memory. For example, flash memory devices can be configured for enterprise storage suitable for applications such as cloud computing, or for caching data stored (or to be stored) in secondary storage, such as hard disk drives. Additionally and/or alternatively, flash memory can also be configured for relatively smaller-scale applications such as personal flash drives or hard-disk replacements for personal, laptop and tablet computers.


In some embodiments, storage medium 130 is a persistent datastore (e.g., comprising non-volatile memory such as flash memory), and storage medium 130 includes a plurality of records 132 each including write data and a corresponding log entry. In some embodiments, each record corresponds to a transaction (e.g., a write operation) against the persistent datastore. In some embodiments, storage medium 130 also includes a log stream 134 comprising a plurality of log stream portions, where each log stream portion includes a log entry collection (e.g., 256 log entries). In some embodiments, storage medium 130 further includes one or more datastore snapshots 136. In some embodiments, each of one or more datastore snapshots 136 corresponds to the state(s) of one or more datastore tables at a point in time, where the one or more datastore tables enable the host to access data stored in the persistent datastore. For example, a snapshot of the one or more datastore tables is generated every N transactions (e.g., N=1000, 10000, etc.).


In some embodiments, storage medium 130 is divided into a number of addressable and individually selectable blocks. In some embodiments, the individually selectable blocks are the minimum size erasable units in a flash memory device. In other words, each block contains the minimum number of memory cells that can be erased simultaneously. Each block is usually further divided into a plurality of pages and/or word lines, where each page or word line is typically an instance of the smallest individually accessible (readable) portion in a block. In some embodiments (e.g., using some types of flash memory), the smallest individually accessible unit of a data set, however, is a sector, which is a subunit of a page. That is, a block includes a plurality of pages, each page contains a plurality of sectors, and each sector is the minimum unit of data for reading data from the flash memory device.


For example, one block comprises any number of pages, for example, 64 pages, 128 pages, 256 pages or another suitable number of pages. Blocks are typically grouped into a plurality of zones. Each block zone can be independently managed to some extent, which increases the degree of parallelism for parallel operations and simplifies management of storage medium 130.


In some embodiments, storage controller 120 includes a management module 121, an input buffer 123, an output buffer 124, an error control module 125 and a storage medium interface (I/O) 128. Storage controller 120 may include various additional features that have not been illustrated for the sake of brevity and so as not to obscure more pertinent features of the example embodiments disclosed herein, and that a different arrangement of features may be possible. Input and output buffers 123, 124 provide an interface to computer system 110 through data connections 101. Similarly, storage medium I/O 128 provides an interface to storage medium 130 though connections 103. In some embodiments, storage medium I/O 128 includes read and write circuitry, including circuitry capable of providing reading signals to storage medium 130 (e.g., reading threshold voltages for NAND-type flash memory).


In some embodiments, management module 121 includes one or more processing units (CPU(s), also sometimes called one or more processors) 122 configured to execute instructions in one or more programs (e.g., in management module 121). In some embodiments, one or more CPUs 122 are shared by one or more components within, and in some cases, beyond the function of storage controller 120. Management module 121 is coupled to input buffer 123, output buffer 124 (connection not shown), error control module 125 and storage medium I/O 128 in order to coordinate the operation of these components.


Error control module 125 is coupled to storage medium I/O 128, input buffer 123 and output buffer 124. Error control module 125 is provided to limit the number of uncorrectable errors inadvertently introduced into data. In some embodiments, error control module 125 is executed in software by one or more CPUs 122 of management module 121, and, in other embodiments, error control module 125 is implemented in whole or in part using special purpose circuitry to perform encoding and decoding functions. To that end, error control module 125 includes an encoder 126 and a decoder 127. Encoder 126 encodes data by applying an error control code to produce a codeword, which is subsequently stored in storage medium 130.


When the encoded data (e.g., one or more codewords) is read from storage medium 130, decoder 127 applies a decoding process to the encoded data to recover the data, and to correct errors in the recovered data within the error correcting capability of the error control code. Those skilled in the art will appreciate that various error control codes have different error detection and correction capacities, and that particular codes are selected for various applications for reasons beyond the scope of this disclosure. As such, an exhaustive review of the various types of error control codes is not provided herein. Moreover, those skilled in the art will appreciate that each type or family of error control codes may have encoding and decoding algorithms that are particular to the type or family of error control codes. On the other hand, some algorithms may be utilized at least to some extent in the decoding of a number of different types or families of error control codes. As such, for the sake of brevity, an exhaustive description of the various types of encoding and decoding algorithms generally available and known to those skilled in the art is not provided herein.


During a write operation, input buffer 123 receives data to be stored in storage medium 130 from computer system 110 (e.g., write data). The data held in input buffer 123 is made available to encoder 126, which encodes the data to produce one or more codewords. The one or more codewords are made available to storage medium I/O 128, which transfers the one or more codewords to storage medium 130 in a manner dependent on the type of storage medium being utilized.


A read operation is initiated when computer system (host) 110 sends one or more host read commands on control line 111 to storage controller 120 requesting data from storage medium 130. Storage controller 120 sends one or more read access commands to storage medium 130, via storage medium I/O 128, to obtain raw read data in accordance with memory locations (addresses) specified by the one or more host read commands. Storage medium I/O 128 provides the raw read data (e.g., comprising one or more codewords) to decoder 127. If the decoding is successful, the decoded data is provided to output buffer 124, where the decoded data is made available to computer system 110. In some embodiments, if the decoding is not successful, storage controller 120 may resort to a number of remedial actions or provide an indication of an irresolvable error condition.



FIG. 2A is a block diagram illustrating an exemplary management module 121 in accordance with some embodiments. Management module 121 typically includes: one or more processing units (CPUs) 122 for executing modules, programs and/or instructions stored in memory 202 and thereby performing processing operations; memory 202; and one or more communication buses 204 for interconnecting these components. One or more communication buses 204, optionally, include circuitry (sometimes called a chipset) that interconnects and controls communications between system components. Management module 121 is operatively coupled with buffer 123, buffer 124, error control module 125, and storage medium 130 (e.g., through storage medium I/O 128) by one or more communication buses 204. Memory 202 includes high-speed random access memory, such as DRAM, SRAM, DDR RAM or other random access solid state memory devices, and may include non-volatile memory, such as one or more magnetic disk storage devices, optical disk storage devices, flash memory devices, or other non-volatile solid state storage devices. Memory 202, optionally, includes one or more storage devices remotely located from one or more CPUs 122. Memory 202, or alternatively the non-volatile memory device(s) within memory 202, comprises a non-transitory computer readable storage medium. In some embodiments, memory 202, or the non-transitory computer readable storage medium of memory 202, stores the following programs, modules, and data structures, or a subset or superset thereof:

    • data read module 206 for performing a read operation to read data from storage medium 130 (e.g., a persistent data store including non-volatile memory such as flash memory) according to a read command from computer system 110;
    • data write module 208 for performing a write operation to write data (e.g., a record including write data and a log entry) to storage medium 130 according to a write command from computer system 110;
    • data erase module 210 for performing an erase operation to erase data from storage medium 130 according to an erase command from computer system 110;
    • log entry module 212 for generating a log entry associated with respective write data;
    • allocation module 214 for allocating a portion (e.g., a set of logical addresses) of storage medium 130 for a record;
    • reference generation module 216 for generating a reference identifier for a record;
    • record management module 218 for generating a record by populating a plurality of fields of the record with previously generated values and obtained data; for example, a record may include the following fields (or a subset of these fields): metadata, log entry, reference identifier for the record, forward reference identifier for a next record, forward reference address associated with the portion of storage medium 130 allocated for the next record, and write data; in some embodiments, the previously generated values and obtained data are temporarily stored in record buffer 220;
    • log stream management module 222 for batching a plurality of log entries temporarily stored in log stream buffer 224 into a log entry collection, and writing a log stream portion to log stream 134 in storage medium 130; the log stream portion includes the log entry collection and a reference pair (e.g., including a forward reference identifier and a forward reference addresses associated with a next record); in some embodiments, the log stream portion includes more than one reference pair, as explained in more detail below;
    • recovery module 226 for performing a recovery process, or causing a recovery process to be performed, in response to detecting an error condition or synchronization command;
    • deletion module 228 for deleting a record from storage medium 130; and
    • logical to physical mapping 230, which maps logical addresses to physical addresses for respective portions of storage medium 130, and optionally also maps physical addresses for respective portions of storage medium 130 to logical addresses.


Each of the above identified elements may be stored in one or more of the previously mentioned memory devices, and corresponds to a set of instructions for performing a function described above. The above identified modules or programs (i.e., sets of instructions) need not be implemented as separate software programs, procedures or modules, and thus various subsets of these modules may be combined or otherwise re-arranged in various embodiments. In some embodiments, memory 202 stores a subset of the modules and data structures identified above. Furthermore, memory 202 may store additional modules and data structures not described above. In some embodiments, the programs, modules, and data structures stored in memory 202, or the non-transitory computer readable storage medium of memory 202, provide instructions for implementing any of the methods described below with reference to FIGS. 8A-8C.



FIG. 2B is a block diagram illustrating a computer system 110 (e.g., a host) in accordance with some embodiments. Computer system 110 typically includes: one or more processing units (CPUs) 252 for executing modules, programs and/or instructions stored in memory 256 and thereby performing processing operations; memory 256; one or more network interfaces 258; and one or more communication buses 254 for interconnecting these components. One or more communication buses 254, optionally, include circuitry (sometimes called a chipset) that interconnects and controls communications between system components. Computer system 110 is operatively coupled with data storage system 100 by one or more communication buses 254. In some embodiments, computer system 110 also includes a user interface 260. User interface 260 includes one or more output devices 262 that enable presentation of media content, including one or more speakers and/or one or more visual displays. User interface 260 also includes one or more input devices 264, including user interface components that facilitate user input such as a keyboard, a mouse, a voice-command input unit or microphone, a touch screen display, a touch-sensitive input pad, a gesture capturing camera, or other input buttons or controls. Memory 256 includes high-speed random access memory, such as DRAM, SRAM, DDR RAM or other random access solid state memory devices, and may include non-volatile memory, such as one or more magnetic disk storage devices, optical disk storage devices, flash memory devices, or other non-volatile solid state storage devices. Memory 256, optionally, includes one or more storage devices remotely located from one or more CPUs 252. Memory 256, or alternatively the non-volatile memory device(s) within memory 256, comprises a non-transitory computer readable storage medium. In some embodiments, memory 256, or the non-transitory computer readable storage medium of memory 256, stores the following programs, modules, and data structures, or a subset or superset thereof:

    • operating system 266 including procedures for handling various basic system services and for performing hardware dependent tasks;
    • network communication module 268 for connecting computer system 100 to data storage system 110 connected to one or more networks via one or more network interfaces 258 (wired or wireless);
    • presentation module 270 for enabling presentation of information (e.g., a user interface for a web page or an application program, audio and/or video content, text, etc.) at computer system 110 via one or more output devices 262 (e.g., displays, speakers, etc.) associated with user interface 260;
    • input processing module 272 for detecting one or more user inputs or interactions from one of the one or more input devices 614 and interpreting the detected input or interaction;
    • memory command module 274 for issuing memory commands (e.g., read, write, and erase commands) to storage controller 120; and
    • management module 276 for persisting data, including but not limited to:
      • log entry module 278 for generating a log entry associated with respective write data;
      • allocation module 280 for allocating a portion (e.g., a set of logical addresses) of storage medium 130 (e.g., a persistent data store including non-volatile memory such as flash memory) for a record;
      • reference generation module 282 for generating a reference identifier for a record;
      • record management module 284 for generating a record by populating a plurality of fields of the record with previously generated values and obtained data including, for example, metadata, log entry, reference identifier for the record, forward reference identifier for a next record, forward reference address associated with the portion of storage medium 130 allocated for the next record, and write data, where the previously generated values and obtained data are (temporarily) stored in record buffer 286;
      • log stream management module 288 for batching a plurality of log entries (temporarily) stored in log stream buffer 290 into a log entry collection and writing a log stream portion to log stream 134 in storage medium 130, the log stream portion including the log entry collection and a reference pair (e.g., including a forward reference identifier and a forward reference addresses associated with a next record);
      • recovery module 292 for performing a recovery process, or causing a recovery process to be performed, in response to detecting an error condition or synchronization command;
      • deletion module 294 for deleting a record from storage medium 130;
      • logical to physical mapping 296 associating logical addresses with physical addresses for respective portions of storage medium 130; and
      • one or more database tables 298 (e.g., a set of indices or directories) for locating data (e.g., records 132) stored in storage medium 130 (e.g., the persistent data store).


Each of the above identified elements may be stored in one or more of the previously mentioned memory devices, and corresponds to a set of instructions for performing a function described above. The above identified modules or programs (i.e., sets of instructions) need not be implemented as separate software programs, procedures or modules, and thus various subsets of these modules may be combined or otherwise re-arranged in various embodiments. In some embodiments, memory 256 stores a subset of the modules and data structures identified above. Furthermore, memory 256 may store additional modules and data structures not described above. In some embodiments, the programs, modules, and data structures stored in memory 256, or the non-transitory computer readable storage medium of memory 256, provide instructions for implementing any of the methods described below with reference to FIGS. 8A-8C.


Although FIGS. 2A-2B shows a management module 121 and computer system 110, respectively, FIGS. 2A-2B are intended more as functional descriptions of the various features which may be present in a management module and computer system, respectively, than as a structural schematic of the embodiments described herein. In practice, and as recognized by those of ordinary skill in the art, the programs, modules, and data structures shown separately could be combined and some programs, modules, and data structures could be separated.



FIG. 3 illustrates block diagrams of a plurality of related data structures (e.g., records 302) in accordance with some embodiments. FIG. 3 includes records 302-1, 302-2, 302-3, and 302-4. In FIG. 3, a logical address or set of logical addresses in a persistent datastore (e.g., storage medium 130 including non-volatile memory such as flash memory) has been allocated for each of records 302-1, 302-2, 302-3, and 302-4; however, only records 302-1, 302-2, and 302-3 have been written to the persistent datastore.


Each of records 302-1, 302-2, and 302-3 include metadata 304, a log entry 306, a reference identifier 308, a forward reference identifier 310, a forward reference address 312, and write data 314. Record 302-3, for example, includes metadata 304-3, log entry 306-3, reference identifier 308-3, forward reference identifier 310-3, forward reference address 312-3, and write data 314-3.


In some embodiments, representative metadata 304-1 includes information related to write data 314-1. For example, metadata 304-1 includes information corresponding to the provider of write data 314-1, such as a unique identifier associated with the party providing, or author of, write data 314-1. In another example, metadata 304-1 includes information related to write data 314-1 such as a timestamp indicating the time of the write operation of record 302-1, encoding and encryption information, redundancy information, and/or other such information.


In some embodiments, representative log entry 306-1 includes information sufficient to replay the transaction (e.g., a write operation) associated with write data 314-1 in response to detection of an error condition (e.g., power failure, uncorrectable bit error rate, etc.) or a synchronization command. As such, log entries enable an electronic system or device (e.g., computer system 110, FIG. 1 or storage controller 120, FIG. 1) to replay transactions to the persistent datastore that were performed after a most recent snapshot. For example, log entry 306-1 includes the logical address allocated for write data 314-1, or alternatively, the logical address of record 302-1. In this example, the information included in log entry 306-1 enables the electronic system or device to determine where write data 314-1 fits into the persistent datastore (e.g., the logical address or set of logical addresses allocated for the write data).


In some embodiments, representative reference identifier 308-1 is a unique identifier for record 302-1. For example, reference identifier 308-1 is a randomly generated N bit number. In another example, reference identifier 308-1 includes an N/2 bit number which contains the time in seconds of the write operation of the corresponding record 302 in the upper N/2 bits and a randomly generated N/2 bit number in the lower N/2 bits of reference identifier 308-1. In FIG. 3, reference identifier 308-1 for record 302-1 is 0x6681.


In some embodiments, representative forward reference identifier 310-1 includes the reference identifier of the next record. In FIG. 3, forward reference identifier 310-1 for record 302-1 is 0x3695 which corresponds to reference identifier 308-2 for record 302-2.


In some embodiments, representative forward reference address 312-1 includes a pointer to the logical address or set of logical addresses allocated to the next record. For example, forward reference address 312-1 in record 302-1 indicates the first logical address allocated for record 302-2 (i.e., the next record).


In some embodiments, representative write data 314-1 is provided by the host (e.g., computer system 110).


In some embodiments, each of records 302 has a predefined size or one of a plurality of predefined sizes (e.g., 4 kB, 64 kB, 1 MB, 16 MB, etc.). In some embodiments, each of records 302 have differing sizes depending on the size of corresponding write data 314.



FIG. 4 illustrates a flowchart representation of a method 400 of generating the data structures (e.g., records 302) in FIG. 3 in accordance with some embodiments. In some embodiments, method 400 is performed by an electronic system or device with one or more processors and memory that is operatively coupled with a persistent datastore (e.g., storage medium 130 including non-volatile memory (NVM) such as flash memory). For example, method 400 is performed by storage controller 120 or one or more components thereof (e.g., management module 121, FIGS. 1 and 2A). In another example, method 400 is performed by computer system 110 or one or more components thereof (e.g., management module 276, FIG. 2B). In some embodiments, method 400 is governed by instructions that are stored in a non-transitory computer readable storage medium and the instructions are executed by one or more processors of the electronic system or device. For example, the aforementioned one or more processors are one or more processing units (CPUs) 122 of management module 121, or one or more processing units (CPUs) 252 of computer system 110.


The electronic system or device generates (402) a log entry associated with write data for record A (e.g., record 302-1 in FIG. 3). In some embodiments, the log entry includes information sufficient to replay the transaction (e.g., a write operation) associated with write data for record A.


The electronic system or device allocates (404) a portion of the persistent datastore for a next record, herein called record B. In some embodiments, a set of logical addresses are allocated for record B and logical to physical mapping 230 is updated to include the allocated set of logical addresses.


The electronic system or device generates (406) a reference identifier for record B. In FIG. 3, for example, reference identifier 308-2 for record 302-2 is 0x3695. In some embodiments, a reference identifier is a unique number that identifies a record. In some embodiments, reference identifiers are monotonically increasing and are randomly generated.


The electronic system or device generates (408) record A. In some embodiments, generating record A includes populating a plurality of fields of record A with previously generated values and obtained data stored in record buffer 220. In some embodiments, record A includes: (i) the log entry generated in step 402 for record A; (ii) a reference identifier for record A (e.g., previously generated); (iii) a forward reference identifier for record B (e.g., 0x3695) that matches the reference identifier generated for record B in step 406; (iv) a forward reference address for record B that corresponds to the set of logical addresses, or the first logical address in the set of logical addresses, allocated for record B in step 404; and (v) write data for record A (e.g., obtained from the host). However, in some embodiments, record A includes a subset of these fields, and optionally includes additional fields.


The electronic system or device performs a single write operation to write (410) record A to the persistent datastore. For example, data write module 208 writes record A to a set logical addresses allocated for record A. In some embodiments, although record A is written to a contiguous set of logical addresses, record A is striped across one or more physical portions of the persistent datastore (e.g., one or more flash memory devices, one or more flash memory blocks, or the like).


Next, the electronic system or device generates (412) a log entry associated with write data for record B (e.g., record 302-2 in FIG. 3).


The electronic system or device allocates (414) a portion of the persistent datastore for a next record, herein called record C. In some embodiments, a set of logical addresses are allocated for record C and logical to physical mapping 230 is updated to include the allocated set of logical addresses.


The electronic system or device generates (416) a reference identifier for record C. In FIG. 3, for example, reference identifier 308-3 for record 302-3 is 0x4231.


The electronic system or device generates (418) record B. In some embodiments, record B includes: (i) the log entry generated for record B in step 412; (ii) the reference identifier generated for record B in step 406; (iii) a forward reference identifier for record C (e.g., 0x4231) that matches the reference identifier generated for record C in step 416; (iv) a forward reference address for record C that corresponds to the set of logical addresses, or the first logical address in the set of logical addresses, allocated for record C in step 414; and (v) write data for record B. However, in some embodiments, record B includes a subset of these fields, and optionally includes additional fields.


The electronic system or device performs a single write operation to write (420) record B to the persistent datastore. For example, data write module 208 writes record B to the set logical addresses allocated for record B in step 404.


The electronic system or device continues to write records to the persistent store, as described above, and prior to writing each such record, to allocate a portion of the persistent datastore for a next record, so that each record written to the persistent data store includes a forward reference address and forward reference identifier of the next record relative to the record being written, as well as a log entry and write data. Further, each such record is written with a single write operation, as described above.



FIG. 5 illustrates a block diagram of a log stream 134 in accordance with some embodiments. Log stream 134 is stored in a persistent datastore (e.g., storage medium 130 comprising non-volatile memory such as flash memory), and log stream 134 comprises a plurality of log stream portions including log stream portions 504-1 and 504-2.


In some embodiments, each of the plurality of log entries in log stream 134 includes information sufficient to replay a transaction (e.g., a write operation) associated with corresponding write data. In some embodiments, a respective log stream portion 504 of log stream 134 corresponds to a log entry collection (e.g., 256 log entries). In FIG. 5, log stream portion 504-1 corresponds to a log entry collection including log entries 0 through 255, and log stream portion 504-2 corresponds to a log entry collection including log entries 7324 through 7679.


In some embodiments, an electronic system or device (e.g., computer system 110, FIG. 1 or storage controller 120, FIG. 1) or a component thereof (e.g., log stream management module 222, FIG. 2A or log stream management module 288, FIG. 2B) is configured to batch a plurality of log entries into a log entry collection and write a log stream portion to a log stream in the persistent datastore. The log stream portion includes the log entry collection and a reference pair. In some embodiments, the last log entry in the log entry collection is included in a record which also includes the reference pair. In some embodiments, the reference pair includes a forward reference identifier and a forward reference address corresponding to a next allocated record whose corresponding log entry has not been written to the log stream.


In FIG. 5, log stream portion 504-1 includes log entries 0 through 255 (e.g., the log entry collection) and, also, forward reference identifier 506 and forward reference address 508 (e.g., the reference pair). Forward reference identifier 506 and forward reference address 508 are also included in the record corresponding to log entry 255. In FIG. 5, log stream portion 504-2 includes log entries 7324 through 7679 (e.g., the log entry collection) and, also, forward reference identifier 510 and forward reference address 512 (e.g., the reference pair corresponding to record 302-1). Forward reference identifier 510 and forward reference address 512 are included in the record corresponding to log entry 7679. For example, log stream portion 504-1 is a first portion of log stream 134 and log stream portion 504-2 is a newest (or most recently written) portion of log stream 134.


For example, the electronic system or device or a component thereof (e.g., log stream management module 222, FIG. 2A or log stream management module 288, FIG. 2B) caches in a buffer (e.g., log stream buffer 224, FIG. 2A or log stream buffer 290, FIG. 2B) log entry 0 associated with record 0 and the forward reference identifier and forward reference address included in record 0. Then, in this example, the electronic system or device or a component thereof (e.g., log stream management module 222, FIG. 2A or log stream management module 288, FIG. 2B) caches in the buffer log entry 1 associated with record 1 and replaces the forward reference identifier and forward reference address included in record 0 with the forward reference identifier and forward reference address included in record 1. Continuing with this example, the electronic system or device or a component thereof (e.g., log stream management module 222, FIG. 2A or log stream management module 288, FIG. 2B) continues caching log entries and replacing the cached forward reference identifier and forward reference address with the forward reference identifier and forward reference address in the record associated with the newest cached log entry until a predetermined count of log entries (e.g., 256 log entries) are cached in the buffer. In some alternative embodiments, the electronic system or device or a component thereof caches log entries, without writing forward reference identifiers and forward reference addresses to the log stream buffer until a predetermined count of log entries (e.g., 256 log entries) are cached in the buffer, at which point it stores in the log stream buffer the forward reference identifier and forward reference address in the record associated with the newest cached log entry.


In some embodiments, after the electronic system or device or a component thereof (e.g., log stream management module 222, FIG. 2A or log stream management module 288, FIG. 2B) has cached the predetermined count of log entries, the electronic system or device or a component thereof (e.g., data write module 208, FIG. 2A or memory command module 274, FIG. 2B) writes the contents of the buffer (e.g., the log stream portion), or causes the contents to be written, to log stream 134 in the persistent datastore and the buffer is flushed.


In some embodiments, in response to detecting an error condition, the electronic system or device or a component thereof (e.g., recovery module 226, FIG. 2A or recovery module 292, FIG. 2B) is configured to perform a recovery process to recover the persistent datastore. In some embodiments, in response to a synchronization command, the electronic system or device or a component thereof (e.g., recovery module 226, FIG. 2A or recovery module 292, FIG. 2B) is configured to perform a recovery process to synchronize a target persistent datastore with a reference persistent datastore.


In some embodiments, the recovery process includes reading the log entries from log stream 134 with a single read operation or a series of contiguous read operations. In this example, after the log entries from log stream 134 have been read, the electronic system or device or a component thereof (e.g., recovery module 226, FIG. 2A or recovery module 292, FIG. 2B) is configured to utilize the log entries to replay the transactions associated with each of the log entries. Therefore, log stream 134 enables the electronic system or device to perform a recovery process with a minimum number of read operations.


In some embodiments, the recovery process also includes following a pointer (e.g., forward reference address 512) included in the newest log stream portion (e.g., log stream portion 504-2) to a first record (e.g., record 302-1) whose log entry has not been written to the log stream. In FIG. 5, forward reference address 512 in log stream portion 504-2 includes a first logical address in the set of logical addresses allocated for record 302-1.


In some embodiments, the recovery process further includes determining whether a forward reference identifier included in the newest log stream portion matches the reference identifier of the first record. In FIG. 5, forward reference identifier 510 (e.g., 0x6681) matches the reference identifier (e.g., 0x6681) included in record 302-1. In accordance with the determination that forward reference identifier 510 matches record 302-1 reference identifier, the recovery process further includes utilizing log entry 7680 associated with record 302-1 to replay the transaction associated with record 302-1's write data.


In some embodiments, the recovery process further includes following the forward reference address in the first record (e.g., record 302-1) to a second record (e.g., record 302-2), determining whether the forward reference identifier in the first record matches the reference identifier in the second record, and, in accordance with a determination that there is a match, replaying the transaction associated with the second record's write data. This process is repeated until the forward reference identifier included in a record (e.g., record 302-3) fails to match the reference identifier in a next record (e.g., record 302-4).


When a match cannot be determined, the electronic system or device or a component thereof (e.g., recovery module 226, FIG. 2A or recovery module 292, FIG. 2B) is configured to stop the recovery process. The match failure indicates that the next record (e.g., record 302-4) has been allocated but not written. Thus, the electronic system or device has completed replaying all transactions that occurred (e.g., all transactions that were successfully committed to a persistent datastore) prior to the detection of the error condition or synchronization command.


In another example, different from what is shown in FIG. 5, forward reference address 512 in log stream portion 504-2 points to a next record that is allocated but not written to persistent storage. Thus, forward reference identifier 510 in log stream portion 504-2 does not match the reference identifier associated with the next record that is allocated but not written indicating that the recovery process is complete.



FIG. 6 illustrates a block diagram of a log stream portion 602 in accordance with some embodiments. In FIG. 6, log stream portion 602 is a representative portion of log stream 134 (FIG. 1) in the persistent datastore (e.g., storage medium 130 comprising non-volatile memory such as flash memory).


Log stream portion 602 includes log entries 0 through 255 and a plurality of reference pairs. Each reference pair of log stream portion 602 includes a pointer (e.g., a forward reference address) to a first logical address of a next allocated record in a reference list (or set of records) associated with one of a plurality of predetermined record sizes. In some embodiments, in the last log stream portion 602 in log stream 134, a reference pair includes a forward reference identifier and a forward reference address corresponding to a next allocated record whose corresponding log entry has not been written to log stream 134.


In FIG. 6, forward reference identifier 604 and forward reference address 606 correspond to record 652. In FIG. 6, forward reference identifier 604 (e.g., 0x6477) in log stream portion 602 matches reference identifier 654 (e.g., 0x6477) in record 652. Forward reference address 606 corresponds to a set of logical addresses, or a first logical address in the set of logical addresses, allocated for record 652. Record 652 is the first 4 kB record in 4 kB reference list 650. 4 kB reference list 650 links records having a record size of 4 kB.


In FIG. 6, forward reference identifier 608 and forward reference address 610 correspond to record 622. In FIG. 6, forward reference identifier 608 (e.g., 0x7614) in log stream portion 602 matches reference identifier 624 (e.g., 0x7614) in record 622. Forward reference address 610 corresponds to a set of logical addresses, or a first logical address in the set of logical addresses, allocated for record 622. Record 622 is the first 64 kB record in 64 kB reference list 620. 64 kB reference list 620 links records having a record size of 64 kB.


In FIG. 6, forward reference identifier 612 and forward reference address 614 correspond to record 632. In FIG. 6, forward reference identifier 612 (e.g., 0x5468) in log stream portion 602 matches reference identifier 634 (e.g., 0x5468) in record 632. Forward reference address 614 corresponds to a set of logical addresses, or a first logical address in the set of logical addresses, allocated for record 632. Record 632 is the first 1 MB record in 1 MB reference list 630. 1 MB reference list 630 links records having a record size of 1 MB. In FIG. 6, log entry 256 is included in record 632; thus, record 632 was written to the persistent datastore after the record corresponding to log entry 255.


In FIG. 6, forward reference identifier 616 and forward reference address 618 correspond to record 642. In FIG. 6, forward reference identifier 616 (e.g., 0x9540) in log stream portion 602 matches reference identifier 644 (e.g., 0x9540) in record 642. Forward reference address 618 corresponds to a set of logical addresses, or a first logical address in the set of logical addresses, allocated for record 642. Record 642 is the first 16 MB record in 16 MB reference list 640. 16 MB reference list 640 links records having a record size of 16 MB.



FIG. 7 illustrates block diagrams of related data structures (e.g., records 702 and 710) in accordance with some embodiments.


In FIG. 7, record 702 is stored in a persistent datastore (e.g., storage medium 130 including non-volatile memory such as flash memory) and includes write data 704. In response to a command to delete write data 704, an electronic system or device (e.g., computer system 110, FIG. 1 or storage controller 120, FIG. 1) or a component thereof (e.g., deletion module 228, FIG. 2A or deletion module 294, FIG. 2B) is configured to generate record 710, including log entry 712 indicating that record 710 represents a deletion of record 702 and tombstone 714 corresponding to write data 704. Then, the electronic system or device or a component thereof (e.g., data write module 208, FIG. 2A or memory command module 274, FIG. 2B) is configured to write record 710 to the persistent datastore with a single write operation. In some embodiments, record 710 is written to the set of logical addresses allocated for record 702.



FIGS. 8A-8C illustrate a flowchart representation of a method 800 of persisting data in accordance with some embodiments. In some embodiments, method 800 is performed by an electronic system or device with one or more processors and memory that is operatively coupled with a persistent datastore (e.g., storage medium 130 including non-volatile memory such as flash memory). For example, method 800 is performed by storage controller 120 or one or more components thereof (e.g., management module 121, FIGS. 1 and 2A). In another example, method 800 is performed by computer system 110 or one or more components thereof (e.g., management module 276, FIG. 2B). In some embodiments, method 800 is governed by instructions that are stored in a non-transitory computer readable storage medium and the instructions are executed by one or more processors of the electronic system or device.


The electronic system or device generates (802) a log entry associated with first write data corresponding to a first record. With reference to FIG. 3, for example, the electronic system or device or a component thereof (e.g., log entry module 212, FIG. 2A or log entry module 278, FIG. 2B) generates log entry 306-1 for record 302-1 based on write data 314-1. In some embodiments, log entry 306-1 is subsequently cached in a buffer (e.g., record buffer 220, FIG. 2A or record buffer 286, FIG. 2B) prior to generation of record 302-1.


In some embodiments, the log entry includes (804) information corresponding to an update (e.g., a transaction or memory operation) of the persistent datastore corresponding to the first write data.


In some embodiments, the electronic system or device generates (806) a reference identifier for the first record. With reference to FIG. 3, for example, the electronic system or device or a component thereof (e.g., reference generation module 216, FIG. 2A or reference generation module 282, FIG. 2B) generates reference identifier 308-1 (e.g., 0x6681) for record 302-1. In some embodiments, reference identifier 308-1 is subsequently cached in a buffer (e.g., record buffer 220, FIG. 2A or record buffer 286, FIG. 2B) prior to generation of record 302-1.


In some embodiments, prior to performing (808) a write operation corresponding to the first record, the electronic system or device allocates (810) a portion of the persistent datastore for the second record. With reference to FIG. 3, for example, the electronic system or device or a component thereof (e.g., allocation module 214, FIG. 2A or allocation module 280, FIG. 2B) allocates a logical address or set of logical addresses in the persistent datastore for record 302-2 before writing record 302-1 to the persistent datastore. In some embodiments, the first logical address allocated for record 302-2 is subsequently cached in a buffer (e.g., record buffer 220, FIG. 2A or record buffer 286, FIG. 2B), as a forward reference address, prior to generation of record 302-1.


In some embodiments, prior to performing (808) a write operation corresponding to the first record, the electronic system or device generates (812) a reference identifier for the second record, where a forward reference identifier associated with the first record matches the reference identifier for the second record. With reference to FIG. 3, for example, the electronic system or device or a component thereof (e.g., reference generation module 216, FIG. 2A or reference generation module 282, FIG. 2B) generates reference identifier 308-2 for record 302-2 before writing record 302-1 to the persistent datastore. In FIG. 3, for example, forward reference identifier 310-1 in record 302-1 matches reference identifier 308-2 for record 302-2 (e.g., 0x3695). In some embodiments, reference identifier 308-2 is subsequently cached in a buffer (e.g., record buffer 220, FIG. 2A or record buffer 286, FIG. 2B) prior to generation of record 302-1.


The electronic system or device generates (814) the first record including the log entry, the first write data, and a pointer to the second record different from the first record. With reference to FIG. 3, for example, the electronic system or device or a component thereof (e.g., record management module 218, FIG. 2A or record management module 284, FIG. 2B) generates record 302-2 by populating a plurality of fields of record 302-2 with previously generated values and obtained data cached in an associated buffer (e.g., record buffer 220, FIG. 2A or record buffer 286, FIG. 2B). For example, for record 302-2, a log entry field is populated with log entry 306-2 associated with write data 314-2, a write data field is populated with write data 314-2 received from a host (e.g., computer system 110, FIG. 1), and a pointer field (e.g., forward reference address 312-2) is populated with the set of logical addresses, or a first logical address in the set of logical addresses, allocated for record 302-3.


In some embodiments, the pointer to the second record is (816) a forward reference address corresponding to the portion of the persistent datastore allocated for the second record. In FIG. 3, for example, a forward reference address field of record 302-1 is populated with forward reference address 312-1 that includes the first logical address in the set of logical addresses allocated for record 302-2 in the persistent datastore. Thus, in this example, forward reference address 312-1 points to record 302-2. For example, the set of logical addresses allocated for record 302-2 are cached in a buffer (e.g., record buffer 220, FIG. 2A or record buffer 286, FIG. 2B).


In some embodiments, the first record further includes (818) a forward reference identifier that matches the reference identifier for the second record. With reference to FIG. 3, for example, a forward reference identifier field of record 302-1 is populated with forward reference identifier 310-1 (e.g., 0x3695) that matches reference identifier 308-2 (e.g., 0x3695) in record 302-2. For example, reference identifier 308-2 is cached in a buffer (e.g., record buffer 220, FIG. 2A or record buffer 286, FIG. 2B).


In some embodiments, the first record further includes (820) the reference identifier for the first record. With reference to FIG. 3, for example, a reference identifier field of record 302-1 is populated with reference identifier 308-1 (e.g., 0x6681). For example, reference identifier 308-1 is cached in a buffer (e.g., record buffer 220, FIG. 2A or record buffer 286, FIG. 2B).


The electronic system or device performs (822) a single write operation that includes writing the first record to the persistent datastore. With reference to FIG. 3, for example, record 302-2 is written to a logical address or a contiguous set of logical addresses in the persistent datastore. In some embodiments, from the perspective of the host (e.g., computer system 110), “writing the first record” means sending a single write command to storage controller 120 to write the first record to the persistent datastore (i.e., causing the write operation to be performed).


In some embodiments, the electronic system or device batches (824) a plurality of log entries into a log entry collection, the log entry collection including a last respective log entry associated with a last record. In some embodiments, the log entries are cached in a buffer (e.g., log stream buffer 224, FIG. 2A or log stream buffer 290, FIG. 2B). With reference to FIG. 5, for example, after a predetermined count of log entries (e.g., 256 log entries) have been cached, the electronic system or device or a component thereof (e.g., log stream management module 222, FIG. 2A or log stream management module 288, FIG. 2B) batches the log entries cached in the buffer into a log entry collection. In FIG. 5, for example, a log entry collection in log stream portion 504-2 includes log entries 7324 through 7679. In FIG. 5, for example, log entry 7679 is the last log entry of the log entry collection in log stream portion 504-2.


In some embodiments, after performing the batching, the electronic system or device performs (826) a second write operation that includes writing a log stream portion to a log stream in the persistent datastore, the log stream portion includes the log entry collection and a pointer to a next record following the last record. With reference to FIG. 5, for example, after batching the log entries into the log entry collection, the electronic system or device or a component thereof (e.g., data write module 208, FIG. 2A or memory command module 274, FIG. 2B) writes log stream portion 504-2 to log stream 134 in the persistent datastore. In FIG. 5, for example, log stream portion 504-2 includes log entries 7324 through 7679 (e.g., the log entry collection) and, also, forward reference identifier 510 and forward reference address 512 (e.g., the pointer to the next record following the record associated with log entry 7679). In FIG. 5, forward reference address 512 in log stream portion 504-2 includes a first logical address in the set of logical addresses allocated for record 302-1.


In some embodiments, the plurality of log entries in the log entry collection are sequentially written (828) to the log stream in the persistent datastore. For example, the log entries in the log entry collection are arranged in the order in which their corresponding records were written to the persistent datastore. With reference to FIG. 5, for example, log entry 0 corresponds to a first record written to the persistent datastore and log entry 1 corresponds to a second record written to the persistent datastore. To preserve this order, the log entries are sequentially arranged in the log entry collection and sequentially written to log stream 134.


In some embodiments, after performing the batching, the electronic system or device performs (830) a second write operation that includes writing a log stream portion to a log stream in the persistent datastore, the log stream portion includes the log entry collection and a plurality of pointers, where: each of the plurality of pointers is associated with one of a plurality of record sets, where each record set corresponds to a different record size; and one of the plurality of pointers is associated with a next record following the last record. With reference to FIG. 6, for example, log stream portion 602 is written to log stream 134 in the persistent datastore. In FIG. 6, for example, log stream portion 602 includes log entries 0 through 255 and a plurality of reference pairs. In FIG. 6, for example, each reference pair includes a pointer (e.g., a forward reference addresses 606, 610, 614, 618) to a first logical address of a next allocated record in a reference list (or record set) (e.g., reference lists 620, 630, 640, 650) associated with one of a plurality of predetermined record sizes (e.g., 4 kB, 64 kB, 1 MB, 16 MB respectively). In FIG. 6, forward reference address 614 points to record 632 including log entry 256, which is the next log entry following log entry 255 in log stream portion 602.


In some embodiments, each of the log entries in the log entry collection corresponds to (832) one of the plurality of different record sizes. In FIG. 6, for example, each of log entries 0 through 255 comprising the log entry collection in log stream portion 602 is associated with one of a plurality of record sizes (e.g., 4 kB, 64 kB, 1 MB, 16 MB, and so on).


In some embodiments, the electronic system or device generates (834) a third record including a log entry indicating that the third record represents a deletion of the first write data, a tombstone corresponding to the first write data, and a forward reference identifier associated with a fourth record. With reference to FIG. 7, for example, the electronic system or device or a component thereof (e.g., deletion module 228, FIG. 2A or deletion module 294, FIG. 2B) generates record 710. In FIG. 7, for example, record 710 includes log entry 712 indicating that record 710 represents a deletion of record 702, tombstone 714 corresponding to write data 704 in record 702, and forward reference address 716 including a first logical address in a set of logical addresses allocated for a next record.


In some embodiments, after generating the third record, the electronic system or device performs (836) a third write operation that includes writing the third record to the persistent datastore. With reference to FIG. 7, for example, the electronic system or device or a component thereof (e.g., data write module 208, FIG. 2A or memory command module 274, FIG. 2B) writes record 710 to the persistent datastore.


It will be understood that, although the terms “first,” “second,” etc. may be used herein to describe various elements, these elements should not be limited by these terms. These terms are only used to distinguish one element from another. For example, a first record could be termed a second record, and, similarly, a record could be termed a first record, without changing the meaning of the description, so long as all occurrences of the “first record” are renamed consistently and all occurrences of the “second record” are renamed consistently. The first record and the second record are both records, but they are not the same record.


The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the claims. As used in the description of the embodiments and the appended claims, the singular forms “a,” “an” and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will also be understood that the term “and/or” as used herein refers to and encompasses any and all possible combinations of one or more of the associated listed items. It will be further understood that the terms “comprises” and/or “comprising,” when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.


As used herein, the term “if” may be construed to mean “when” or “upon” or “in response to determining” or “in accordance with a determination” or “in response to detecting,” that a stated condition precedent is true, depending on the context. Similarly, the phrase “if it is determined [that a stated condition precedent is true]” or “if [a stated condition precedent is true]” or “when [a stated condition precedent is true]” may be construed to mean “upon determining” or “in response to determining” or “in accordance with a determination” or “upon detecting” or “in response to detecting” that the stated condition precedent is true, depending on the context.


The foregoing description, for purpose of explanation, has been described with reference to specific embodiments. However, the illustrative discussions above are not intended to be exhaustive or to limit the claims to the precise forms disclosed. Many modifications and variations are possible in view of the above teachings. The embodiments were chosen and described in order to best explain principles of operation and practical applications, to thereby enable others skilled in the art.

Claims
  • 1. A method of recovering persisted data, comprising: at an electronic system with one or more processors and memory: generating a first log entry associated with first write data to be stored in a persistent data store, wherein the first log entry includes information sufficient to replay a transaction corresponding to the first write data;generating a forward reference identifier for a second record of a plurality of sequential records that is different from a first record of the plurality of sequential records, wherein each respective record of the plurality of sequential records includes a respective log entry, write data that was not yet stored in the persistent data store when said log entry was generated, a respective reference identifier for the respective record, a forward reference identifier for a next record in the sequence, and a pointer to a next record in the sequence;generating the first record including the first log entry, the first write data, the forward reference identifier for the second record, and a pointer to the second record;performing a single write operation that includes writing the first record to the persistent datastore, wherein: the pointer to the second record is a pointer to a location in the persistent data store allocated for writing the second record prior to writing the first record and the second record to the persistent datastore, andthe forward reference identifier for the second record is different from the pointer to the second record; andperforming a recovery operation that includes: reading the first log entry;using the pointer to the second record to read a second log entry;determining whether the forward reference identifier for the second record matches a second reference identifier in the second record;in accordance with a determination that the forward reference identifier for the second record matches the second reference identifier in the second record, replaying a transaction associated with the second log entry; andin accordance with a determination that the forward reference identifier for the second record does not match the second reference identifier in the second record, stopping the recovery operation.
  • 2. The method of claim 1, wherein the first log entry includes a logical address of the first record or of the first write data.
  • 3. The method of claim 1, further comprising: generating a reference identifier for the first record; andwherein the first record further includes the reference identifier for the first record.
  • 4. The method of claim 1, wherein the first log entry includes information corresponding to an update of the persistent datastore corresponding to the first write data.
  • 5. The method of claim 1, further comprising: batching a plurality of log entries into a log entry collection, the log entry collection including a last respective log entry associated with a last record; andperforming a second write operation that includes writing a log stream portion to a log stream in the persistent datastore, the log stream portion includes the log entry collection and, separate from the log entry collection, a pointer to a next record following the last record.
  • 6. The method of claim 5, wherein the plurality of log entries in the log entry collection are sequentially written to the log stream in the persistent datastore.
  • 7. The method of claim 1, further comprising: batching a plurality of log entries into a log entry collection, the log entry collection including a last respective log entry associated with a last record; andperforming a second write operation that includes writing a log stream portion to a log stream in the persistent datastore, the log stream portion includes the log entry collection and a plurality of pointers, wherein: each of the plurality of pointers is associated with one of a plurality of record sets, wherein at least one record set of the plurality of record sets has a different size from at least one other record set of the plurality of record sets; andone of the plurality of pointers is associated with a next record following the last record.
  • 8. The method of claim 7, wherein each of the log entries in the log entry collection corresponds to one of the plurality of different record sizes.
  • 9. The method of claim 1, further comprising: generating a third record including a log entry indicating that the third record represents a deletion of the first write data, a tombstone corresponding to the deleted first write data, and a forward reference identifier associated with a fourth record; andperforming a third write operation that includes writing the third record to the persistent datastore.
  • 10. An electronic system, comprising: one or more processors; andmemory storing one or more programs to be executed by the one or more processors, the one or more programs comprising instructions for: generating a first log entry associated with first write data to be stored in a persistent data store, wherein the first log entry includes information sufficient to replay a transaction associated with the first write data;generating a forward reference identifier for a second record of a plurality of sequential records that is different from a first record of the plurality of sequential records, wherein each respective record of the plurality of sequential records includes a respective log entry, write data that was not yet stored in the persistent data store when said log entry was generated, a respective reference identifier for the respective record, a forward reference identifier for a next record in the sequence, and a pointer to a next record in the sequence;generating the first record including the first log entry, the first write data, the forward reference identifier for the second record, and a pointer to the second record;performing a single write operation that includes writing the first record to the persistent datastore, wherein: the pointer to the second record is a pointer to a location in the persistent data store allocated for writing the second record prior to writing the first record and the second record to the persistent datastore, andthe forward reference identifier for the second record is different from the pointer to the second record; andperforming a recovery operation that includes: reading the first log entry;using the pointer to the second record to read a second log entry;determining whether the forward reference identifier for the second record matches a second reference identifier in the second record;in accordance with a determination that the forward reference identifier for the second record matches the second reference identifier in the second record, replaying a transaction associated with the second log entry; andin accordance with a determination that the forward reference identifier for the second record does not match the second reference identifier in the second record, stopping the recovery operation.
  • 11. The electronic system of claim 10, wherein the first log entry includes a logical address of the first record or of the first write data.
  • 12. The electronic system of claim 10, wherein the one or more programs further comprise instructions for: generating a reference identifier for the first record; andwherein the first record further includes the reference identifier for the first record.
  • 13. The electronic system of claim 10, wherein the first log entry includes information corresponding to an update of the persistent datastore corresponding to the first write data.
  • 14. The electronic system of claim 10, wherein the one or more programs further comprise instructions for: batching a plurality of log entries into a log entry collection, the log entry collection including a last respective log entry associated with a last record; andperforming a second write operation that includes writing a log stream portion to a log stream in the persistent datastore, the log stream portion includes the log entry collection and, separate from the log entry collection, a pointer to a next record following the last record.
  • 15. The electronic system of claim 14, wherein the plurality of log entries in the log entry collection are sequentially written to the log stream in the persistent datastore.
  • 16. The electronic system of claim 10, wherein the one or more programs further comprise instructions for: batching a plurality of log entries into a log entry collection, the log entry collection including a last respective log entry associated with a last record; andperforming a second write operation that includes writing a log stream portion to a log stream in the persistent datastore, the log stream portion includes the log entry collection and a plurality of pointers, wherein: each of the plurality of pointers is associated with one of a plurality of record sets, wherein at least one record set of the plurality of record sets has a different size from at least one other record set of the plurality of record sets; andone of the plurality of pointers is associated with a next record following the last record.
  • 17. The electronic system of claim 16, wherein each of the log entries in the log entry collection corresponds to one of the plurality of different record sizes.
  • 18. The electronic system of claim 10, wherein the one or more programs further comprise instructions for: generating a third record including a log entry indicating that the third record represents a deletion of the first write data, a tombstone corresponding to the deleted first write data, and a forward reference identifier associated with a fourth record; andperforming a third write operation that includes writing the third record to the persistent datastore.
  • 19. A non-transitory computer readable storage medium storing one or more programs, the one or more programs comprising instructions, which, when executed by an electronic system with one or more processors, cause the electronic systems to perform operations comprising: generating a first log entry associated with first write data to be stored in a persistent data store, wherein the first log entry includes information sufficient to replay a transaction associated with the first write data;generating a forward reference identifier for a second record of a plurality of sequential records that is different from a first record of the plurality of sequential records, wherein each respective record of the plurality of sequential records includes a respective log entry, write data that was not yet stored in the persistent data store when said log entry was generated, a respective reference identifier for the respective record, a forward reference identifier for a next record in the sequence, and a pointer to a next record in the sequence;generating the first record including the first log entry, the first write data, the forward reference identifier for the second record, and a pointer to the second record;performing a single write operation that includes writing the first record to the persistent datastore, wherein: the pointer to the second record is a pointer to a location in the persistent data store allocated for writing the second record prior to writing the first record and the second record to the persistent datastore, andthe forward reference identifier for the second record is different from the pointer to the second record; andperforming a recovery operation that includes: reading the first log entry;using the pointer to the second record to read a second log entry;determining whether the forward reference identifier for the second record matches a second reference identifier in the second record;in accordance with a determination that the forward reference identifier for the second record matches the second reference identifier in the second record, replaying a transaction associated with the second log entry; andin accordance with a determination that the forward reference identifier for the second record does not match the second reference identifier in the second record, stopping the recovery operation.
RELATED APPLICATIONS

This application claims priority to U.S. Provisional Patent Application No. 61/906,406, filed Nov. 19, 2013, which is hereby incorporated by reference in its entirety.

US Referenced Citations (534)
Number Name Date Kind
4173737 Skerlos et al. Nov 1979 A
4888750 Kryder et al. Dec 1989 A
4916652 Schwarz et al. Apr 1990 A
5129089 Nielsen Jul 1992 A
5270979 Harari et al. Dec 1993 A
5329491 Brown et al. Jul 1994 A
5381528 Brunelle Jan 1995 A
5404485 Ban Apr 1995 A
5488702 Byers et al. Jan 1996 A
5519847 Fandrich et al. May 1996 A
5530705 Malone, Sr. Jun 1996 A
5537555 Landry et al. Jul 1996 A
5551003 Mattson et al. Aug 1996 A
5636342 Jeffries Jun 1997 A
5657332 Auclair et al. Aug 1997 A
5666114 Brodie et al. Sep 1997 A
5708849 Coke et al. Jan 1998 A
5765185 Lambrache et al. Jun 1998 A
5890193 Chevallier Mar 1999 A
5930188 Roohparvar Jul 1999 A
5936884 Hasbun et al. Aug 1999 A
5943692 Marberg et al. Aug 1999 A
5946714 Miyauchi Aug 1999 A
5982664 Watanabe Nov 1999 A
6000006 Bruce et al. Dec 1999 A
6006345 Berry, Jr. Dec 1999 A
6016560 Wada et al. Jan 2000 A
6018304 Bessios Jan 2000 A
6044472 Crohas Mar 2000 A
6070074 Perahia et al. May 2000 A
6104304 Clark et al. Aug 2000 A
6119250 Nishimura et al. Sep 2000 A
6138261 Wilcoxson et al. Oct 2000 A
6182264 Ott Jan 2001 B1
6192092 Dizon et al. Feb 2001 B1
6260120 Blumenau et al. Jul 2001 B1
6295592 Jeddeloh Sep 2001 B1
6311263 Barlow et al. Oct 2001 B1
6408394 Vander Kamp et al. Jun 2002 B1
6412042 Paterson et al. Jun 2002 B1
6442076 Roohparvar Aug 2002 B1
6449625 Wang Sep 2002 B1
6484224 Robins et al. Nov 2002 B1
6516437 Van Stralen et al. Feb 2003 B1
6564285 Mills et al. May 2003 B1
6647387 McKean et al. Nov 2003 B1
6678788 O'Connell Jan 2004 B1
6728879 Atkinson Apr 2004 B1
6757768 Potter et al. Jun 2004 B1
6775792 Ulrich et al. Aug 2004 B2
6810440 Micalizzi, Jr. et al. Oct 2004 B2
6836808 Bunce et al. Dec 2004 B2
6836815 Purcell et al. Dec 2004 B1
6842436 Moeller Jan 2005 B2
6865650 Morley et al. Mar 2005 B1
6871257 Conley et al. Mar 2005 B2
6895464 Chow et al. May 2005 B2
6934755 Saulpaugh et al. Aug 2005 B1
6966006 Pacheco et al. Nov 2005 B2
6978343 Ichiriu Dec 2005 B1
6980985 Amer-Yahia et al. Dec 2005 B1
6981205 Fukushima et al. Dec 2005 B2
6988171 Beardsley et al. Jan 2006 B2
7020017 Chen et al. Mar 2006 B2
7024514 Mukaida et al. Apr 2006 B2
7028165 Roth et al. Apr 2006 B2
7032123 Kane et al. Apr 2006 B2
7043505 Teague et al. May 2006 B1
7076598 Wang Jul 2006 B2
7100002 Shrader Aug 2006 B2
7102860 Wenzel Sep 2006 B2
7111293 Hersh et al. Sep 2006 B1
7126873 See et al. Oct 2006 B2
7133282 Sone Nov 2006 B2
7155579 Neils et al. Dec 2006 B1
7162678 Saliba Jan 2007 B2
7173852 Gorobets et al. Feb 2007 B2
7184446 Rashid et al. Feb 2007 B2
7212440 Gorobets May 2007 B2
7269755 Moshayedi et al. Sep 2007 B2
7275170 Suzuki Sep 2007 B2
7295479 Yoon et al. Nov 2007 B2
7328377 Lewis et al. Feb 2008 B1
7426633 Thompson et al. Sep 2008 B2
7486561 Mokhlesi Feb 2009 B2
7516292 Kimura et al. Apr 2009 B2
7523157 Aguilar, Jr. et al. Apr 2009 B2
7527466 Simmons May 2009 B2
7529466 Takahashi May 2009 B2
7533214 Aasheim et al. May 2009 B2
7546478 Kubo et al. Jun 2009 B2
7566987 Black et al. Jul 2009 B2
7571277 Mizushima Aug 2009 B2
7574554 Tanaka et al. Aug 2009 B2
7596643 Merry, Jr. et al. Sep 2009 B2
7669003 Sinclair et al. Feb 2010 B2
7681106 Jarrar et al. Mar 2010 B2
7685494 Varnica et al. Mar 2010 B1
7707481 Kirschner et al. Apr 2010 B2
7761655 Mizushima et al. Jul 2010 B2
7765454 Passint Jul 2010 B2
7774390 Shin Aug 2010 B2
7809836 Mihm et al. Oct 2010 B2
7840762 Oh et al. Nov 2010 B2
7870326 Shin et al. Jan 2011 B2
7890818 Kong et al. Feb 2011 B2
7913022 Baxter Mar 2011 B1
7925960 Ho et al. Apr 2011 B2
7934052 Prins et al. Apr 2011 B2
7945825 Cohen et al. May 2011 B2
7954041 Hong et al. May 2011 B2
7971112 Murata Jun 2011 B2
7974368 Shieh et al. Jul 2011 B2
7978516 Olbrich et al. Jul 2011 B2
7996642 Smith Aug 2011 B1
8006161 Lestable et al. Aug 2011 B2
8032724 Smith Oct 2011 B1
8041884 Chang Oct 2011 B2
8042011 Nicolaidis et al. Oct 2011 B2
8069390 Lin Nov 2011 B2
8190967 Hong et al. May 2012 B2
8250380 Guyot Aug 2012 B2
8254181 Hwang et al. Aug 2012 B2
8259506 Sommer et al. Sep 2012 B1
8261020 Krishnaprasad et al. Sep 2012 B2
8312349 Reche et al. Nov 2012 B2
8385117 Sakurada et al. Feb 2013 B2
8412985 Bowers et al. Apr 2013 B1
8429436 Fillingim et al. Apr 2013 B2
8438459 Cho et al. May 2013 B2
8453022 Katz May 2013 B2
8473680 Pruthi Jun 2013 B1
8510499 Banerjee Aug 2013 B1
8531888 Chilappagari et al. Sep 2013 B2
8554984 Yano et al. Oct 2013 B2
8627117 Johnston Jan 2014 B2
8634248 Sprouse et al. Jan 2014 B1
8694854 Dar et al. Apr 2014 B1
8700842 Dinker Apr 2014 B2
8724789 Altberg et al. May 2014 B2
8775741 de la Iglesia Jul 2014 B1
8788778 Boyle Jul 2014 B1
8832384 de la Iglesia Sep 2014 B1
8849825 McHugh et al. Sep 2014 B1
8874992 Desireddi et al. Oct 2014 B2
8885434 Kumar Nov 2014 B2
8898373 Kang et al. Nov 2014 B1
8909894 Singh et al. Dec 2014 B1
8910030 Goel Dec 2014 B2
8923066 Subramanian et al. Dec 2014 B1
9002805 Barber et al. Apr 2015 B1
9043517 Sprouse et al. May 2015 B1
9052942 Barber et al. Jun 2015 B1
9063946 Barber et al. Jun 2015 B1
9128690 Lotzenburger et al. Sep 2015 B2
9329789 Chu et al. May 2016 B1
9355060 Barber et al. May 2016 B1
9417917 Barber et al. Aug 2016 B1
20010026949 Ogawa et al. Oct 2001 A1
20010050824 Buch Dec 2001 A1
20020024846 Kawahara et al. Feb 2002 A1
20020032891 Yada et al. Mar 2002 A1
20020036515 Eldridge et al. Mar 2002 A1
20020083299 Van Huben et al. Jun 2002 A1
20020099904 Conley Jul 2002 A1
20020116651 Beckert et al. Aug 2002 A1
20020122334 Lee et al. Sep 2002 A1
20020152305 Jackson et al. Oct 2002 A1
20020162075 Talagala et al. Oct 2002 A1
20020165896 Kim Nov 2002 A1
20030041299 Kanazawa et al. Feb 2003 A1
20030043829 Rashid et al. Mar 2003 A1
20030079172 Yamagishi et al. Apr 2003 A1
20030088805 Majni et al. May 2003 A1
20030093628 Matter et al. May 2003 A1
20030163594 Aasheim et al. Aug 2003 A1
20030163629 Conley et al. Aug 2003 A1
20030188045 Jacobson Oct 2003 A1
20030189856 Cho et al. Oct 2003 A1
20030198100 Matsushita et al. Oct 2003 A1
20030204341 Guliani et al. Oct 2003 A1
20030212719 Yasuda et al. Nov 2003 A1
20030225961 Chow et al. Dec 2003 A1
20040024957 Lin et al. Feb 2004 A1
20040024963 Talagala et al. Feb 2004 A1
20040057575 Zhang et al. Mar 2004 A1
20040062157 Kawabe Apr 2004 A1
20040073829 Olarig Apr 2004 A1
20040085849 Myoung et al. May 2004 A1
20040114265 Talbert Jun 2004 A1
20040143710 Walmsley Jul 2004 A1
20040148561 Shen et al. Jul 2004 A1
20040153902 Machado et al. Aug 2004 A1
20040158775 Shibuya et al. Aug 2004 A1
20040167898 Margolus et al. Aug 2004 A1
20040181734 Saliba Sep 2004 A1
20040199714 Estakhri et al. Oct 2004 A1
20040210706 In et al. Oct 2004 A1
20040237018 Riley Nov 2004 A1
20050060456 Shrader et al. Mar 2005 A1
20050060501 Shrader Mar 2005 A1
20050073884 Gonzalez et al. Apr 2005 A1
20050108588 Yuan May 2005 A1
20050114587 Chou et al. May 2005 A1
20050138442 Keller, Jr. et al. Jun 2005 A1
20050144358 Conley et al. Jun 2005 A1
20050144361 Gonzalez et al. Jun 2005 A1
20050144367 Sinclair Jun 2005 A1
20050144516 Gonzalez et al. Jun 2005 A1
20050154825 Fair Jul 2005 A1
20050172065 Keays Aug 2005 A1
20050172207 Radke et al. Aug 2005 A1
20050193161 Lee et al. Sep 2005 A1
20050201148 Chen et al. Sep 2005 A1
20050210348 Totsuka Sep 2005 A1
20050231765 So et al. Oct 2005 A1
20050249013 Janzen et al. Nov 2005 A1
20050251617 Sinclair et al. Nov 2005 A1
20050257120 Gorobets et al. Nov 2005 A1
20050273560 Hulbert et al. Dec 2005 A1
20050281088 Ishidoshiro et al. Dec 2005 A1
20050289314 Adusumilli et al. Dec 2005 A1
20060010174 Nguyen et al. Jan 2006 A1
20060039196 Gorobets et al. Feb 2006 A1
20060039227 Lai et al. Feb 2006 A1
20060053246 Lee Mar 2006 A1
20060062054 Hamilton et al. Mar 2006 A1
20060069932 Oshikawa et al. Mar 2006 A1
20060085671 Majni et al. Apr 2006 A1
20060087893 Nishihara et al. Apr 2006 A1
20060103480 Moon et al. May 2006 A1
20060107181 Dave et al. May 2006 A1
20060136570 Pandya Jun 2006 A1
20060136655 Gorobets et al. Jun 2006 A1
20060136681 Jain et al. Jun 2006 A1
20060156177 Kottapalli et al. Jul 2006 A1
20060184738 Bridges et al. Aug 2006 A1
20060195650 Su et al. Aug 2006 A1
20060209592 Li et al. Sep 2006 A1
20060224841 Terai et al. Oct 2006 A1
20060244049 Yaoi et al. Nov 2006 A1
20060259528 Dussud et al. Nov 2006 A1
20060265568 Burton Nov 2006 A1
20060291301 Ziegelmayer Dec 2006 A1
20070011413 Nonaka et al. Jan 2007 A1
20070033376 Sinclair et al. Feb 2007 A1
20070058446 Hwang et al. Mar 2007 A1
20070061597 Holtzman et al. Mar 2007 A1
20070076479 Kim et al. Apr 2007 A1
20070081408 Kwon et al. Apr 2007 A1
20070083697 Birrell et al. Apr 2007 A1
20070088716 Brumme et al. Apr 2007 A1
20070091677 Lasser et al. Apr 2007 A1
20070101096 Gorobets May 2007 A1
20070106679 Perrin May 2007 A1
20070113019 Beukema et al. May 2007 A1
20070133312 Roohparvar Jun 2007 A1
20070147113 Mokhlesi et al. Jun 2007 A1
20070150790 Gross et al. Jun 2007 A1
20070156842 Vermeulen et al. Jul 2007 A1
20070157064 Falik et al. Jul 2007 A1
20070174579 Shin Jul 2007 A1
20070180188 Fujibayashi et al. Aug 2007 A1
20070180346 Murin Aug 2007 A1
20070191993 Wyatt Aug 2007 A1
20070201274 Yu et al. Aug 2007 A1
20070208901 Purcell et al. Sep 2007 A1
20070234143 Kim Oct 2007 A1
20070245061 Harriman Oct 2007 A1
20070245099 Gray et al. Oct 2007 A1
20070263442 Cornwell et al. Nov 2007 A1
20070268754 Lee et al. Nov 2007 A1
20070277036 Chamberlain et al. Nov 2007 A1
20070279988 Nguyen Dec 2007 A1
20070291556 Kamei Dec 2007 A1
20070294496 Goss et al. Dec 2007 A1
20070300130 Gorobets Dec 2007 A1
20080013390 Zipprich-Rasch Jan 2008 A1
20080019182 Yanagidaira et al. Jan 2008 A1
20080022163 Tanaka et al. Jan 2008 A1
20080028275 Chen et al. Jan 2008 A1
20080043871 Latouche et al. Feb 2008 A1
20080052446 Lasser et al. Feb 2008 A1
20080052451 Pua et al. Feb 2008 A1
20080056005 Aritome Mar 2008 A1
20080059602 Matsuda et al. Mar 2008 A1
20080071971 Kim et al. Mar 2008 A1
20080077841 Gonzalez et al. Mar 2008 A1
20080077937 Shin et al. Mar 2008 A1
20080086677 Yang et al. Apr 2008 A1
20080112226 Mokhlesi May 2008 A1
20080141043 Flynn et al. Jun 2008 A1
20080144371 Yeh et al. Jun 2008 A1
20080147714 Breternitz et al. Jun 2008 A1
20080147964 Chow et al. Jun 2008 A1
20080147998 Jeong Jun 2008 A1
20080148124 Zhang et al. Jun 2008 A1
20080163030 Lee Jul 2008 A1
20080168191 Biran et al. Jul 2008 A1
20080168319 Lee et al. Jul 2008 A1
20080170460 Oh et al. Jul 2008 A1
20080180084 Dougherty et al. Jul 2008 A1
20080209282 Lee et al. Aug 2008 A1
20080229000 Kim Sep 2008 A1
20080229003 Mizushima et al. Sep 2008 A1
20080229176 Arnez et al. Sep 2008 A1
20080270680 Chang Oct 2008 A1
20080282128 Lee et al. Nov 2008 A1
20080285351 Shlick et al. Nov 2008 A1
20080313132 Hao et al. Dec 2008 A1
20080320110 Pathak Dec 2008 A1
20090003046 Nirschl et al. Jan 2009 A1
20090003058 Kang Jan 2009 A1
20090019216 Yamada et al. Jan 2009 A1
20090031083 Willis et al. Jan 2009 A1
20090037652 Yu et al. Feb 2009 A1
20090070608 Kobayashi Mar 2009 A1
20090116283 Ha et al. May 2009 A1
20090125671 Flynn et al. May 2009 A1
20090144598 Yoon et al. Jun 2009 A1
20090158288 Fulton et al. Jun 2009 A1
20090168525 Olbrich et al. Jul 2009 A1
20090172258 Olbrich et al. Jul 2009 A1
20090172259 Prins et al. Jul 2009 A1
20090172260 Olbrich et al. Jul 2009 A1
20090172261 Prins et al. Jul 2009 A1
20090172262 Olbrich et al. Jul 2009 A1
20090172308 Prins et al. Jul 2009 A1
20090172335 Kulkarni et al. Jul 2009 A1
20090172499 Olbrich et al. Jul 2009 A1
20090193058 Reid Jul 2009 A1
20090204823 Giordano et al. Aug 2009 A1
20090207660 Hwang et al. Aug 2009 A1
20090213649 Takahashi et al. Aug 2009 A1
20090222708 Yamaga Sep 2009 A1
20090228761 Perlmutter et al. Sep 2009 A1
20090235128 Eun et al. Sep 2009 A1
20090249160 Gao et al. Oct 2009 A1
20090251962 Yun et al. Oct 2009 A1
20090268521 Ueno et al. Oct 2009 A1
20090292972 Seol et al. Nov 2009 A1
20090296466 Kim et al. Dec 2009 A1
20090296486 Kim et al. Dec 2009 A1
20090310422 Edahiro et al. Dec 2009 A1
20090319864 Shrader Dec 2009 A1
20100002506 Cho et al. Jan 2010 A1
20100008175 Sweere et al. Jan 2010 A1
20100011261 Cagno et al. Jan 2010 A1
20100020620 Kim et al. Jan 2010 A1
20100037012 Yano et al. Feb 2010 A1
20100054034 Furuta et al. Mar 2010 A1
20100061151 Miwa et al. Mar 2010 A1
20100091535 Sommer et al. Apr 2010 A1
20100103737 Park Apr 2010 A1
20100110798 Hoei et al. May 2010 A1
20100115206 de la Iglesia et al. May 2010 A1
20100118608 Song et al. May 2010 A1
20100138592 Cheon Jun 2010 A1
20100153616 Garratt Jun 2010 A1
20100161936 Royer et al. Jun 2010 A1
20100174959 No et al. Jul 2010 A1
20100185807 Meng et al. Jul 2010 A1
20100199027 Pucheral et al. Aug 2010 A1
20100199125 Reche Aug 2010 A1
20100199138 Rho Aug 2010 A1
20100202196 Lee et al. Aug 2010 A1
20100202239 Moshayedi et al. Aug 2010 A1
20100208521 Kim et al. Aug 2010 A1
20100257379 Wang et al. Oct 2010 A1
20100262889 Bains Oct 2010 A1
20100281207 Miller et al. Nov 2010 A1
20100281342 Chang et al. Nov 2010 A1
20100306222 Freedman et al. Dec 2010 A1
20100332858 Trantham et al. Dec 2010 A1
20100332863 Johnston Dec 2010 A1
20110010514 Benhase et al. Jan 2011 A1
20110022779 Lund et al. Jan 2011 A1
20110022819 Post et al. Jan 2011 A1
20110051513 Shen et al. Mar 2011 A1
20110066597 Mashtizadeh et al. Mar 2011 A1
20110066806 Chhugani et al. Mar 2011 A1
20110072207 Jin Mar 2011 A1
20110072302 Sartore Mar 2011 A1
20110078407 Lewis Mar 2011 A1
20110078496 Jeddeloh Mar 2011 A1
20110083060 Sakurada et al. Apr 2011 A1
20110099460 Dusija et al. Apr 2011 A1
20110113281 Zhang et al. May 2011 A1
20110122691 Sprouse May 2011 A1
20110131444 Buch et al. Jun 2011 A1
20110138260 Savin Jun 2011 A1
20110173378 Filor et al. Jul 2011 A1
20110179249 Hsiao Jul 2011 A1
20110199825 Han et al. Aug 2011 A1
20110205823 Hemink et al. Aug 2011 A1
20110213920 Frost et al. Sep 2011 A1
20110222342 Yoon et al. Sep 2011 A1
20110225346 Goss et al. Sep 2011 A1
20110225347 Goss et al. Sep 2011 A1
20110228601 Olbrich et al. Sep 2011 A1
20110231600 Tanaka et al. Sep 2011 A1
20110239077 Bai et al. Sep 2011 A1
20110264843 Haines et al. Oct 2011 A1
20110271040 Kamizono Nov 2011 A1
20110283119 Szu et al. Nov 2011 A1
20110289125 Guthery Nov 2011 A1
20110320733 Sanford et al. Dec 2011 A1
20120011393 Roberts et al. Jan 2012 A1
20120017053 Yang et al. Jan 2012 A1
20120023144 Rub Jan 2012 A1
20120026799 Lee Feb 2012 A1
20120054414 Tsai et al. Mar 2012 A1
20120063234 Shiga et al. Mar 2012 A1
20120072639 Goss et al. Mar 2012 A1
20120096217 Son et al. Apr 2012 A1
20120110250 Sabbag et al. May 2012 A1
20120117317 Sheffler May 2012 A1
20120117397 Kolvick et al. May 2012 A1
20120124273 Goss et al. May 2012 A1
20120131286 Faith et al. May 2012 A1
20120151124 Baek et al. Jun 2012 A1
20120151253 Horn Jun 2012 A1
20120151294 Yoo et al. Jun 2012 A1
20120173797 Shen Jul 2012 A1
20120173826 Takaku Jul 2012 A1
20120185750 Hayami Jul 2012 A1
20120195126 Roohparvar Aug 2012 A1
20120203804 Burka et al. Aug 2012 A1
20120203951 Wood et al. Aug 2012 A1
20120210095 Nellans Aug 2012 A1
20120216079 Fai et al. Aug 2012 A1
20120233391 Frost et al. Sep 2012 A1
20120236658 Byom et al. Sep 2012 A1
20120239858 Melik-Martirosian Sep 2012 A1
20120239868 Ryan et al. Sep 2012 A1
20120239976 Cometti et al. Sep 2012 A1
20120246204 Nalla et al. Sep 2012 A1
20120259863 Bodwin et al. Oct 2012 A1
20120275466 Bhadra et al. Nov 2012 A1
20120278564 Goss et al. Nov 2012 A1
20120284574 Avila et al. Nov 2012 A1
20120284587 Yu et al. Nov 2012 A1
20120297122 Gorobets Nov 2012 A1
20130007073 Varma Jan 2013 A1
20130007343 Rub et al. Jan 2013 A1
20130007381 Palmer Jan 2013 A1
20130007543 Goss et al. Jan 2013 A1
20130024735 Chung et al. Jan 2013 A1
20130031438 Hu et al. Jan 2013 A1
20130036418 Yadappanavar et al. Feb 2013 A1
20130038380 Cordero et al. Feb 2013 A1
20130047045 Hu et al. Feb 2013 A1
20130058145 Yu et al. Mar 2013 A1
20130070527 Sabbag et al. Mar 2013 A1
20130073784 Ng et al. Mar 2013 A1
20130073798 Kang et al. Mar 2013 A1
20130073924 D'Abreu et al. Mar 2013 A1
20130079942 Smola et al. Mar 2013 A1
20130086131 Hunt et al. Apr 2013 A1
20130086132 Hunt et al. Apr 2013 A1
20130094288 Patapoutian et al. Apr 2013 A1
20130103978 Akutsu Apr 2013 A1
20130110891 Ogasawara et al. May 2013 A1
20130111279 Jeon et al. May 2013 A1
20130111298 Seroff et al. May 2013 A1
20130117606 Anholt et al. May 2013 A1
20130121084 Jeon et al. May 2013 A1
20130124792 Melik-Martirosian et al. May 2013 A1
20130124888 Tanaka et al. May 2013 A1
20130128666 Avila et al. May 2013 A1
20130132647 Melik-Martirosian May 2013 A1
20130132652 Wood et al. May 2013 A1
20130159609 Haas et al. Jun 2013 A1
20130176784 Cometti et al. Jul 2013 A1
20130179646 Okubo et al. Jul 2013 A1
20130191601 Peterson et al. Jul 2013 A1
20130194865 Bandic et al. Aug 2013 A1
20130194874 Mu et al. Aug 2013 A1
20130232289 Zhong et al. Sep 2013 A1
20130238576 Binkert et al. Sep 2013 A1
20130254498 Adachi et al. Sep 2013 A1
20130254507 Islam et al. Sep 2013 A1
20130258738 Barkon et al. Oct 2013 A1
20130265838 Li Oct 2013 A1
20130282955 Parker et al. Oct 2013 A1
20130290611 Biederman et al. Oct 2013 A1
20130297613 Yu Nov 2013 A1
20130301373 Tam Nov 2013 A1
20130304980 Nachimuthu et al. Nov 2013 A1
20130314988 Desireddi et al. Nov 2013 A1
20130343131 Wu et al. Dec 2013 A1
20130346672 Sengupta et al. Dec 2013 A1
20140013027 Jannyavula Venkata et al. Jan 2014 A1
20140013188 Wu et al. Jan 2014 A1
20140025864 Zhang et al. Jan 2014 A1
20140032890 Lee et al. Jan 2014 A1
20140063905 Ahn et al. Mar 2014 A1
20140067761 Chakrabarti Mar 2014 A1
20140071761 Sharon et al. Mar 2014 A1
20140075133 Li et al. Mar 2014 A1
20140082261 Cohen et al. Mar 2014 A1
20140082310 Nakajima Mar 2014 A1
20140082456 Li et al. Mar 2014 A1
20140082459 Li et al. Mar 2014 A1
20140095775 Talagala et al. Apr 2014 A1
20140101389 Nellans et al. Apr 2014 A1
20140115238 Xi et al. Apr 2014 A1
20140122818 Hayasaka et al. May 2014 A1
20140122907 Johnston May 2014 A1
20140136762 Li et al. May 2014 A1
20140136883 Cohen May 2014 A1
20140136927 Li et al. May 2014 A1
20140143505 Sim et al. May 2014 A1
20140153333 Avila et al. Jun 2014 A1
20140157065 Ong Jun 2014 A1
20140173224 Fleischer et al. Jun 2014 A1
20140181458 Loh et al. Jun 2014 A1
20140201596 Baum et al. Jul 2014 A1
20140223084 Lee et al. Aug 2014 A1
20140244578 Winkelstraeter Aug 2014 A1
20140258755 Stenfort Sep 2014 A1
20140269090 Flynn et al. Sep 2014 A1
20140279909 Sudarsanam et al. Sep 2014 A1
20140310494 Higgins et al. Oct 2014 A1
20140359044 Davis et al. Dec 2014 A1
20140359381 Takeuchi et al. Dec 2014 A1
20150023097 Khoueir et al. Jan 2015 A1
20150032967 Udayashankar et al. Jan 2015 A1
20150037624 Thompson et al. Feb 2015 A1
20150153799 Lucas et al. Jun 2015 A1
20150153802 Lucas et al. Jun 2015 A1
20150212943 Yang et al. Jul 2015 A1
20150268879 Chu Sep 2015 A1
20150286438 Simionescu et al. Oct 2015 A1
Foreign Referenced Citations (17)
Number Date Country
1 299 800 Apr 2003 EP
1465203 Oct 2004 EP
1 990 921 Nov 2008 EP
2 386 958 Nov 2011 EP
2 620 946 Jul 2013 EP
2002-532806 Oct 2002 JP
WO 2007036834 Apr 2007 WO
WO 2007080586 Jul 2007 WO
WO 2008075292 Jun 2008 WO
WO 2008121553 Oct 2008 WO
WO 2008121577 Oct 2008 WO
WO 2009028281 Mar 2009 WO
WO 2009032945 Mar 2009 WO
WO 2009058140 May 2009 WO
WO 2009084724 Jul 2009 WO
WO 2009134576 Nov 2009 WO
WO 2011024015 Mar 2011 WO
Non-Patent Literature Citations (67)
Entry
Barr, Introduction to Watchdog Timers, Oct. 2001, 3 pgs.
Canim, Buffered Bloom ilters on Solid State Storage, ADMS*10, Singapore, Sep. 13-17, 2010, 8 pgs.
Kang, A Multi-Channel Architecture for High-Performance NAND Flash-Based Storage System, J. Syst. Archit., 53, 9, Sep. 2007, 15 pgs.
Kim, A Space-Efficient Flash Translation Layer for CompactFlash Systems, May 2002, 10 pgs.
Lu, A Forest-structured Bloom Filter with Flash Memory, MSST 2011, Denver, CO, May 23-27, 2011, article, 6 pgs.
Lu, A Forest-structured Bloom Filter with Flash Memory, MSST 2011, Denver, CO, May 23-27, 2011, presentation slides, 25 pgs.
McLean, Information Technology-AT Attachment with Packet Interface Extension, Aug. 19, 1998, 339 pgs.
Park, A High Performance Controller for NAND Flash-Based Solid State Disk (NSSD), Feb. 12-16, 2006, 4 pgs.
Pliant Technology, International Search Report / Written Opinion, PCT/US08/88133, Mar. 19, 2009, 7 pgs.
Pliant Technology, International Search Report / Written Opinion, PCT/US08/88136, Mar. 19, 2009, 7 pgs.
Pliant Technology, International Search Report / Written Opinion, PCT/US08/88146, Feb. 26, 2009, 10 pgs.
Pliant Technology, International Search Report / Written Opinion, PCT/US08/88154, Feb. 27, 2009, 8 pgs.
Pliant Technology, International Search Report / Written Opinion, PCT/US08/88164, Feb. 13, 2009, 6 pgs.
Pliant Technology, International Search Report / Written Opinion, PCT/US08/88206, Feb. 18, 2009, 8 pgs.
Pliant Technology, International Search Report / Written Opinion, PCT/US08/88217, Feb. 19, 2009, 7 pgs.
Pliant Technology, International Search Report / Written Opinion, PCT/US08/88229, Feb. 13, 2009, 7 pgs.
Pliant Technology, International Search Report / Written Opinion, PCT/US08/88232, Feb. 19, 2009, 8 pgs.
Pliant Technology, International Search Report / Written Opinion, PCT/US08/88236, Feb. 19, 2009, 7 pgs.
Pliant Technology, International Search Report / Written Opinion, PCT/US2011/028637, Oct. 27, 2011, 11 pgs.
Pliant Technology, Supplementary ESR, 08866997.3, Feb. 23, 2012, 6 pgs.
SanDisk Enterprise IP LLC, International Search Report / Written Opinion, PCT/US2012/042764, Aug. 31, 2012, 12 pgs.
SanDisk Enterprise IP LLC, International Search Report / Written Opinion, PCT/US2012/042771, Mar. 4, 2013, 14 pgs.
SanDisk Enterprise IP LLC, International Search Report / Written Opinion, PCT/US2012/042775, Sep. 26, 2012, 8 pgs.
SanDisk Enterprise IP LLC, International Search Report / Written Opinion, PCT/US2012/059447, Jun. 6, 2013, 12 pgs.
SanDisk Enterprise IP LLC, International Search Report / Written Opinion, PCT/US2012/059453, Jun. 6, 2013, 12 pgs.
Sandisk Enterprise IP LLC, International Search Report / Written Opinion, PCT/US2012/059459, Feb. 14, 2013, 9 pgs.
SanDisk Enterprise IP LLC, International Search Report / Written Opinion, PCT/US2012/065914, May 23, 2013, 7 pgs.
SanDisk Enterprise IP LLC, International Search Report / Written Opinion, PCT/US2012/065916, Apr. 5, 2013, 7 pgs.
SanDisk Enterprise IP LLC, International Search Report / Written Opinion, PCT/US2012/065919, Jun. 17, 2013, 8 pgs.
SanDisk Enterprise IP LLC, Notification of the Decision to Grant a Patent Right for Patent for Invention, CN 200880127623.8, Jul. 4, 2013, 1 pg.
SanDisk Enterprise IP LLC, Office Action, CN 200880127623.8, Apr. 18, 2012, 12 pgs.
SanDisk Enterprise IP LLC, Office Action, CN 200880127623.8, Dec. 31, 2012, 9 pgs.
SanDisk Enterprise IP LLC, Office Action, JP 2010-540863, Jul. 24, 2012, 3 pgs.
Watchdog Timer and Power Savin Modes, Microchip Technology Inc., 2005, 14 pgs.
Zeidman, 1999 Verilog Designer's Library, 9 pgs.
Ashkenazi et al., “Platform independent overall security architecture in multi-processor system-on-chip integrated circuits for use in mobile phones and handheld devices,” ScienceDirect, Computers and Electrical Engineering 33 (2007), 18 pages.
Lee et al., “A Semi-Preemptive Garbage Collector for Solid State Drives,” Apr. 2011, IEEE, pp. 12-21.
Office Action dated Feb. 17, 2015, received in Chinese Patent Application No. 201210334987.1, which corresponds to U.S. Appl. No. 12/082,207, 9 pages (Prins).
International Search Report and Written Opinion dated May 4, 2015, received in International Patent Application No. PCT/US2014/065987, which corresponds to U.S. Appl. No. 14/135,400, 12 pages (George).
International Search Report and Written Opinion dated Mar. 17, 2015, received in International Patent Application No. PCT/US2014/067467, which corresponds to U.S. Appl. No. 14/135,420, 13 pages (Lucas).
International Search Report and Written Opinion dated Apr. 20, 2015, received in International Patent Application No. PCT/US2014/063949, which corresponds to U.S. Appl. No. 14/135,433, 21 pages (Delpapa).
International Search Report and Written Opinion dated Mar. 9, 2015, received in International Patent Application No. PCT/US2014/059747, which corresponds to U.S. Appl. No. 14/137,440, 9 pages (Fitzpatrick).
Invitation to Pay Additional Fees dated Feb. 13, 2015, received in International Patent Application No. PCT/US2014/063949, which corresponds to U.S. Appl. No. 14/135,433, 6 pages (Delpapa).
International Search Report and Written Opinion dated Jan. 21, 2015, received in International Application No. PCT/US2014/059748, which corresponds to U.S. Appl. No 14/137,511, 13 pages (Dancho).
International Search Report and Written Opinion dated Feb. 18, 2015, received in International Application No. PCT/US2014/066921, which corresponds to U.S. Appl. No. 14/135,260, 13 pages (Fitzpatrick).
Bayer, “Prefix B-Trees”, IP.Com Journal, IP.Com Inc., West Henrietta, NY, Mar. 30, 2007, 29 pages.
Bhattacharjee et al., “Efficient Index Compression in DB2 LUW”, IBM Research Report, Jun. 23, 2009, http://domino.research.ibm.com/library/cyberdig.nsf/papers/40B2C45876D0D747852575E100620CE7/$File/rc24815.pdf, 13 pages.
Oracle, “Oracle9i: Database Concepts”, Jul. 2001, http://docs.oracle.com/cd/A91202—01/901—doc/server.901/a88856.pdf, 49 pages.
International Search Report and Written Opinion dated Jun. 8, 2015, received in International Patent Application No. PCT/US2015/018252, which corresponds to U.S. Appl. No. 14/339,072, 9 pages (Busch).
International Search Report and Written Opinion dated Jun. 2, 2015, received in International Patent Application No. PCT/US2015/018255, which corresponds to U.S. Appl. No. 14/336,967, 14 pages (Chander).
International Search Report and Written Opinion dated Jun. 30, 2015, received in International Patent Application No. PCT/US2015/023927, which corresponds to U.S. Appl. No. 14/454,687, 11 pages (Kadayam).
Office Action dated Dec. 8, 2014, received in Chinese Patent Application No. 201180021660.2, which corresponds to U.S. Appl. No. 12/726,200, 7 pages (Olbrich).
Office Action dated Jul. 31, 2015, received in Chinese Patent Application No. 201180021660.2, which corresponds to U.S. Appl. No. 12/726,200, 9 pages (Olbrich).
International Search Report and Written Opinion dated Jul. 23, 2015, received in International Patent Application No. PCT/US2015/030850, which corresponds to U.S. Appl. No. 14/298,843, 12 pages (Ellis).
International Search Report and Written Opinion dated Sep. 14, 2015, received in International Patent Application No. PCT/US2015/036807, which corresponds to U.S. Appl. No. 14/311,152, 9 pages (Higgins).
Gasior, “Gigabyte's i-Ram storage device, Ram disk without the fuss,” The Tech Report, p. 1, Jan. 25, 2006, 5 pages.
Oestreicher et al., “Object Lifetimes in Java Card,” 1999, USENIX, 10 pages.
International Preliminary Report on Patentability dated May 24, 2016, received in International Patent Application No. PCT/US2014/065987, which corresponds to U.S. Appl. No. 14/135,400, 9 pages (George).
IBM Research—Zurich, “The Fundamental Limit of Flash Random Write Performance: Understanding, Analysis and Performance Modeling,” Mar. 31, 2010, pp. 1-15.
International Search Report and Written Opinion dated Jul. 25, 2014, received in International Patent Application No. PCT/US2014/029453, which corresponds to U.S. Appl. No. 13/963,444, 9 pages (Frayer).
International Search Report and Written Opinion dated Mar. 7, 2014, received in International Patent Application No. PCT/US2013/074772, which corresponds to U.S. Appl. No. 13/831,218, 10 pages (George).
International Search Report and Written Opinion dated Mar. 24, 2014, received in International Patent Application No. PCT/US2013/074777, which corresponds to U.S. Appl. No. 13/831,308, 10 pages (George).
International Search Report and Written Opinion dated Mar. 7, 2014, received in International Patent Application No. PCT/US2013/074779, which corresponds to U.S. Appl. No. 13/831,374, 8 pages (George).
Office Action dated Apr. 25, 2016, received in Chinese Patent Application No. 201280066282.4, which corresponds to U.S. Appl. No. 13/602,047, 8 pages (Tai).
International Preliminary Report on Patentability dated Dec. 6, 2016, received in International Patent Application No. PCT/US2015/030850, which corresponds to U.S. Appl. No. 14/298,843, 8 pages (Ellis).
International Preliminary Report on Patentability dated Dec. 20, 2016, received in International Patent Application No. PCT/US2015/036807, which corresponds to U.S. Appl. No. 14/311,152, 6 pages (Higgins).
Office Action dated Jan. 11, 2017, received in Chinese Patent Application No. 201280066282.4, which corresponds to U.S. Appl. No. 13/602,047, 3 pages (Tai).
Related Publications (1)
Number Date Country
20150142860 A1 May 2015 US
Provisional Applications (1)
Number Date Country
61906406 Nov 2013 US