Abstract: According to an example method, a read request associated with a second data object is received, where the second data object is identifiable by a second object identifier. A second segment index number is determined that would identify a location of the second data object is absent from a metadata index. In response to determining that the second segment index number is absent from the metadata index, an incrementally lower index is selected in the metadata index, where the incrementally lower index is a first segment index number that identifies a location of the first data object. The second data object is retrieved using the first segment index number and a first offset corresponding to the first segment index number.

Abstract: Example storage systems, file system interfaces, and methods provide cache commit timing management for aggregated writes. A system includes a data cache configured to aggregate data requests in buffer segments. A cache manager determines a delay threshold for each buffer based on usage values of the data cache. The cache manager monitors a commit time value, determines when the commit time value satisfies the delay threshold, and moves aggregate data elements from the buffer to persistent storage.

Abstract: A computer-implemented method for translating file system operations to object store operations may include necessary steps to receive a plurality of file system operations for operating files in a file system; determine corresponding objects and object store operations in an object store for the files and the file system operations; determine an order of the object store operations based on time of the file system operations received in the file system; determine dependency of the object store operations, and assign the object store operations to a first queue based on the order and dependency; determine priority of the object store operations, and transfer an entry containing an object store operation with the priority from the first queue to a second queue; and execute the object store operations in parallel and asynchronously based on organization of the object store operations in the first and second queues.

Abstract: According to an example method, a read request associated with a second data object is received, where the second data object is identifiable by a second object identifier. A second segment index number is determined that would identify a location of the second data object is absent from a metadata index. In response to determining that the second segment index number is absent from the metadata index, an incrementally lower index is selected in the metadata index, where the incrementally lower index is a first segment index number that identifies a location of the first data object. The second data object is retrieved using the first segment index number and a first offset corresponding to the first segment index number.

Abstract: An example method may determine if a storage area is an active storage area based on values stored therein. A metadata index is requested from non-volatile storage in a distributed storage system and includes a metadata-stored lane identifier uniquely configured to identify a lane in a storage area of the distributed storage system, and a metadata-stored random number unique to the lane. A lane-stored lane header in the storage area is pointed to by the metadata-stored lane identifier and includes a lane-stored lane identifier, a lane-stored random number, and a lane-stored lane magic value. A metadata-generated lane magic value is generated based on the metadata-stored lane identifier, and the metadata-stored random number in the metadata index. The lane in the storage area of the distributed storage system is identified as an active lane when the metadata-generated lane magic value matches the lane-stored lane magic value.

Abstract: Example distributed storage systems, file system interfaces, and methods provide cache coherence management. A system receives a file data request including a file data reference and identifies a data cache location with a coherence value for the file data reference. The system queries a reference data store for a coherence reference corresponding to the file data reference and compares the coherence value to the coherence reference. In response to the coherence value matching the coherence reference, the system executes the file data request using the data cache location.

Abstract: Example storage systems, file system interfaces, and methods provide cache commit timing management for aggregated writes. A system includes a data cache configured to aggregate data requests in buffer segments. A cache manager determines a delay threshold for each buffer based on usage values of the data cache. The cache manager monitors a commit time value, determines when the commit time value satisfies the delay threshold, and moves aggregate data elements from the buffer to persistent storage.

Abstract: Example distributed storage systems, file system interfaces, and methods provide cache coherence management. A system receives a file data request including a file data reference and identifies a data cache location with a coherence value for the file data reference. The system queries a reference data store for a coherence reference corresponding to the file data reference and compares the coherence value to the coherence reference. In response to the coherence value matching the coherence reference, the system executes the file data request using the data cache location.

Abstract: Various aspects for managing input/output (I/O) operations for data objects (e.g., large data objects (LOBs)), in a storage system are provided. For instance, a method may include receiving an I/O request for executing an I/O operation on a data object, determining the size of the data object, and determining the data object to be a non-conforming data object relative to a storage threshold of a cache memory device. The method may further include dividing the non-conforming data object into multiple data chunks, each of the data chunks having a size that is less than the storage threshold, moving one or more data chunks stored in one or more memory spaces of the cache memory device to a long-term memory device to free up the one or more memory spaces, and storing one or more of the data chunks of the non-conforming data object in the freed-up memory space(s).

Abstract: Various aspects for managing input/output (I/O) operations for data objects (e.g., large data objects (LOBs)), in a storage system are provided. For instance, a method may include receiving an I/O request for executing an I/O operation on a data object, determining the size of the data object, and determining the data object to be a non-conforming data object relative to a storage threshold of a cache memory device. The method may further include dividing the non-conforming data object into multiple data chunks, each of the data chunks having a size that is less than the storage threshold, moving one or more data chunks stored in one or more memory spaces of the cache memory device to a long-term memory device to free up the one or more memory spaces, and storing one or more of the data chunks of the non-conforming data object in the freed-up memory space(s).

Abstract: A computer-implemented method for translating file system operations to object store operations may include necessary steps to receive a plurality of file system operations for operating files in a file system; determine corresponding objects and object store operations in an object store for the files and the file system operations; determine an order of the object store operations based on time of the file system operations received in the file system; determine dependency of the object store operations, and assign the object store operations to a first queue based on the order and dependency; determine priority of the object store operations, and transfer an entry containing an object store operation with the priority from the first queue to a second queue; and execute the object store operations in parallel and asynchronously based on organization of the object store operations in the first and second queues.