Abstract: Systems and techniques are described for identifying test gaps. A described technique includes identifying production code paths for an application. Each production code path specifies a respective sequence of code of the application that was executed in a production environment. Test code paths are identified for the application. Each test code path specifies a respective sequence of code of the application that was tested in a test environment. The production code paths are compared to the test code paths to identify a set of first test gaps for the application. Each first test gap specifies a respective production code path that is not included in the test code paths. Test gap data specifying the first test gaps for the application can be provided for presentation to a user.

Abstract: Systems, computer readable mediums, and techniques are described for converting virtual machine input/output (I/O) requests. One of the techniques includes obtaining access request data for one or more virtual machines (VMs) executing on a physical machine, wherein the access request data characterizes data access requests received from the one or more VMs; classifying, using the access request data, each of the one or more VMs as having either a sequential data access pattern or a random data access pattern;receiving a first I/O request packet from a first VM of the one or more VMs; determining that the first VM has been classified as having a random data access pattern; andsplitting the first I/O request packet into a plurality of second I/O request packets based at least in part on determining that the first VM has been classified as having a random data access pattern.

Abstract: A mechanism is provided in a data processing system for replicating writing of a file with striping. The mechanism writes a file at an owner node within a plurality of nodes in a data processing system. The mechanism divides the file into a plurality of file chunks. The mechanism identifies at least one replication node within the plurality of nodes having a duplicate copy of a respective file chunk within the plurality of file chunks. The mechanism selects a plurality of replication nodes for the plurality of file chunks based on identification at least one replication node within the plurality of nodes having a duplicate copy of a respective file chunk and replicates the file at the plurality of replication nodes based on the selection of the plurality of replication nodes.

Abstract: Embodiments disclosed herein provide systems, methods, and computer readable media for on-the-fly deduplication during movement of NoSQL data. In a particular embodiment, a method provides identifying first data items from files in a NoSQL data store and identifying duplicate data items from the first data items. The method further provides deduplicating and repackaging each of the duplicate data items into respective deduplicated data units and transferring the deduplicated data units to a secondary data repository.

Abstract: A method for managing storage allocation includes adaptively determining, by a storage device processor, a region width across disk spaces for a group of storage devices that is inversely proportional to a number of nodes sharing a particular storage device. An adaptive storage device allocation region of the particular storage device is created based on the determined region width across the disk spaces for the group of storage devices.

Abstract: In one embodiment, a method determines a test case containing test code for testing a functionality of a computer system. The test case is associated with metadata. The metadata is parsed to determine a plurality of system test types and one or more parameters for the plurality of system test types wherein the one or more parameters indicate system conditions for the computer system. The method executes a set of tests using the test code with the computer system using the system conditions. Results of the executed set of tests are output for the plurality of system test types.

Abstract: Embodiments of the invention relate to storage allocation in a storage system. One embodiment includes adaptively determining, by a storage device processor, a region height across disk spaces of a group of storage devices that is proportional to a number of connected storage devices. The storage device processor adaptively determines a region width across the disk spaces for the group of storage devices that is inversely proportional to a number of nodes sharing a particular storage device.

Abstract: A filesystem includes a pool of data blocks and a pool of index blocks. Non-overlapping subpools of data blocks, including a first subpool of data blocks and a second subpool of data blocks, are identified within the pool of data blocks. Likewise, non-overlapping subpools of index blocks, including a first subpool of index blocks and a second subpool of index blocks, are identified within the pool of index blocks. A first file group is mounted within a global namespace on a first mount point on the filesystem. A second file group is also mounted within the global namespace on a second mount point on the filesystem. The first subpool of data blocks and the first subpool of index blocks are allocated to the first mounted file group, and the second subpool of data blocks and the second subpool of index blocks are allocated to the second mounted file group.

Abstract: Embodiments disclosed herein provide systems, methods, and computer readable media for infinite versioning by automatic coalescing. In a particular embodiment, a method provides determining an age range for a plurality of data versions stored in a secondary data repository and identifying first data versions of the plurality of data versions that are within the age range. The method further provides determining a compaction ratio for the first data versions and compacting the first data versions based on the compaction ratio.

Abstract: Embodiments of the present invention relate to a new data center architecture that provides for efficient processing in distributed analytics applications. In one embodiment, a subnode of a distributed processing node is provided. The subnode includes at least one processor core operatively connected to a memory. A first interconnect operatively connects to the subnode. A second interconnect operatively connects the subnode to a storage. The storage includes a first storage unit and a second storage unit. The second storage unit has lower access time and latency than the first storage unit. A storage manager is provided that is operative to allocate data between the first and second storage units based on access patterns. The storage manager preferentially relocates non-sequentially accessed data to the second storage unit from the first storage unit.

