Matthew S Benjamin

US Patent:

20120331249, Dec 27, 2012

Filed:

Jun 22, 2012

Appl. No.:

13/530604

Inventors:

Matthew W. Benjamin - Ann Arbor MI, US
Adam C. Emerson - Ann Arbor MI, US
Peter Honeyman - Ann Arbor MI, US

Assignee:

CohortFS, LLC - Ann Arbor MI

International Classification:

G06F 12/16

US Classification:

711162, 711E12103

Abstract:

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.

US Patent:

20120330892, Dec 27, 2012

Filed:

Jun 22, 2012

Appl. No.:

13/530718

Inventors:

Matthew W. Benjamin - Ann Arbor MI, US
Adam C. Emerson - Ann Arbor MI, US
Peter Honeyman - Ann Arbor MI, US

Assignee:

CohortFS, LLC - Ann Arbor MI

International Classification:

G06F 17/30

US Classification:

707622, 707E17005

Abstract:

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.

US Patent:

20200293382, Sep 17, 2020

Filed:

Mar 15, 2019

Appl. No.:

16/354941

Inventors:

- Raleigh NC, US
Casey Taylor Bodley - Ann Arbor MI, US
Matthew William Benjamin - Ann Arbor MI, US
Daniel Francis Gryniewicz - Ann Arbor MI, US

International Classification:

G06F 9/52
G06F 9/48
G06F 16/907

Abstract:

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.

US Patent:

20190354637, Nov 21, 2019

Filed:

May 15, 2018

Appl. No.:

15/980347

Inventors:

- Raleigh NC, US
Adam Charles Emerson - Ann Arbor MI, US
Matthew William Benjamin - Ann Arbor MI, US

International Classification:

G06F 17/30
G06F 17/14
G06F 3/06

Abstract:

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.