Red Hat, Inc.

Cohort Fs, LLC

Matthew William Benjamin

Adam Charles Emerson

Peter Honeyman

Casey Taylor Bodley

John Eric Ivancich

Brett D Niver

Yuval Lifshitz

Daniel Francis Gryniewicz

Adam C Emerson

A notification configuration associated with an object is received by a first host system from a client device. The notification configuration causes host systems to generate notifications for the client device upon storing the object at the host systems. The object is stored in a first memory of the first host system. The notification configuration is transmitted by the first host system to a second host system. The object is provided to the second host system, wherein the second host system is to transmit a notification to the client device upon storing the object at a second memory of the second host system.

Client driven multi-site consistency for object storage

Efficient distributed indexing of clumpy data is disclosed. For example, a plurality of data stores store a plurality of data objects, where a plurality of data references to each of the plurality of data objects is recorded on a distributed index and an index manager executes a processor to temporarily partition a namespace of the plurality of data references into a plurality of temporary partitions. A respective count of data references in each temporary partition is computed. A trend line approximating a distribution of data references is calculated based on the respective counts. A cumulative representation of the distribution of the respective counts is calculated based on the trend line. The namespace is repartitioned based on the cumulative representation resulting in a repartitioned namespace, where the distributed index is divided into index segments based on the repartitioned namespace.

Efficient distributed indexing of clumpy data

Dynamic distributed work allocation is disclosed. For example, a first work server (WS) stores a first plurality of tasks and a second WS stores a second plurality of tasks. A work client (WC) is configured to send a first lock request (LR) with a first priority value (PV) to the first WS and a second LR with a second PV to the second WS. The WC receives a first lock notice (LN) and a first task from the first WS, and a second LN and a second task from the second WS. Prior to a first lock duration (LD) expiring and completing processing of the first task, the WC sends a third LR to the first WS that extends the first LD. After completing the second task, the WC sends a lock release notice and a fourth LR to the second WS.

Dynamic distributed work allocation

A client computing device having a processor and a memory receives, in response to a request, a replication layout from a replication controller. The client device initiates a data replication request at each of a plurality of data servers according to the replication layout. The client device receives, from each of the data servers, integrity information representing a state of a replication dataset at each of the servers. The client device transmits the integrity information to the replication controller.

Client-based data replication

A command is received to alter data storage in a cluster, along with parameters for executing the command. Information is obtained relating to one or more volumes in the cluster and information relating to devices in the cluster. A formal description of a placement function is generated that maps one or more object identifiers to a storage device set. Placement function code is generated by compiling the formal description of the placement function to computer-executable code.

Growing community of inventors

Ann Arbor, MI, United States of America

Matthew William Benjamin