Amazon Technologies, Inc.

Open Invention Network LLC

Citrix Systems, Inc.

Coho Data Inc.

Andrew Kent Warfield

Jacob Taylor Wires

Seth William Markle

Daniel Stodden

Timothy John Deegan

Keir Fraser

Brendan Anthony Cully

Kevin Jamieson

Munif M Farhan

Geoffrey Lefebvre

Roey Rivnay

Keun Soo Jo

Christopher Clark

Jean Maurice Guy Guyader

Dutch Meyer

James Alexander Bornholt

Marc Stephen Olson

Christopher Magee Greenwood

Ryan F Conroy

Priti Choudhary

William Mark Megarity

Thomas Grant Slatton

Andrew Christopher Schleit

Eric Jason Brandwine

Marc John Brooker

Khawaja Salman Shams

Rebecca Claire Weiss

Brad Eugene Marshall

James Caleb Kirschner

Benjamin Aldouby Schwartz

Leon Thrane

David Alexander Dunlap

Qianyong Yu

Grant B Fresen

Ryan Farris

Valentin Flunkert

Enrico Sartorello

Jonathan S Katz

Mrithyunjaya Kumar Annapragada

Miroslav Miladinovic

Andrew C Schleit

Martine Bruce Wedlake

Rajeev Joshi

Andrew Kutsy

Yu-Ju Huang

Hakan Ferhatosmanoglu

Mohammad Abdul-Amir

Tim Rausch

Joshua John Buergel

Christoph Bartenstein

Jessie E Felix

Mihir Nanavati

A device includes an interposer card that includes a processor, such as a system on a chip (SoC), and memory devices. The interposer card mounts to a mass storage device and has a shape that corresponds to a size of an end of the mass storage device to which the interposer card is mounted. The SoC of the interposer card is configured to implement an individual server for the mass storage device to which the interposer card is mounted. In some embodiments, a data storage system includes multiple mass storage devices mounted in a chassis and coupled to one or more backplanes, wherein interposer cards are connected between the mass storage devices and the one or more backplanes.

Limited blast radius storage server system

An object storage data store may be implemented using storage devices providing multiple extents, where individual ones of the extents include multiple independently addressable, contiguous blocks and where updating an extent is performed by updating the respective independently addressable, contiguous blocks sequentially using a series of write operations. The storage devices may include shingled magnetic recording devices and may include conventional persistent storage devices. The key value data store may implement a superblock structure, index structure, and data store structure using respective portions of the multiple extents, where updates to each of the structures is performed sequentially using a series of write operations. The key value data store may further implement a cache for the index structure to minimize input-output (IO) density of the object storage data store.

Persistent object storage with sequential updates

Systems and methods are provided for generating an index of a set of vectors as a distributed proximity-based graph data structure comprising representative vectors corresponding to subsets of the set of vectors, storing the set of vectors across a plurality of storage devices of a distributed storage system based on the distributed proximity-based graph data structure, and loading, in response to a vector query, a plurality of subsets of the set of vectors from the distributed storage system based on the distributed proximity-based graph data structure.

Scalable graph-based vector storage and search in distributed storage systems

Systems and methods for implementing optimized host-side device-specific queues for a storage device are described. A host system may implement a host-side queue for a storage device that is optimized using device-specific parameters. When an access request to the storage device is received, the request may be enqueued in an order optimized according to parameters of the storage device. Requests are then sent to the device in an optimized order. Optimization parameters may be provided by the manufacturer and read by the host system from the device, the parameters including physical device geometry and runtime telemetry data. In some embodiments, queue ordering for the host-side queue may be supplied by the storage device.

Optimized host-side storage queues

An object storage system includes mass storage devices that implement general storage for objects stored in the object storage system and additionally includes other storage devices, such as solid-state drives, that provide higher performance storage access. The object storage system implements a common access interface for accessing both accelerated access objects (who are eligible to have cached copies stored on the higher performance storage devices) and non-accelerated access objects stored in the general storage. The cache is fully managed by the service and no changes are required for client applications to receive accelerated access to objects that are classified as accelerated access objects per a customer configurable acceleration policy for the object or for a bucket in which the object is stored.

Object storage service with managed cache and common interface for accessing accelerated and non-accelerated access objects

Techniques are described for enabling users to create and configure request-based policies used by a data storage system to generate custom responses to particular types of requests for users' stored data objects. The request-based policies include rules used to identify types of requests for data objects and corresponding types of responses to be generated responsive to detecting such requests. The types of responses that can be specified in such policies include responses other than simply returning a requested data object or denying a request. For example, a rule for certain types of responses can instruct the data storage system to return a dynamically generated data object, another rule can instruct the system to return a different data object than the one requested, and so forth.

User-configurable request-based policies for a data storage system

