Abstract: Embodiments of the present invention provide techniques, including systems, methods, and computer readable medium, for dynamic atomic bitsets. A dynamic atomic bitset is a data structure that provides a bitset that can grow or shrink in size as required. The dynamic atomic bitset is non-blocking, wait-free, and thread-safe.

Abstract: While speculatively executing a given one of a plurality of transactions concurrently executing on a computer, carry out write operations in a local data block, and automatically create an entry in a checkpoint log when reading from a shared memory. Continuously conflict check during read and tentative commit operations, and carry out a partial rollback upon detection of a conflict. The partial rollback is based upon the checkpoint log.

Abstract: Embodiments provide methods and apparatuses for detecting errors in a computation using state variables. In various embodiments, corrections of the errors through the state variables are also provided. In various embodiments, the disclosed techniques may be used for power and/or energy minimization/reduction, and debugging, among other goals. Other embodiments and/or applications may be disclosed and/or claimed.

Abstract: A method for generating reference state information, the method includes: comparing between at least one sequence of block identifiers that are accessed during a test period and at least one corresponding reference sequence of block identifiers to provide a comparison result; determining whether to generate reference state information in response to the comparison result; and generating reference state information if determining to generate the reference state information.

Abstract: This invention relates to a method for managing a software application functioning in a multi-computer architecture (cluster). This management is applied, for example, to the analysis or modification of its execution environment, in as transparent a manner as possible vis-à-vis this application. This management is applied to operations of analysis, capture and restoration of the state of one or more processes of the application. These operations use a controller external to the application which carries out an injection of system call instructions inside the working memory of the process(es) to be managed.

Abstract: A method of data loading for large information warehouses includes performing checkpointing concurrently with data loading into an information warehouse, the checkpointing ensuring consistency among multiple tables; and recovering from a failure in the data loading using the checkpointing. A method is also disclosed for performing versioning concurrently with data loading into an information warehouse. The versioning method enables processing undo and redo operations of the data loading between a later version and a previous version. Data load failure recovery is performed without starting a data load from the beginning but rather from a latest checkpoint for data loading at an information warehouse level using a checkpoint process characterized by a state transition diagram having a multiplicity of states; and tracking state transitions among the states using a system state table.

Abstract: A method, computer program product, and data processing system for providing optional exception recovery features in operating system kernel code are disclosed. In a preferred embodiment, a segment of mainline code may designate a recovery routine for that segment by calling a kernel service provided for that purpose. The kernel service pushes the address of the designated recovery routine, context, and re-entry point information corresponding to the segment to a recovery stack. An additional “footprint” region is also allocated on the recovery stack and used to store other state information needed for recovery. A mask value or barrier count value is also stored on the recovery stack to allow recovery to be disabled for non-recoverable routines.

Abstract: A mechanism and method for maintaining a consistent state in a non-volatile random access memory system without constraining normal computer operation is provided, thereby enabling a computer system to recover from faults, power loss, or other computer system failure without a loss of data or processing continuity. In a typical computer system, checkpointing data is either very slow, very inefficient or would not survive a power failure. In embodiments of the present invention, a non-volatile random access memory system is used to capture checkpointed data, and can later be used to rollback the computer system to a previous checkpoint. This structure and protocol can efficiently and quickly enable a computer system to recover from faults, power loss, or other computer system failure.