Novell, Inc.

Cisco Technology, Inc.

Synamedia Limited

Dana Marlow Henriksen

Mel J Oyler

Kevin Wayne Kingdon

Ryan Michael Okelberry

Hoi-Tauw Chou

Clint Earl Ricker

Vandana Shyam Rungta

Various implementations disclosed herein enable managing a resiliency factor of an object stored in an enterprise object storage system. For example, in various implementations, a method of adjusting a realized resiliency factor of an object based on a target resiliency factor for the object is performed by an ingest entity of a storage system that includes a cluster of storage entities. The ingest entity includes a non-transitory computer readable storage medium, and one or more processors. In various implementations, the method includes obtaining a target resiliency factor for an object. In various implementations, the method includes determining whether or not to adjust a realized resiliency factor of the object based on the target resiliency factor. In various implementations, the method includes adjusting the realized resiliency factor of the object to an adjusted resiliency factor in response to determining to adjust the realized resiliency factor.

Adapting resiliency of enterprise object storage systems

A disclosed method is performed at a fault-tolerant object-based storage system including M data storage entities, each is configured to store data on an object-basis. The method includes obtaining a request to store N copies of a data object and in response, storing the N copies of the data object across the M data storage entities, where the N copies are distributed across the M data storage entities. The method additionally includes generating a first parity object for a first subset of M copies of the N copies of the data object, where the first parity object is stored on a first parity storage entity separate from the M data storage entities. The method also includes generating a manifest linking the first parity object with one or more other subsets of M copies of the N copies of the data object.

Method of using common storage of parity data for unique copy recording

Various implementations of hard disk track management method, device, and system disclosed herein enable improvements of file system write bandwidth. In various implementations, a method is performed at a disk storage including a file controller controlling a disk drive with a disk platter that is divided into multiple regions including a fast region. In various implementations, the method includes receiving a write request associated with data to be written to the disk drive and in response, determining a disk utilization of the disk drive. In various implementations, the method further includes placing the disk drive in a surge mode to write the data to the fast region upon determining that the disk utilization is above a first threshold, and placing the disk drive in a non-surge mode to write the data to other regions of the multiple regions upon determining that the disk utilization is below a second threshold.

Method and device for improving file system write bandwidth through hard disk track management

Various implementations disclosed herein provide fault-tolerant enterprise object storage system that can store small objects. In various implementations, the fault-tolerant enterprise object storage system writes a small object into an aggregate object that is distributed across a plurality of storage entities. In some implementations, the small object is at least an order of magnitude smaller than the aggregate object, and the small object is within the same order of magnitude of a block unit addressable within each of the storage entities. In some implementations, based on the small object, the storage system updates the parity data associated with the aggregate object in response to writing the small object into the aggregate object. In various implementations, the storage system updates a processed data end offset indicator that indicates that the parity data for the aggregate object includes valid data up to and including the small object.

Fault-tolerant enterprise object storage system for small objects

Various implementations herein enable managing a resiliency factor of an object stored in an enterprise object storage system. For example, in various implementations, a method of adjusting a realized resiliency factor of an object based on a target resiliency factor for the object is performed by an ingest entity of a storage system that includes a cluster of storage entities. The ingest entity includes a non-transitory computer readable storage medium, and one or more processors. In various implementations, the method includes obtaining a target resiliency factor for an object. In various implementations, the method includes determining whether or not to adjust a realized resiliency factor of the object based on the target resiliency factor. In various implementations, the method includes adjusting the realized resiliency factor of the object to an adjusted resiliency factor in response to determining to adjust the realized resiliency factor.

Various implementations disclosed herein enable writing a number of copies of object data or parity data associated with a data segment to a storage system. For example, in various implementations, a method of writing a number of copies of object data or parity data associated with a data segment is performed by a first storage entity of the storage system. In various implementations, the first storage entity includes a non-transitory computer readable storage medium and one or more processors. In various implementations, the method includes obtaining a data segment from an ingest entity in response to a request to write a number of copies of object data or parity data, determining whether the request is to write object data or parity data, and in response to determining that the request is to write object data, writing the number of copies of object data according to a shared resource utilization threshold.

Writing copies of objects in enterprise object storage systems

A method and system for managing global queues is provided. In one example, a method for implementing a global queue is provided. The queue has a head pointer, a tail pointer, and zero or more elements. The method comprises one or more functions for managing the queue, such as an 'add to end' function, an 'add to front' function, an &#x201c;empty queue&#x201d; function, a &#x201c;remove from front&#x201d; function, a &#x201c;remove specific&#x201d; function and/or a &#x201c;lock queue&#x201d; function. In some examples, the method enables an element to be added to the queue even when the queue is in a locked state.

Method and system for management of global queues utilizing a locked state

A checksum generator includes at least one adding circuit for processing a segment of a given message. Associated with the adding circuit is a register for temporarily holding the partial sum that is being calculated by the adding circuit. The register is configured to hold a partial sum that is larger than the message segments being added by the adding circuit. The partial sums can thus expand into the register, eliminating the creation of a carry bit that must be added back in during each add cycle. After the last message segment has been processed, the adding circuit preferably adds the high order portion of the register to the low order portion and adds back any carry bit generated thereby to produce a checksum value that may be loaded into the given message.

Checksum generator with minimum overflow

A method and apparatus for improving multi-processor performance where the various processors are competing for spinlock acquisition is described. If a spinlock testing processor fails to acquire the spinlock, it re-tries for access after a small wait interval has passed. If the spinlock is still locked, the testing processor retries with an additional increase in the wait interval. Subsequent re-tries progressively increases the wait interval until a maximum wait interval is reached. At this point, the wait interval is reset back to an initial small wait interval and the procedure is repeated until the processor gains access to the spinlock.

Growing community of inventors

Lindon, UT, United States of America

Dana Marlow Henriksen