G06F2212/21

Flushless transactional layer

Writing data to storage utilizing a diverged thread for asynchronous write operations is provided. On a first thread, an analysis engine analyzes and identifies changed information to write to storage and an I/O manager copies the writes into buffers and places the buffers into a queue, while on a second thread, a flushless transactional layer (FTL) drive executes the writes to storage. By allowing the analysis to continue and enqueue writes on a first thread while the writes are written to storage on a second thread, the CPU and I/O of the system are utilized in parallel. Accordingly, efficiency of the computing device is improved.

Adaptive failure survivability in a storage system utilizing save time and data transfer upon power loss

Maintaining failure survivability in a storage system includes determining a save time corresponding to an amount of time needed to transfer system data from volatile memory to non-volatile memory, determining a threshold corresponding to time for batteries to run while transferring data from volatile memory to non-volatile memory after a power loss, and providing an indication in response to the save time being greater than the threshold. The system may include a plurality of directors and the save time and the threshold may be determined for each of the directors. Determining a threshold may include determining an amount of battery time provided by battery power following power loss and multiplying the amount of battery time by a factor less than one, such as 0.8.

Prioritized random access for magnetic recording

A storage device includes a controller that directs incoming data to a storage location based on a capacity of a region or surface of a magnetic disc. According to one implementation, the storage device controller writes new data to data tracks in a first series of data tracks on the magnetic disc until a capacity condition is satisfied. Once the capacity condition is satisfied, the storage device controller writes new data to a second series of data tracks on the storage medium that are interlaced with data tracks of the first series.

ACCELERATED COMPUTER SYSTEM AND METHOD FOR WRITING DATA INTO DISCRETE PAGES
20170168731 · 2017-06-15 ·

The instant disclosure provides an accelerated computer system and an accelerated method for writing data into discrete pages. The accelerated method includes executing write commands, with each write command including write data and a write address such that the write address corresponds to a write page of the first pages in a block of a hard drive, identifying whether the write pages are successive according to the write addresses, acquiring stored data by reading the block according to the write addresses if the write pages are discrete, writing the data stored in the first pages into the second pages of a memory, writing write data bit by bit into the second pages according to the write addresses, and writing the data stored in the second pages into the first pages.

PRIORITIZED RANDOM ACCESS FOR MAGNETIC RECORDING
20170148484 · 2017-05-25 ·

A storage device includes a controller that directs incoming data to a storage location based on a capacity of a region or surface of a magnetic disc. According to one implementation, the storage device controller writes new data to data tracks in a first series of data tracks on the magnetic disc until a capacity condition is satisfied. Once the capacity condition is satisfied, the storage device controller writes new data to a second series of data tracks on the storage medium that are interlaced with data tracks of the first series.

FLUSHLESS TRANSACTIONAL LAYER

Writing data to storage utilizing a diverged thread for asynchronous write operations is provided. On a first thread, an analysis engine analyzes and identifies changed information to write to storage and an I/O manager copies the writes into buffers and places the buffers into a queue, while on a second thread, a flushless transactional layer (FTL) drive executes the writes to storage. By allowing the analysis to continue and enqueue writes on a first thread while the writes are written to storage on a second thread, the CPU and I/O of the system are utilized in parallel. Accordingly, efficiency of the computing device is improved.

Prioritized random access for magnetic recording

A storage device includes a controller that directs incoming data to a storage location based on a capacity of a region or surface of a magnetic disc. According to one implementation, the storage device controller writes new data to data tracks in a first series of data tracks on the magnetic disc until a capacity condition is satisfied. Once the capacity condition is satisfied, the storage device controller writes new data to a second series of data tracks on the storage medium that are interlaced with data tracks of the first series.

Fullness control for media-based cache operating in a steady state

A data storage system incorporating a write-caching subsystem that implements a steady-state media-based cache is described. The steady-state of the media-based cache can be obtained by directing non-sequential write commands and data received from the host device to multiple independent cache locations and, thereafter, selectively copying or moving such data between the caches so that none of the caches are either too full or too empty. In this manner, a non-sequential write command can be cached in a power-safe manner until it is efficient and/or convenient to write such data to the mainstore portion of the physical media.

Slice-based random access buffer for data interleaving

The disclosure is directed to a system and method for interleaving data utilizing a random access buffer that includes a plurality of independently accessible memory slots. The random access buffer is configured to store slices of incoming data sectors in free memory slots, where a free memory slot is identified by a status flag associated with a logical address of the free memory slot. Meanwhile, a label buffer is configured to store labels associated with the slices of the incoming data sectors in a sequence based upon an interleaving scheme. Media sectors including the interleaved data slices are read out from the memory slots of the random access buffer in order of the sequence of labels stored by the label buffer. As the media sectors are read out of the random access buffer, the corresponding memory slots are freed up for incoming slices of the next super-sector.