Pure Storage, Inc.

Intel Corporation

Shantanu R Gupta

John Colgrove

John Martin Hayes

Brian Gold

John D Davis

Zhangxi Tan

Robert H Lee

Naveen Kumar

Glenn J Hinton

James S Griffith

Igor Ostrovsky

Rusty Sears

Zeev Sperber

Andrew F Glew

Hari Kannan

Ron Gabor

David B Papworth

Michael A Fetterman

Robert P Colwell

Nadav Bonen

Thomas D Fletcher

Joshua Robinson

Vjekoslav Svilan

David N Mackintosh

Jose A Baiocchi Paredes

Narayan Hegde

Petros Maniatis

Steven J Griffith

Franck Sala

Allan Douglas Knies

Sankara Vaideeswaran

Ding Zou

Wing-Yin Chan

Masha Lipshits

Lihu Rappaport

James S Griffth

John Davis

A method for a transactional commit in a storage unit is provided. The method includes receiving a logical record from a storage node into a transaction engine of a storage unit of the storage node and writing the logical record into a data structure of the transaction engine. The method includes writing, to a command queue of the transaction engine, an indication to perform an atomic update using the logical record and transferring each portion of the logical record from the data structure of the transaction engine to non-persistent memory of the storage unit as a committed transaction. A storage unit for a storage system is also provided.

Maintaining coherency in a distributed system

A method of applying an address space to data storage in a non-volatile solid-state storage is provided. The method includes receiving a plurality of portions of user data for storage in the non-volatile solid-state storage and assigning to each successive one of the plurality of portions of user data one of a plurality of sequential, nonrepeating addresses of an address space. The address range of the address space exceeds a maximum number of addresses expected to be applied during a lifespan of the non-volatile solid-state storage. The method includes writing each of the plurality of portions of user data to the non-volatile solid-state storage such that each of the plurality of portions of user data is identified and locatable for reading via the one of the plurality of sequential, nonrepeating addresses of the address space.

Distributed storage system

A method of operating a storage system having solid-state storage memory with segment level heterogeneity is provided. The method includes mapping data into data segments, and mapping the data segments into data stripes. The method includes writing a first data stripe from a first data segment across a first plurality of blades of the storage system comprising heterogeneous total amounts of the solid-state storage memory per blade, and writing a second data stripe from the first data segment across a second plurality of blades of the storage system.

Segment level heterogeneity

A method of applying a data format in a direct memory access transfer is provided. The method includes distributing user data throughout a plurality of storage nodes through erasure coding, wherein the plurality of storage nodes are housed within a single chassis that couples the storage nodes as a cluster, each of the plurality of storage nodes having nonvolatile solid-state memory for user data storage. The method includes reading a self-describing data portion from a first memory of the nonvolatile solid-state memory and extracting a destination from the self-describing data portion. The method includes writing data, from the self-describing data portion, to a second memory of the nonvolatile solid-state memory according to the destination.

Transfer of segmented data

Committed transactions in a storage system

A plurality of storage nodes is provided. Each of the plurality of storage nodes includes nonvolatile solid-state memory for user data storage. The plurality of storage nodes is configured to distribute the user data and metadata associated with the user data throughout the plurality of storage nodes such that the plurality of storage nodes maintain the ability to read the user data, using erasure coding, despite a loss of two of the plurality of storage nodes. The plurality of storage nodes is configured to initiate an action based on the redundant copies of the metadata, responsive to achieving a level of redundancy for the redundant copies of the metadata. A method for accessing user data in a plurality of storage nodes having nonvolatile solid-state memory is also provided.

Action determination based on redundancy level

A non-volatile solid-state storage is provided. The non-volatile solid state storage includes a non-volatile random access memory (NVRAM) addressable by a processor external to the non-volatile solid state storage. The NVRAM is configured to store user data and metadata relating to the user data. The non-volatile solid state storage includes a flash memory addressable by the processor. The flash memory is configured to store the user data responsive to the processor directing transfer of the user data from the NVRAM to the flash memory.

Addressable non-volatile random access memory

Direct memory access data format

Distributed storage addressing

In an embodiment, the present invention includes an execution unit to execute instructions of a first type, a local power gate circuit coupled to the execution unit to power gate the execution unit while a second execution unit is to execute instructions of a second type, and a controller coupled to the local power gate circuit to cause it to power gate the execution unit when an instruction stream does not include the first type of instructions. Other embodiments are described and claimed.

Performing local power gating in a processor

Storage cluster operation using erasure coded data

Mechanism for persisting messages in a storage system

Nonrepeating identifiers in an address space of a non-volatile solid-state storage

Direct memory access data movement

A method of applying scheduling policies is provided. The method includes distributing user data throughout a plurality of storage nodes through erasure coding, wherein the plurality of storage nodes are housed within a single chassis coupling the storage nodes as a cluster. The method includes receiving operations relating to a non-volatile memory of one of the plurality of storage nodes into a plurality of operation queues. The method includes evaluating each of the operations in the plurality of operation queues as to benefit to the non-volatile solid-state storage according to a plurality of policies. For each channel of a plurality of channels coupling the operation queues to the non-volatile memory, the method includes iterating a selection and an execution of a next operation from the plurality of operation queues, with each next operation having a greater benefit than at least a subset of operations remaining in the operation queues.

Scheduling policy for queues in a non-volatile solid-state storage

Growing community of inventors

Beaverton, OR, United States of America

Shantanu R Gupta