Scality, S.a.

Benoit Artuso

Vianney Rancurel

Giorgio Regni

David Pineau

Guillaume Gimenez

Jean-Marc Saffroy

Lam Pham Sy

Alain Tauch

Jonathan Gramain

Bertrand Demiddelaer

Frederic Ferrandis

Mudit Verma

A method is described. The method includes executing a PUT operation for an object including attempting to store the object's data and first protection information into S storage devices and attempting to store second protection information into one or more R additional storage devices. The method includes determining that at least one write attempt into the S storage devices was not successful. The method includes repairing the object's stored state by causing the object's data and first protection information to be stored into the S storage devices.

Extended protection storage system PUT operation

A method is described. The method includes storing data extent replicas for each of a plurality of data extents, wherein, data extent replicas for a same one of the data extents are stored in different physical storage devices, and wherein, a same physical storage device is permitted to store respective data extent replicas of different ones of the data extents. The method includes writing to the respective data extent replicas for at least one of the data extents multiple times without calculating one or more parity extents for the plurality of data extents. The method includes upon a writing activity criteria having been met, calculating one or more parity extents for the data extents and storing the parity extents, and, preserving at least one of the data extent replicas for each of the plurality of data extents.

Erasure coding implementation with reduced parity calculation overhead

A method is described. The method includes performing the following as part of a process for storing an object into an object storage system: assigning chunks of the object to different servers of the object storage system and constructing a graph for the object that describes which of the chunks of the object are being stored in which of the servers; recognizing a stuck condition in which a server with available storage space to store one of the chunks of the object cannot be found; in response to the recognizing, expanding the graph with information from graphs of other objects that are stored in the object storage system to identify other servers in the object storage system to help resolve the stuck condition; processing the expanded graph information to recognize a predefined graphical pattern; applying a predefined solution for the predefined graphical pattern to the expanded graph information to resolve the stuck situation including modifying at least some of the information from the graphs of the other objects; and, moving chunks of one of the other objects affected by the modifying over a network to a new server within the object storage system.

Data placement in large scale object storage system

A method is described that includes providing a snapshot counter for a storage system implemented with multiple distributed consistent database instances. The method further includes recognizing the taking of a snapshot of the storage system by incrementing the snapshot counter from a first snapshot counter value to a second snapshot counter value. The method further includes, in response to a first change for one of the distributed consistent databases subsequent to the taking of the snapshot, performing the following: saving state information of the distributed consistent database as the state information existed prior to the change and associating the first snapshot counter value to the state information. Associating the second snapshot counter's value with the distributed consistent database having the first change. Another method for the taking of a snapshot of a distributed consistent database is also described.

Snapshots and forks of storage systems using distributed consistent databases implemented within an object store

A storage system is described. The storage system includes an object store having a plurality of objects to implement a quota policy or a part of a relational database. The plurality of objects include a first plurality of immutable objects, a second plurality of immutable objects and a head object. The first plurality of immutable objects contain information kept within the database. The second plurality of immutable objects contain a hierarchy of pages for accessing the first plurality of immutable objects. The plurality of objects also include a mutable object that contains a mapping table that maps identifiers of the pages to identifiers of objects of the second plurality of immutable objects. The information is one of: quota policy information; information within a table of a relational database; a stripe of a thin provisioned file.

Distributed consistent database implementation within an object store

An apparatus is described including a large scale distributed storage system. The large scale distributed storage system includes an object store. The large scale distributed storage system includes a plurality of connector nodes coupled to the object store. The connector nodes are to provide access to the object store for respective users that are respectively coupled to the connector nodes. The connector nodes are to provide the following services for the respective users: a snapshot of a storage system implemented within said object store; branching from a snapshot taken of said storage system implemented within said object store; locking of information kept within said storage system implemented within said object store.

Object storage system capable of performing snapshots, branches and locking

A computer implemented method and system for generating secure universal object identifiers on a multipurpose storage system is disclosed. According to one embodiment, a system comprises a client system in communication with a network. An application server is in communication with the network. A storage cluster is in communication with the network. The storage cluster has a plurality of storage nodes. The client system stores a data object via the application server. The application server generates an object identifier assigned to the data object. The application server stores the data object on a storage node of the plurality of storage nodes. The data object is moved to another application server without moving contents of the data object in the storage cluster.

Method for generating universal objects identifiers in distributed multi-purpose storage systems

A method and system having a probabilistic offload engine for distributed hierarchical object storage devices is disclosed. According to one embodiment, a system comprises a first storage system and a second storage system in communication with the first storage system. The first storage system and the second storage system are key/value based object storage devices that store and serve objects. The first storage system and the second storage system execute a probabilistic algorithm to predict access patterns. The first storage system and the second storage system execute a probabilistic algorithm to predict access patterns and minimize data transfers between the first storage system and the second storage system.

Probabilistic offload engine for distributed hierarchical object storage devices

A multipurpose storage system based upon a distributed hashing mechanism with transactional support and failover capability is disclosed. According to one embodiment, a system comprises a client system in communication with a network, a secondary storage system in communication with the network, and a supervisor system in communication with the network. The supervisor system assigns a unique identifier to a first node system and places the first node system in communication with the network in a location computed by using hashing. The client system stores a data object on the first node system.

Growing community of inventors

Chanteloupe les Vignes, France

Benoit Artuso