Amazon Technologies, Inc.

Benjamin Tobler

Anurag Windlass Gupta

Samuel James McKelvie

James McClellan Corey

Pradeep Jnana Madhavarapu

Roland Alexander Paterson-Jones

Christopher Richard Newcombe

Quinton Robin Hoole

Christopher David Brown

Willem Robert Van Biljon

Christopher C Pinkham

Gabriel Smit

Yan Valerie Leshinsky

Laurion Darrell Burchall

Neal Thomas Fachan

Christopher Richard Jacques De Kadt

Raman Mittal

Marc J Brooker

Andrew Bruce Dickinson

Colin John Whittaker

Arijit Ganguly

Roland Paterson-Jones

Christopher J Lefelhocz

Oscar Ricardo Moll Thomae

Faisal M Bhamani

Willem R Van Biljon

Quinton R Hoole

James Mcclellan Corey

Christopher Brown

A database system may include a database service and a separate distributed storage service. The database service (or a database engine head node thereof) may be responsible for query parsing, optimization, and execution, transactionality, and consistency, while the storage service may be responsible for generating data pages from redo log records and for durability of those data pages. For example, in response to a write request directed to a particular data page, the database engine head node may generate a redo log record and send it, but not the data page, to a storage service node. The storage service node may store the redo log record and return a write acknowledgement to the database service prior to applying the redo log record. The server node may apply the redo log record and other redo log records to a previously stored version of the data page to create a current version.

Database system with database engine and separate distributed storage service

Techniques are described for managing communications between multiple intercommunicating computing nodes, such as multiple virtual machine nodes hosted on one or more physical computing machines or systems. In some situations, users may specify groups of computing nodes and optionally associated access policies for use in the managing of the communications for those groups, such as by specifying which source nodes are allowed to transmit data to particular destinations nodes. In addition, determinations of whether initiated data transmissions from source nodes to destination nodes are authorized may be dynamically negotiated for and recorded for later use in automatically authorizing future such data transmissions without negotiation. This abstract is provided to comply with rules requiring an abstract, and it is submitted with the intention that it will not be used to interpret or limit the scope or meaning of the claims.

Network-accessible service for executing virtual machines using client-provided virtual machine images

Techniques are described for managing the execution of programs on multiple computing systems, such as on virtual machine nodes executing on the computing systems. A program execution service may in some situations provide the multiple computing systems and manage the program execution on behalf of multiple customers or other users, including to select appropriate computing systems to execute one or more instances of a program for a user, such as based in part on configuration information specified by the user. The described techniques may further include managing communications between multiple intercommunicating computing nodes in some situations.

A log-structured data store may implement optimized log storage for asynchronous log updates. In some embodiments, log records may be received indicating updates to data stored for a storage client and indicating positions in a log record sequence. The log records themselves may not be guaranteed to be received according to the log record sequence. Received log records may be stored in a hot log portion of a block-based storage device according to an order in which they are received. Log records in the hot log portion may then be identified to be moved to a cold log portion of the block-based storage device in order to complete a next portion of the log record sequence. Log records may be modified, such as compressed, or coalesced, before being stored together in a data block of the cold log portion according to the log record sequence.

Optimized log storage for asynchronous log updates

Managing execution of programs by multiple computing systems

A distributed database system may implement log-structured distributed storage using a single log sequence number space. A log for a data volume may be maintained in a log-structured distributed storage system. The log may be segmented across multiple protection groups according to a partitioning of user data for the data volume. Updates to the log may be assigned a log sequence number from a log sequence number space for the data volume. A protection group may be determined for an update according to which partition of user data space the update pertains. Metadata to be included with the log record may indicate a previous log sequence number of a log record maintained at the protection group. The log record may be sent to the protection group and identified as committed based on acknowledgments received from storage nodes implementing the protection group.

Log-structured distributed storage using a single log sequence number space

A log-structured distributed storage system may implement individual write quorums. Log records may be sent to different storage nodes of a quorum set storing data for a storage client sufficient to satisfy a write quorum requirement. For each log record, acknowledgments from storage nodes are received, and a determination is made whether the write quorum requirement is satisfied for the log record. Different log records may be maintained at different storage nodes, and still satisfy the write quorum requirement such that in some embodiments no one storage node may maintain all of the log records sent to storage nodes in the quorum set.

Individual write quorums for a log-structured distributed storage system

A system for allocating constrained resources (e.g., downstream services, execution threads, database connections, input/output channels, computational resources, and/or memory) to requested services that are dependent on those resources may include multiple resource queues, each of which maintains a queue of requests for a respective constrained resource, and multiple service request queues, from which requests may be subsequently serviced. As each request reaches the head of a resource queue, it may receive a resource token for a respective constrained resource. Once the request has collected resource tokens for each of the constrained resources on which it depends, the request may be passed to a service request queue that maintains a queue of requests of a particular type. Requests in the multiple service request queues may be serviced on a round-robin or weighted round-robin basis. The number of tokens available for each constrained resource may be modified based on observed system performance.

System and method for allocating resources for heterogeneous service requests

Variably-sized data objects may be received for storage at a data store. The data store may have a minimum write size. In various embodiments, received data objects may be divided into one or more equally-sized portions that equal the minimum write size of the data store and a remainder of the data object. The one or more equally-sized portions of the data object may be stored in data blocks that are equivalent to the minimum write size of the data store in a fixed-size data storage area of the data store. The remainder of the data object may be stored in a variably-sized data storage area of the data store along with one or more other data portions in a same data block. The remainder of the data object may, in some embodiments, be linked to the one or more equally-sized portions of the data object.

Efficient storage of variably-sized data objects in a data store

Growing community of inventors

Seattle, WA, United States of America

Benjamin Tobler