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: 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.

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: Systems and methods of reducing bandwidth usage of a mobile client are disclosed. An example method may include caching a first version of network content in a mobile client. The method may also include comparing the cached content with a second version of the network content. The method may also include generating a recipe to construct the second version of the network content from the cached network content based on a result of the comparing. The method may also include sending the recipe to the mobile client.

Abstract: Systems and methods for fine-grained sparing in non-volatile memories are disclosed. A system may include a memory having a plurality of blocks, a plurality of tags and a plurality of spared lines, wherein each of the tags corresponds to one of the plurality of spared lines, and table having a plurality of machine addresses, wherein each machine address corresponds to a sparing area for each of the blocks of the plurality of blocks. Methods of operation a fine-grained sparing system are also disclosed.

Abstract: A method for dynamically partitioning a B-tree data structure, includes: determining if the B-tree data structure requires a partition; establishing a midpoint of the B-tree data structure; migrating from a beginning of the B-tree data structure to the midpoint of the B-tree data structure to a first B-tree data structure; migrating from the midpoint of the B-tree data structure to an end of the B-tree data structure to a second B-tree data structure; and allowing normal operations on the B-tree data structure during migration.

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: Example methods and apparatus disclose supporting extended writes to a memory.

Abstract: A multiple level integrated circuit includes a plurality of circuits, which are associated with different levels of the integrated circuit and are adapted to propagate a signal among the circuits. The signal has one of multiple states and the states include a first state that indicates circuit selection. The plurality of circuits are adapted to alter the signal as the signal propagates among the circuits to regulate which circuit of the plurality of circuits responds to the first state.

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.

Abstract: A method for determining priority of recovery for a RAID implementation includes detecting a first failure of the RAID implementation; detecting a second failure of the RAID implementation; assigning a first priority to the first failure and a second priority to the second failure; and setting the priority of the recovery based on the first priority and the second priority.

Abstract: A method for inserting a file in a search tree (B-tree) implemented on a file system, includes: (a) in response to a current node being a root node or an internal node, determining a child node; (b) repeating (a) until a leaf node is detected; (c) in response to a number of leaf nodes at a level of the leaf node exceeding an upper limit of files or a number of child nodes of a current node exceeding an upper limit of sub-directories, balancing the level of the leaf node or child nodes; and (d) inserting the file at the level of the leaf node.

Abstract: A system includes storage media and control logic coupled to the storage media, where the control logic is configured to receive a write request and determine whether the write request specifies writing a predetermined pattern to a particular location of the storage media. In response to determining that the write request specifies writing the predetermined pattern to the particular location, the control logic is configured to identify with an indicator that the particular location contains invalid data.

Abstract: Systems and methods of reducing bandwidth usage of a mobile client are disclosed. An example method may include caching a first version of network content in a mobile client. The method may also include comparing the cached content with a second version of the network content. The method may also include generating a recipe to construct the second version of the network content from the cached network content based on a result of the comparing. The method may also include sending the recipe to the mobile client.

Abstract: Systems and methods of reducing backup bandwidth by remembering downloads to a computing device. An example method may include remembering information for a download to a computing device. The method may also include backing up the computing device to a different system. The information remembered for the download is used to provide a backup of the computing device without copying some of the downloaded data present on the computing device from the computing device.