Daedalus Cloud LLC

Nyriad, Inc.

Real Time Genomics Inc.

Stuart John Inglis

Sheridan John Lambert

Alexander Kingsley St John

Xavier Aldren Simmons

Rafael John Patrick Shuker

Adam Gworn Kit Fleming

Jack Spencer Turpitt

Dmitry Lapik

Timothy Kelly Dawson

Dominic Joseph Michael Houston Azaris

Daniel James Nicholas Stokes

Cameron Ray Simmonds

Matthew Sylvain Lazaro

Tyler Wilson Hale

Pradeep Balakrishnan

Herbert Dennis Hunt

Leon Wiremu Macrae Oud

Chia-Chi Hsu

A method comprising: receiving a request to write data to a persistent storage device; writing the data to a cache line of a cache; pushing the cache line onto the end of a least recently used (LRU) queue of cache lines; and reporting the data as having been written to the persistent storage device.

Cache operation for a persistent storage device

A system and method which allows data to be received into a placement intelligence. After the data is analyzed. the data is written to a persistent storage device. Subsequently. the data may be written. Periodically, self-optimization may occur to improve read speeds or other metrics.

Storage systems and methods for writing data to a persistent storage device

A method comprising: receiving a request to read data stored in an array of drives; determining that the data is stored on one or more degraded drives in the array; reconstructing the data from one or more drives in the array other than the degraded drives; providing the reconstructed data in response to the request; and after providing the reconstructed data, writing the reconstructed data to one or more drives in the array other than the degraded drives.

Read request response for reconstructed data in a degraded drive

A method comprising: receiving, at a vector processor, a request to store data; performing, by the vector processor, one or more transforms on the data; and directly instructing, by the vector processor, one or more storage device to store the data; wherein performing one or more transforms on the data comprises: erasure encoding the data to generate n data fragments configured such that any k of the data fragments are usable to regenerate the data, where k is less than n; and wherein directly instructing one or more storage device to store the data comprises: directly instructing the one or more storage devices to store the plurality of data fragments.

Vector processor storage

A method includes receiving a request to write data at a virtual location, writing the data to a physical location on a persistent storage device, and recording a mapping from the virtual location to the physical location. The physical location corresponds to a next free block in a sequence of blocks on the persistent storage device.

Persistent storage device management

Aspects disclosed herein relate to a method comprising: obtaining a list of data paths to at least one persistent storage device through a plurality of NUMA nodes; associating with each data path, access performance information; receiving a request to access one of the at least one persistent storage device; calculating a preferred data path to the one of the at least one persistent storage device using the access performance information; and accessing the one of the at least one persistent storage device using the preferred data path.

Data access path optimization

Aspects described herein relate to a method comprising: receiving a request to write data to a persistent storage device, the request comprising data; determining an affinity of the data; writing the request to a cache line of a cache; associating the cache line with the affinity of the data; and reporting the data as having been written to the persistent storage device.

Affinity-based cache operation for a persistent storage device

In some examples, there is provided a method for a storage controller to receive a request to write data at a virtual location, writing data at the next free physical location in sequence, writing metadata correlating the virtual location with the physical location at the physical location, and writing a counter at the physical location. The recorded metadata can be used to re-construct the mapping between a given physical location and its corresponding virtual location if the virtual block address is somehow lost. The recorded counter can be used to determine the most recently recorded mapping between the virtual location and physical location, thereby resolving any discrepancies between earlier recorded metadata.

Methods of administering metadata for persistent storage device

A method includes receiving, at a block device interface, an instruction to write data, the instruction comprising a memory location of the data; copying the data to pinned memory; performing, by a vector processor, one or more invertible transforms on the data; and writing the data from the pinned memory to one or more storage devices asynchronously. The pinned memory of the data corresponds to a location in pinned memory, the pinned memory being accessible by the vector processor and one or more other processors.

Block device interface using non-volatile pinned memory

In some embodiments, there is provided a system which allows data to be received into a placement intelligence. After the data is analyzed, the data is written to a persistent storage device. Subsequently, the data may be written. Periodically, self-optimization may occur to improve read speeds or other metrics.

Systems and methods for relocating data in a persistent storage device

A method comprising: receiving a request to write data at a virtual location; writing the data to a physical location on a persistent storage device; and recording a mapping from the virtual location to the physical location; wherein the physical location corresponds to a next free block in a sequence of blocks on the persistent storage device.

Growing community of inventors

Cambridge, New Zealand

Stuart John Inglis