Intel Corporation

Pure Storage, Inc.

Richard A Hankins

Hong Wang

Gautham N Chinya

Baiju V Patel

John Thomas Shen

Bryant E Bigbee

Prashant Sethi

Shivnandan D Kaushik

Xiang Chris Zou

Marco Sanvido

James Paul Held

Per H Hammarlund

Mark L McAuliffe

Neil A Vachharajani

Xinmin Tian

Anil Aggarwal

Sanjiv M Shah

John L Reid

Naveen Neelakantam

Jason W Brandt

John P Shen

Trung Am Diep

Ryan N Rakvic

Scott Dion Rodgers

David K Poulsen

Cary A Sandvig

Ed Grochowski

Shiv Kaushik

John Martin Hayes

Hong Jiang

Gad Shlomo Sheaffer

Feng Wang

Taher Vohra

Dion Rodgers

Asit K Mallick

Sergey Zhuravlev

Paul M Petersen

Steve Hodgson

Yuval Yosef

Andrew Kleinerman

Xiaohui Wang

Yoav Talgam

John Colgrove

Ronald S Karr

Edward Thomas Grochowski

Milind Baburao Girkar

Igor Ostrovsky

Christopher Golden

Perry H Wang

Aswin Karumbunathan

Jamison D Collins

Nidhi Pankaj Doshi

Murali M Annavaram

Shirish Aundhe

Abhishek Jain

Victor Yip

Zong Miao

Anil Aggawal

Guei-Yuan Lueh

Koichi Yamada

Wei Ey Li

Ganesh Ramanarayanan

Douglas M Carmean

Gansha Wu

Scott Alexander Smith

Matthew Paul Fay

Zoheb Shivani

James Charles Abel

Bernard Lint

Andrew Kutner

Wentian Cui

Shih-wei Liao

Shao-Ting Chang

Guilherme D Ottoni

Huihui Cheng

Shishir Yadav

HuiHui Cheng

Keshav Sethi Attrey

Mark Alexander Hugh Emberson

Puneet Venkatraman Shenoy

Karthikeyan Srinivasan

Marina Galata

Chiv Kaushik

Millind Girkar

Tian Xinmin

A storage system stores objects in a bucket at a storage device of the storage system. Each of the objects has a corresponding version. A processing device generates a snapshot of the bucket. The snapshot captures the corresponding version of each of the objects at a time associated with the generation of the snapshot.

Bucket versioning snapshots

A method of replication in a distributed storage system, performed by the distributed storage system is provided. The method includes managing a first index for data or metadata in a first storage system, the first storage system having a first partitioning scheme. The method includes managing a second index for data or metadata in a second storage system, the second storage system having a second partitioning scheme. The method includes replicating the data or metadata from the first storage system to the second storage system, translating an identifier of the data or metadata from the first storage system, and mapping the replicated data or metadata into the second partitioning scheme, via the translating of the identifier of the data or metadata from the first storage system.

Data replication in a storage system

A system and method for efficiently maintaining metadata stored among a plurality of solid-state storage devices. A data storage subsystem supports multiple mapping tables. Records within a mapping table are arranged in multiple levels. Each level stores at least pairs of a key value and a physical pointer value. The levels are sorted by time. New records are inserted in a created new highest (youngest) level. No edits are performed in-place. A data storage controller determines both a cost of searching a given table exceeds a threshold and an amount of memory used to flatten levels exceeds a threshold. In response, the controller incrementally flattens selected levels within the table based on key ranges. After flattening the records in the selected levels within the key range, the records may be removed from the selected levels. The process repeats with another different key range.

Metadata management in a storage system

A system and method for efficiently storing data in a storage system. A data storage subsystem includes multiple data storage locations on multiple storage devices in addition to at least one mapping table. A data storage controller determines whether data to store in the storage subsystem has one or more patterns of data intermingled with non-pattern data within an allocated block. Rather than store the one or more pattern on the storage devices, the controller stores information in a header on the storage devices. The information includes at least an offset for the first instance of a pattern, a pattern length, and an identification of the pattern. The data may be reconstructed for a corresponding read request from the information stored in the header.

Reconstructing deduplicated data

Intelligently compressing data in a storage array that includes a plurality of storage devices, including: prioritizing, in dependence upon an expected benefit to be gained from compressing each data element, one or more data elements; receiving an amount of processing resources available for compressing the one or more of the data elements; and selecting, in dependence upon the prioritization of the one or more data elements and the amount of processing resources available for compressing one or more of the data elements, a data compression algorithm to utilize on one or more of the data elements.

Optimizing for data reduction in a storage system

Replication across partitioning schemes in a distributed storage system

A system and method for efficiently starting up a plurality of solid-state storage devices. A computing system includes one or more storage devices storing data in multiple allocation units (AUs). In a boot region, a data storage controller maintains an AU management set that identifies a state of various AUs in the system. In various embodiments, the management set includes an identification of a subset of free AUs, transitional AU, unincorporated AUs, and speculative AUs. At various times, information corresponding to the AU management set is stored to non-volatile storage. During a boot sequence, the AU management set information is accessed and the identified AUs are searched to identify allocated AUs rather than performing a search of all of the AUs in the system.

Optimizing a boot sequence in a storage system

A system and method for efficiently distributing data among multiple storage devices. A data storage array receives read and write requests from multiple client computers. The data storage array includes multiple storage devices, each with multiple allocation units (AUs). A storage controller within the data storage array determines a RAID layout for use in storing data. In response to determining a failure of a first AU, the storage controller begins reconstructing in a second AU the data stored in the first AU. For read and write requests targeting data in the first AU, the request is serviced by the first AU responsive to determining no error occurs when accessing the first AU.

Managing read and write requests targeting a failed storage region in a storage system

Deduplicating patterned data in a storage system

Space reporting in a storage system, including: determining, for one or more system-visible objects in the storage system, an amount of physical space consumed by each system-visible object and an amount of logical space consumed by each system-visible object; identifying, for each of the one or more system-visible objects in the storage system, one or more user-visible objects that reference the system-visible object; determining, for each of the one or more user-visible objects, an amount of physical space consumed by the user-visible object in dependence upon the amount of physical space consumed by each system-visible object referenced by the user-visible object; and determining, for each of the one or more user-visible objects, an amount of logical space consumed by the user-visible object in dependence upon the amount of logical space consumed by each system-visible object referenced by the user-visible object.

Space reporting in a storage system

In an embodiment, a method is provided. The method includes managing user-level threads on a first instruction sequencer in response to executing user-level instructions on a second instruction sequencer that is under control of an application level program. A first user-level thread is run on the second instruction sequencer and contains one or more user level instructions. A first user level instruction has at least 1) a field that makes reference to one or more instruction sequencers or 2) implicitly references with a pointer to code that specifically addresses one or more instruction sequencers when the code is executed.

Mechanism for instruction set based thread execution on a plurality of instruction sequencers

Adaptive computing for data compression

Optimized boot operations within a flash storage array

Managing mapping information in a storage system

Processing read and write requests during reconstruction in a storage system

Growing community of inventors

Santa Clara, CA, United States of America

Richard A Hankins