Abstract: Embodiments disclosed herein provide systems, methods, and computer readable media for data lineage based multi-data store recovery. In a particular embodiment, a method provides identifying first data in a first table of a plurality of tables stored in a plurality of data stores and restoring the first data to a first correct version of the first data in a prior version of the first table. The method further provides identifying a second table of the plurality of tables that descends from the first table and includes second descendent data that stems from the first data. The method also provides restoring the second descendent data to a second correct version of the second descendent data in a prior version of the second table.

Abstract: A resource management system and method for automatically creating affinity-type rules for resource management in a distributed computer system uses association inference information for at least one resource to determine resource association between resources, which is used to automatically create an affinity-type rule for the resources. The affinity-type rule is considered when executing a resource management operation.

Abstract: Embodiments disclosed herein provide systems, methods, and computer readable media for a converged mechanism for protecting data. In a particular embodiment, a method provides identifying a level of importance for a plurality of data items and tracking changes to the plurality of data items. The method further provides aggregating the changes based on the level of importance and logging the aggregated changes.

Abstract: Embodiments disclosed herein provide systems, methods, and computer readable media for container based application reification. In a particular embodiment, an application reification system is provided including one or more computer readable storage media and a processing system operatively coupled with the one or more computer readable storage media. The application reification system further includes program instructions stored on the one or more computer readable storage media that, when read and executed by the processing system, direct the processing system to preserve a version of application data at a first time and a configuration of an application at the first time. At a second time subsequent to the first time, the program instructions direct the processing system to create a template for a container containing the application in the configuration and a pointer to the version of the application data in a secondary storage repository.

Abstract: A computer implemented method for testing the resiliency of a software application. The computer implemented method can test the resiliency of a software application by monitoring the program state of the software application and trigger a shutdown request when the specified program state has been reached. The shutdown request can be transmitted to the application software and executed to shut down one or more functionalities of the software application. In some examples, the method can specify the functionality to shut down and the program state which the shutdown occurs can be specified in an application configuration file.

Abstract: Embodiments disclosed herein provide systems, methods, and computer readable media to enhance the organization, storage, and retrieval of data. In a particular embodiment, a method provides storing a plurality of incremental data versions in a data repository and maintaining first time information for data items in each of the incremental data versions. The method further provides identifying a first data version of the plurality of incremental data versions and writing data in the data repository to create a second data version based the first data version. The method then provides second time information associated with the creation of the second data and creation of the first data version.

Abstract: Embodiments disclosed herein provide systems, methods, and computer readable storage media for time-based storage and retrieval of data items. In a particular embodiment, a method provides receiving a point-in-time data request. Using metadata associated with data items stored in a secondary data repository, the method provides determining a mapping between the point-in-time data request and one or more of the data items. The method further includes providing the one or more data items in response to the point-in-time data request.

Abstract: In one aspect, a method is provided, including the following method operations: receiving a request to generate a first post data item at a first location; providing for presentation of the first post data item at a second location; receiving a request to generate a second post data item at the second location, the second post data item being in reply to the first post data item; identifying a destination for notification about the second post data item; providing in association with the destination a notification identifying the second post data item, the notification being associated with the first location.

Abstract: A method for storing and recovering data for a file system includes a write process that performs a write instruction for data that includes atomically updating corresponding data blocks and metadata-links on a storage medium. The metadata-links contain links from data blocks to parent metadata blocks and links from metadata blocks to the parent metadata blocks. A journal-less recovery process that detects one or more inconsistencies for file system blocks comprising data blocks or metadata blocks upon a system failure based on one or more comparisons of information for the file system blocks.

Abstract: Embodiments of the present invention relate to a new data center architecture that provides for efficient processing in distributed analytics applications. In one embodiment, a distributed processing node is provided. The node comprises a plurality of subnodes. Each subnode includes at least one processor core operatively connected to a memory. A first interconnect operatively connects each of the plurality of subnodes within the node. A second interconnect operably connects each of the plurality of subnodes to a storage. A process runs on a first of the plurality of subnodes, the process being operative to retrieve data from the memory of the first subnode. The process interrogates the memory of the first subnode for requested data. If the requested data is not found in the memory of the first subnode, the process interrogates the memory of at least one other subnode of the plurality of subnodes via the first interconnect.