Systems and methods are provided for handling file operations from a hosted computing instance via a secure compute layer. The secure compute layer is presented to the instance as a virtualized service device that is locally addressable by the instance. Software within the instance can submit file operations to the virtualized service device, which the secure compute layer can translate into calls to a network-accessible storage service. Results from the calls can then be passed back to the instance through the virtualized service device. As a result, the instance can communicate with a variety of different network services, without itself implementing network communications for those services.

Offloading of remote service interactions to virtualized service devices

Systems and methods are provided for management of data access latency in a distributed storage system by dynamically replicating data objects experiencing a high request volume. When a storage node is unable to meet a data access latency target (e.g., due to one or more data objects hosted by the storage node being the subject of a large quantity of requests), the storage node may initiate a process by which a second storage node is employed to reduce the request processing load. The second storage node may cache a copy of the requested data object, and may service at least a portion of requests for the data object using the cached copy.

Data retrieval latency management system

Systems and methods are provided for implementing a multi-service file system for a hosted computing instance via a locally-addressable secure compute layer. Software within the instance can submit file operations to the secure compute layer, which the secure compute layer can translate into calls to one or more network-accessible storage services. To provide a multi-service file system, the secure compute layer can obtain mapping data mapping file system objects within the virtualized file system to different network-accessible storage services. On receiving a file operation, the secure compute layer can determine one or more network-accessible storage services corresponding to the file operation, and submit appropriate calls to the one or more network-accessible storage services. By varying the calls for file operations, various functionalities, such as data backup, write staging, read caching, and failover can be implemented independent of both operation of the hosted computing device and the network-accessible storage services.

Pseudo-local multi-service enabled file systems using a locally-addressable secure compute layer

An object compression system of a storage service may provide a user-friendly and cost-efficient solution to manage stored objects for users of the storage service. The object compression system may automatically monitor individual objects in an object-based storage system of the storage service. Based on one or more characteristics and additional features of the objects, the object compression system may generate respective determinations whether to compress the individual objects. Responsive to determinations to compress the objects, the object compression system may determine compression algorithms for individual objects. The object compression system may compress the objects according to respective compression algorithms to create compressed files. The object compression system may store the compressed files in a tier different from the objects and delete the objects from the storage service.

Storage medium and compression for object stores

Systems and methods are provided for exposing disparate storage systems and technologies to compute instances through a unified file system interface that is agnostic to the underlying storage systems and technologies. A file system namespace service may provide the ability to compose a file system from different storage technologies and systems (e.g., block storage, object storage, etc.). The file system namespace service may also provide the ability to layer different storage services (e.g., by treating local block storage volume as a write back cache, by treating a file system as a read-through cache in front of an object storage service, etc.), and/or the ability to bind virtual files to other compute instances and/or storage systems.

Composable network-storage-based file systems

Technologies are provided for supporting multi-actuator storage device access using logical addresses. Separate sets of storage locations on a storage medium of a storage device can be associated with different actuators of the storage device. For example, a first set of storage locations can be assigned to a first actuator of the storage device and a second set of storage locations can be assigned to a second actuator of the storage device. The storage locations of the storage medium can be associated with logical addresses. The storage device can receive a data access request containing a logical address and can identify a storage location associated with the logical address. The storage device can identify a storage location set to which the storage location belongs and can use an actuator associated with the storage location set to access the storage location associated with the logical address.

Hard disk access using multiple actuators

Technologies are provided for supporting multi-actuator storage device access using logical addresses. Separate sets of logical addresses (such as logical block addresses) can be associated with different actuators of a storage device. For example, a first set of logical addresses can be assigned to storage locations on one or more storage media that is/are accessible using a first actuator of the storage device and a second set of logical addresses can be assigned to storage locations on one or more storage media that is/are accessible using a second actuator of the storage device. The storage device can receive a data access request containing a logical address and can identify a logical address set to which the logical address belongs. The storage device can use an actuator associated with the logical address set to access a storage location assigned to the logical address.

Multi-actuator storage device access using logical addresses

A set of data units associated with a data object is obtained, such that respective instances of the data object can be reconstructed from respective subsets of the set. Corresponding to a request for the data object, a first subset of the set is identified. The first subset meets a uniqueness criterion with respect to other subsets of the set that are used to respond to other requests for the data object. An instance of the data object is reconstructed from the first subset.

Space-efficient techniques for generating unique instances of data objects

Technologies are provided for supporting storage device write barriers. A host computer can be configured to transmit a write barrier command to a storage device to indicate that one or more data access commands should be processed before one or more other data access commands are processed. For example, a host computer can transmit one or more data access commands to a storage device. The host computer can then transmit a write barrier command to the storage device. The storage device can be configured to receive the write barrier command and to associate a write barrier with the one or more data access commands. The host computer can continue to transmit additional data access commands to the storage device. However, the storage device will not process the additional data access commands until after the one or more data access commands associated with the write barrier have been processed.

Storage device write barriers

Growing community of inventors

Vancouver, Canada

Andrew Kent Warfield