Dssd, Inc.

University of California

Varian Medical Systems, Inc.

Todor Ivanov Mollov

Jeffrey S Bonwick

Michael W Shapiro

Steven Swanson

Adrian Caulfield

A method for calculating parity values including calculating a first set of parity values using datum stored in RAID Grid locations in a first PCB, where datum associated with the RAID Grid locations in the first PCB is obtained in a first order that is based on a Hilbert curve. The method further includes calculating a second set of parity values using datum stored in RAID Grid locations in a second PCB, where datum associated with the RAID Grid locations in the second PCB is obtained in a second order that is based on the Hilbert curve. The method further includes storing at least a portion of the first set of parity values and a second set of parity values in a cache, memory, or persistent storage, where each of the first parity values and second parity values is associated with a separate RAID Grid location in the RAID Grid.

Method and system for calculating parity values for multi-dimensional RAID

Method and system for calculating parity values for multi-dimensional raid

Systems and methods of storage device access are provided, where the operating system copies permission and mapping information to the storage array and/or to the application program's memory. The application program can then access the storage device without the operating system's intervention and the storage device will check whether the application has permission to access the data. As a result, in most cases, neither the operating system nor the file system needs to be invoked, and since both of them increase the amount of time required to access the data in the file system, considerable performance improvements are possible.

Method for reducing latency of accessing data stored in a file system on a computer storage device by caching file system permission information in the computer storage device

In general, the invention relates to a method for writing data to server submission queues in a storage controller. The method includes receiving an I/O request, where the I/O request includes a command, where the I/O request is associated with a vSQ, and where the vSQ appears to the client as a set of memory locations in memory operatively connected to a storage controller. The method further includes obtaining a vSQ ID associated with the vSQ, identifying a sSQ based on the vSQ and a vSQ-to-sSQ mapping, generating a submission queue entry comprising the command and the vSQ ID, and sending the submission queue entry to the storage controller, where the sSQ is located in the memory and where the storage controller is configured to place the submission queue entry in the sSQ.

Method and system for submission queue acceleration

Raw data (e.g., image data) can be captured and fed into a data processing unit (e.g., a frame grabber), which can process the raw data using data that is retrieved from, for example, the main memory of a computer system instead of from memory onboard the data processing unit. The processed data can then be stored in the main memory or in another memory location.

Growing community of inventors

Mountain View, CA, United States of America

Todor Ivanov Mollov