Abstract: A high performance computing system including processing circuitry and a shared fabric memory is disclosed. The processing circuitry includes processors coupled to local storages. The shared fabric memory includes memory devices and is coupled to the processing circuitry. The shared fabric memory executes a first sweep of a stencil code by sequentially retrieving data stripes. Further, for each retrieved data stripe, a set of values of the retrieved data stripe are updated substantially simultaneously. For each retrieved data stripe, the updated set of values are stored in a free memory gap adjacent to the retrieved data stripe. For each retrieved data stripe, the free memory gap is advanced to an adjacent memory location. A sweep status indicator is incremented from the first sweep to a second sweep.

Abstract: Systems and methods associated with latch-free searching are disclosed. One example method includes receiving a key identifying data to be retrieved from a tree-based data structure. The method also includes performing a concurrent, latch-free search of the tree-based data structure until a leaf node is reached. The method also includes validating the leaf node. The method also includes retreading a portion of the search if the leaf node fails validation.

Abstract: A high performance computing system including processing circuitry and a shared fabric memory is disclosed. The processing circuitry includes processors coupled to local storages. The shared fabric memory includes memory devices and is coupled to the processing circuitry. The shared fabric memory executes a first sweep of a stencil code by sequentially retrieving data stripes. Further, for each retrieved data stripe, a set of values of the retrieved data stripe are updated substantially simultaneously. For each retrieved data stripe, the updated set of values are stored in a free memory gap adjacent to the retrieved data stripe. For each retrieved data stripe, the free memory gap is advanced to an adjacent memory location. A sweep status indicator is incremented from the first sweep to a second sweep.

Abstract: Examples disclosed herein relate to a hierarchical file system. The hierarchical file system may include a first and a second virtual file referencing a stored data set. The first virtual file may include a set of first keys of a first level of specificity, with each key of the set of first keys including a record locator. The second virtual file may include a set of second keys referencing the data set and of a second level of specificity. The set of first keys within the first virtual file is searched in response to a query for data of the data set. A key from the set of second keys is accessed via the record locator from a key from the set of first keys where the data of the data set was not identified by the set of first keys.

Abstract: Examples described herein relate to a memory structure by a user-level process. In an example, a method includes mapping in a read mode, by a kernel, a memory structure and a lock associated with a portion of the memory structure into an address space of a user-level process based on the user-level process being untrusted. The user-level process reads the portion of the memory structure outside of the kernel and determines a state of the lock after the reading of the portion. A write to the portion during the reading of the portion is detected based on the state of the lock.

Abstract: Approaches for structuring a plurality of page images in-memory are described in various examples of the present disclosure. In one example, a unique page identifier provided within a reference page image is identified. The unique page identifier is associated with a target page image stored in-memory. Once identified, the page identifier associated with the target page image is replaced with a location specific identifier of the target page image, wherein the location specific identifier is based on an in-memory location of the target page image.

Abstract: Systems and methods associated with latch-free searching are disclosed. One example method includes receiving a key identifying data to be retrieved from a tree-based data structure. The method also includes performing a concurrent, latch-free search of the tree-based data structure until a leaf node is reached. The method also includes validating the leaf node. The method also includes retreading a portion of the search if the leaf node fails validation.

Abstract: Examples disclosed herein relate to grouping chunks of data into a compression region. Examples relate to a chunk container comprising a first plurality of chunks of data in a plurality of first compression regions, and include grouping a second plurality of the chunks into a second compression region, and compressing the chunks of the second compression region relative to each other.

Abstract: A computer system for controlling access to a shared data structure includes a shared memory coupled to first and second processing units that stores a multi-lock to control access to a shared data structure.