Abstract: Embodiments include a computing system, a device, and a method. A computing system includes a processor subsystem having an adjustable operating parameter. The computing system also includes an information store operable to save a sequence of instructions. The computing system further includes a controller module. The controller module includes a monitor circuit for detecting an incidence of an operating-parameter-caused error corresponding to an execution of an instruction of the sequence of instructions by the processor subsystem. The controller further includes a control circuit for adjusting the adjustable operating parameter based upon an error-tolerant performance criterion.

Abstract: A cluster server manages allocation of free blocks to cluster clients performing writes in a clustered file system. The cluster server manages free block allocation with a free block map and an in-flight block map. The free block map is a data structure or hardware structure with data that indicates blocks or extents of the clustered file system that can be allocated to a client for the client to write data. The in-flight block map is a data structure or hardware structure with data that indicates blocks that have been allocated to clients, but remain in-flight. A block remains in-flight until the clustered file system metadata has been updated to reflect a write performed to that block by a client. After a consistency snapshot of the metadata is published to the storage resources, the data at the block will be visible to other nodes of the cluster.

Abstract: Techniques are disclosed that include a computer-implemented method, including storing information related to an initial state of a process upon being initialized, wherein execution of the process includes executing at least one execution phase and upon completion of the executing of the execution phase storing information representative of an end state of the execution phase; aborting execution of the process in response to a predetermined event; and resuming execution of the process from one of the saved initial and end states without needing to shut down the process.

Abstract: Methods and apparatus for use in correcting a data transaction. A data transaction including a plurality of transaction values is received from a data provider. At least a portion of the transaction values is validated. When the validation of at least one transaction value fails, a validation failure notification including a link is provided to a user. When the link is selected, the transaction values are provided via a presentation interface, and erroneous transaction values are distinguished from non-erroneous transaction values. A correction request message including the erroneous transaction values may be generated and sent to a user associated with the data provider. A revised transaction may be received from the data provider and executed to correct the erroneous transaction values.

Abstract: A data file on a storage media is processed during playback or execution to identify unreadable data. Replacement data corresponding to the unreadable data is obtained over a communications network, and the replacement data is used to playback or execute the data file as if the data file does not contain any unreadable data.

Abstract: Systems and methods for transforming a logical data object for storage in a storage device operable with at least one storage protocol, creating, reading, writing, optimization and restoring thereof. Transforming the logical data object comprises creating in the storage device a transformed logical data object comprising one or more allocated storage sections with a predefined size; transforming one or more sequentially obtained chunks of obtained data corresponding to the transforming logical data object; and sequentially storing the processed data chunks into said storage sections in accordance with a receive order of said chunks, wherein said storage sections serve as atomic elements of transformation/de-transformation operations during input/output transactions on the logical data object.

Abstract: Embodiments may recover from faults by forming a new set of rows by removing rows associated with faulting save operations and repeating the saving and forming operations using the new set of rows until a set of rows that can be saved from the known start state without fault is determined. When the subset of successful rows is found, embodiments are able to provide assurance that no side effects (i.e., code or operations triggered by saving of a data to a particular location) have been executed on behalf of any of the failed rows (side effects from custom PL/SOQL code included) by deferring execution of triggers until an entire set of rows can be saved and committed.

Abstract: Embodiments that generate checkpoint images of an application for use as warm standby are contemplated. The embodiments may monitor accesses of external references by threads. An external reference may comprise a connection or use of services of an entity that is external to the set of processes that constitute the application, to which a process of the application attempts to connect by means of a socket or inter-process communication (IPC). Various embodiments comprise two or more computing devices, such as two or more servers. One of the computing devices may generate a checkpoint image of an application at a suitable point in time during initialization, when the state of the application is not yet dependent on interactions with external references. The second computing device may preload checkpoint image for the application and activate the checkpoint images when needed, following the specific resource management rules of the distributed subsystem.

Abstract: Reducing application downtime during failover including identifying a critical line in the startup of an application, the critical line comprising the point in the startup of the application in which the application begins to use dependent resources; checkpointing the application at the critical line of startup; identifying a failure in the application; and restarting the application from the checkpointed application at the critical line.

Abstract: Distributed data, having been stored in a distributed storage system as a collection of distributed data elements, is recovered based on connection of multiple user nodes, each user node having stored selected distributed data elements as a corresponding portion of the distributed data during replication of the distributed data elements throughout the distributed storage system. Each distributed data element is identifiable by a corresponding unique object identifier (OID). Each user node includes a discovery resource for discovering reachable user nodes, a local cache configured for identifying at least the corresponding portion of the distributed data based on the respective OIDs, and an identification service module configured for resolving a data object to a corresponding OID, via the corresponding local cache, or based on sending a query to the reachable user nodes. Hence, user nodes can recover distributed data based on exchanging resolution information and OID information.

Abstract: A method and apparatus for of storing data comprising monitoring a plurality of storage units within a mass storage area and detecting when a storage unit within the mass storage area is overloaded. The method further comprising randomly distributing the data on the overloaded storage unit to the other storage units within the mass storage area.

Abstract: Method, computer program product, and system for transferring data from positional data sources to partitioned databases are provided. A record is read from a positional data source. The record is to be written to one of a plurality of partitions of a database. A position of the record in the positional data source is obtained. A transaction is initiated to write the record to the one partition and to store the position of the record in the database. The transaction is committed after the record is successfully written to the one partition and the position of the record is successfully stored in the database.

Abstract: Serialization is disclosed. It is detected if a component included in a graph of components associated with a user session on a first system has not changed since a prior serialization to a second system. A token is sent to the second system during a current serialization, instead of the component, indicating the component has not changed since the prior serialization. De-serialization is disclosed. a token is received at a first system from a second system, in a stream of serialized data from the second system, that indicates that a component on the second system has not changed since a prior serialization. A cached version of the component is retrieved. The cached copy is used to reconstruct on the second system a state of a user session with which the component is associated on the second system.

Abstract: Techniques are disclosed for creating an application restore point when an application is installed or updated and for restoring the application and other elements of a computing system modified by the installation and update processes to a state as they exist at the application restore point. The application restore point captures information about which files are modified, created, or deleted by the installation and update processes. In one embodiment, a user invokes an installer process to install or update the application. When the installer process modifies or creates a file, an original copy of the file, or a reference to the file is placed into the application restore point. To restore the application, files of the computing system having original copies in the application restore point are replaced with the original copies while all new files referred to in the application restore point are deleted.

Abstract: A method and apparatus for providing an undoable programming language. More specifically the present invention relates to providing a fully undoable programming language, where the language includes a fully undoable core language portion and a conventional language portion. In an embodiment of the present invention, a method of encoding a general-purpose undoable programming language to enable fully undoable instructions includes encoding a fully undoable core imperative language portion having a plurality of undoable core instructions, each of the plurality of undoable core instructions to perform at least one undoable operation upon execution, and the at least one undoable operation being fully undoable until final termination of a program written using any of the plurality of undoable core instructions.

Abstract: A method and device for monitoring functions of a computer system having at least two execution units, a switchover unit being provided, and switchover operations being carried out between at least two operating modes, and a comparison unit being provided, a first operating mode corresponding to a comparison mode and a second operating mode corresponding to a performance mode, and a first function being monitored by a second function, the second function being executed in the comparison mode on at least two execution units, and each of these two second functions, which are executed on at least two execution units, monitoring the same first function.

Abstract: A control logic device performs a local rollback in a parallel super computing system. The super computing system includes at least one cache memory device. The control logic device determines a local rollback interval. The control logic device runs at least one instruction in the local rollback interval. The control logic device evaluates whether an unrecoverable condition occurs while running the at least one instruction during the local rollback interval. The control logic device checks whether an error occurs during the local rollback. The control logic device restarts the local rollback interval if the error occurs and the unrecoverable condition does not occur during the local rollback interval.

Abstract: Illustrated is a system and method for executing a checkpoint scheme as part of processing a workload using an application. The system and method also includes identifying a checkpoint event that requires an additional checkpoint scheme. The system and method includes retrieving checkpoint data associated with the checkpoint event. It also includes building a checkpoint model based upon the checkpoint data. The system and method further includes identifying the additional checkpoint scheme, based upon the checkpoint model, the additional checkpoint scheme to be executed as part of the processing of the workload using the application.

Abstract: A method for replicating a volume of data including selecting a target storage box to receive a physical copy of the actual volume of data stored on the source storage box for replication of the actual volume of data, selecting a point in time storage box to receive a physical copy of actual data stored on the target storage box, physically copying actual data stored on the target storage box to the point in time storage box, performing the replication of the actual volume of data by initiating the physical copying on the target storage box of the actual volume of data, and selectively undoing the physical copying on the target storage box of the actual volume of data by replacing the current actual data stored on the target storage box with the physical copy of actual target storage box data stored on the point in time storage box.

Abstract: A method and apparatus for performing in-memory checkpoint services as a callable resource within a distributed transaction. As such, in-memory checkpoint processes can be utilized by an application as the application would use any resource available to the computer network via a distributed transaction.

Abstract: Transactional memory implementations may be extended to include special transaction communicator objects through which concurrent transactions can communicate. Changes by a first transaction to a communicator may be visible to concurrent transactions before the first transaction commits. Although isolation of transactions may be compromised by such communication, the effects of this compromise may be limited by tracking dependencies among transactions, and preventing any transaction from committing unless every transaction whose changes it has observed also commits. For example, mutually dependent or cyclically dependent transactions may commit or abort together. Transactions that do not communicate with each other may remain isolated. The system may provide a communicator-isolating transaction that ensures isolation even for accesses to communicators, which may be implemented using nesting transactions. True (e.g., read-after-write) dependencies, ordering (e.g.

Abstract: An application reservation and delivery system with capacity pooling including a logical resource pool, an application library, a resource manager, and a deployment manager. The logical resource pool includes computer resource assets which includes asset type, amount, and asset source in which each computer resource asset is decomposed to a specified level of granularity. The application library includes application configurations, each including at least one server configuration and computer resource asset requirements. The resource manager tracks availability of the computer resource assets, receives requests for specific application configurations for specified time periods, compares each requested application configuration with available computer resource assets at the specified time periods, and reserves resources for each requested application configuration during the specified time periods. The deployment manager deploys each requested application configuration using the reserved resources.

Abstract: A method, system, and computer usable program product for accelerating recovery in an MPI environment are provided in the illustrative embodiments. A first portion of a distributed application executes using a first processor and a second portion using a second processor in a distributed computing environment. After a failure of operation of the first portion, the first portion is restored to a checkpoint. A first part of the first portion is distributed to a third processor and a second part to a fourth processor. A computation of the first portion is performed using the first and the second parts in parallel. A first message is computed in the first portion and sent to the second portion, the message having been initially computed after a time of the checkpoint. A second message is replayed from the second portion without computing the second message in the second portion.

Abstract: An approach is provided for migrating data. Data is received from a plurality of source systems. The received data is processed for conversion to a target system. A failure condition associated with the processing is detected. An action is selectively initiated from a point of failure corresponding to the detected failure condition. The action includes either retrying the processing, aborting the processing, initiating simulation of the process, forcing completion of the processing, or a combination thereof.

Abstract: A system and method for restoring a signal test apparatus to a previous state receives a time interval set by a user to create restore point files. The signal test apparatus tests signals of a test object and creates a restore point file according to the time interval. The restore point file stores signal test data of a test object when the restore point file is created. If the signal test apparatus needs to be restored to a previous state, the signal test data of a latest restore point file are acquired. The acquired signal test data are displayed on a display of the signal test apparatus.

Abstract: A method, apparatus, and system of a sequencing technique to account for a clock error in a storage area network are disclosed. In one embodiment, a system of a backup server includes a processing module to examine a data timestamped with a sequence of characters denoting a time according to a clock source, an analysis module to determine that the data has been timestamped at an earlier time than an other data previously received, a substitution module to provide the data an incremental sequence number placed with the data using an algorithm until a new data is received that includes a future timestamp with a later timestamp than the timestamp of the other data, and a storage module to store the data.

Abstract: Directories in a file system are defined with a dummy cluster in a file allocation table as the initial entry. Subsequent clusters in a directory's definition may define any data for the directory that can be changed in a transaction-safe mode. A directory may be modified in a transaction-safe mode by modifying any of the subsequent clusters while tracking changes in a second file allocation table. When the changes have been made to the directory, a pointer to the second file allocation table may be switched to indicate that the second file allocation table is now last known good. The first file allocation table may then be synchronized with the second.

Abstract: A method and apparatus for efficient register checkpointing is herein described. A transaction is detected in program code. A recovery block is inserted in the program code to perform recovery operations in response to an abort of the first transaction. A roll-back edge is potentially inserted from an abort point to the recovery block. A control flow edge is inserted from the recovery block to a entry point of the transaction. Checkpoint code is inserted before the entry point to backup live-in registers in backup storage elements and recovery code is inserted in the recovery block to restore the live-in registers from the backup storage elements in response to an abort of the transaction.

Abstract: A method, apparatus, and computer program product for setting and implementing a policy to compress the history of data on a temporal volume is described.

Abstract: According to the invention, a managing server, using a snapshot-appended information table which stores management information for identifying snapshots of a virtual server, a setting change table which stores setting change information on the virtual server, and a policy table which stores policies to be met by the virtual server, acquires the setting change information from the setting change table, selects the setting change information items from the acquired setting change information matching policies stored in the policy table, acquires management information on the snapshots of the virtual server from the snapshot-appended information table, identifies a snapshot of the virtual server with reference to the acquired management information, changes the identified snapshot of the virtual server based on the selected setting change information items, and rolls back the virtual server according to the changed snapshot.

Abstract: A data management system or “DMS” provides an automated, continuous, real-time, substantially no downtime data protection service to one or more data sources associated with a set of application host servers. To facilitate the data protection service, a host driver embedded in an application server captures real-time data transactions, preferably in the form of an event journal that is provided to other DMS components. The driver functions to translate traditional file/database/block I/O and the like into a continuous, application-aware, output data stream. The host driver includes an event processor. When an authorized user determines that a primary copy of the data in the host server has become incorrect or corrupted, the event processor can perform a recovery operation to an entire data source or a subset of the data source using former point-in-time data in the DMS. The recovery operation may have two phases.

Abstract: A method and system for allowing a rollback within a multi-object system infrastructure are provided. In embodiments, a rollback to a state of a software business object is effected. A sync point manager maintains, for example, a list of sync points and their respective associated identifiers and relationship data. When under sync point protection, i.e., a sync point is set, each subsequent object, when created, is requested to prepare a buffer associated with the specific sync point, so that if an error occurs, a request to rollback to the state associated with the sync point is effectable. Multiple sync points may be kept track of by the sync point manager. In further embodiments, the sync points may be associated with a variety of different types of objects.

Abstract: A storage system maintains a journal and a snapshot of one or more data volumes. Two journal entry types are maintained, an AFTER journal entry and a BEFORE journal entry. Two modes of data recovery are provided: “fast” recovery and “undo-able” recovery. A combination of both recovery modes allows the user to quickly recover a targeted data state.

Abstract: Techniques for device driver management/installation are provided. In at least some embodiments, a device driver management system can be employed by a user to selectively rollback a currently installed device driver to one or a plurality of previously installed device driver(s). Additionally, the system can be employed by the user to revert to a pristine state of not having the device driver installed at all, for example, the NULL driver (e.g., in the situation in which the first driver installed on the device causes machine instability). The system stores information associated with driver(s) running on a specific device and allows a user to selectively revert to any one of a plurality of previously installed device driver(s), for example, if they experience a problem with a newer driver. Rollback point(s) can be stored, for example, in the system registry.

Abstract: A volatile or nonvolatile cache memory can cache mass storage device read data and write data. The cache memory may become inaccessible, and I/O operations may go directly to the mass storage device, bypassing the cache memory. A log of write operations may be maintained to update the cache memory when it becomes available.

Abstract: A method, apparatus, system, and computer program product for an automated modular and secure boot firmware update. An updated boot firmware code module is received in a secure partition of a system, the updated boot firmware code module to replace one original boot firmware code module for the system. Only the one original boot firmware code module is automatically replaced with the updated boot firmware code module. The updated boot firmware code module is automatically executed with the plurality of boot firmware code modules for the system and without user intervention when the system is next booted. The updated boot firmware code module may be written to an update partition of a firmware volume, wherein the update partition of the firmware volume is read along with another partition of the firmware volume containing the plurality of boot firmware code modules when the system is booted.

Abstract: A technique of performing a workflow on a plurality of task servers involves starting a plurality of task server processes on the plurality of task servers. Each task server provides an operating system which is constructed and arranged to locally run a respective task server process. The technique further involves receiving a workflow which includes a set of dependency-related predefined activities, and placing task identifiers in a queue structure based on the received workflow. The task identifiers identify tasks to be performed in a distributed manner by the plurality of task server processes started on the plurality of task servers. Each task is a specific execution of a dependency-related predefined activity of the workflow. Progress in performing the workflow is made as the plurality of task server processes (i) claim task identifiers from the queue structure and (ii) perform the tasks identified by the claimed task identifiers.

Abstract: The present invention relates to a method and arrangements for node recovery particularly suitable for recovery involving large database fragments. The method for node recovery according to the present invention makes use of an old version of a fragment in a failed node (114). The old version is brought up to date by means of scanning an up to date version of the fragment in another node and copying parts of the fragment (117), which have changed since the creation of the old version, to the recovering node. A delete log is utilized in order to take deletions, which have taken place since the creation of the old version, into account in the recovery of the failed node (116). An advantage of the method for node recovery according to the present invention is that it does not require write transactions to be stopped during the recovery process.

Abstract: According to the invention, a managing server, using a snapshot-appended information table which stores management information for identifying snapshots of a virtual server, a setting change table which stores setting change information on the virtual server, and a policy table which stores policies to be met by the virtual server, acquires the setting change information from the setting change table, selects the setting change information items from the acquired setting change information matching policies stored in the policy table, acquires management information on the snapshots of the virtual server from the snapshot-appended information table, identifies a snapshot of the virtual server with reference to the acquired management information, changes the identified snapshot of the virtual server based on the selected setting change information items, and rolls back the virtual server according to the changed snapshot.

Abstract: Error handling in the intermediation of one-way transacted messages. Rather than receiving an inbound message under a transaction, the intermediary performs a non-destructive exclusive read of the message from the source outside of a transaction. Routing logic is applied against the content of the message to determine a collection of message consumers to which a copy of the inbound message is to be sent. Then, under a transaction, the copy of the message is attempted to be sent to each destination. If a send of the copy fails, the transaction is rolled back, but the failure is recorded such that the same transmission mechanism is not, or is less likely to be, tried again in subsequent attempts. The principles may apply to a single message to be sent under the transaction, or to multiple messages to be sent under a single transaction.

Abstract: The present invention introduces methods for controlling and configuring systems using a new command line interface (CLI) command. The CLI command allows a user to set a save point or a restore point of the configuration (e.g., setsavepoint). After the CLI command is executed, the user can continue issuing configuration commands. In addition, if at some point the user wants to go back to the restore point, the user can issue an additional command which generates a CLI script containing all of the commands that need to be executed in order to modify the configuration such that it goes back to its state at the point at which the restore point was set.

Abstract: A thread has a corruption detection mechanism that compares a beginning state of a function with an ending state to determine any inconsistencies. Based on the type of inconsistency, a remedial action may be taken, such as ignoring the inconsistency, cleaning up the inconsistency, and terminating the thread with an exception. The analysis may also include analyzing various states after function execution to find problems such as incomplete transactions. Such a thread may be useful in an operating system as well as a multi-threaded application environment.

Abstract: A recovery method management method includes executing and completing a work on a work target of a system according to a work start command and a work completion command, creating working method information for each work target, acquiring before-work-start system information and after-work-completion system information of the system to create before-and-after-work change information for each work target, storing and managing the working method information and the before-and-after-work change information in a work information managing and storing unit for each work target, creating recovery method information for each similar recovery work target among the work targets on the basis of the working method information, creating before-and-after-recovery change information for each recovery work target on the basis of the before-and-after-work change information, and storing and managing the recovery method information created and the before-and-after-recovery change information created in a recovery method managi

Abstract: A clustered storage array consists of multiple nodes coupled to one or more storage systems. The nodes provide a LUN-device for access by a client. The LUN-device maps to a source logical unit corresponding to areas of storage on the one or more storage systems. A target logical unit corresponds to different areas of storage on the one or more storage systems. The source logical unit is migrated in parallel by the multiple nodes to the target logical unit. Data to be copied from the source logical unit to the target logical unit are grouped into data chunks. Two or more of the plurality of nodes concurrently attempt to acquire an exclusive lock for a set of data chunks. The node acquiring the exclusive lock migrates the set of data chunks from the source logical unit to the target logical unit, while the exclusive lock is used to prevent other nodes from migrating the set of data chunks.

Abstract: An embodiment relates generally to a method of restoring data in storage systems. The method includes providing for a current snapshot of a primary storage system at a secondary storage system and mounting an empty volume in the primary storage system. The method also includes receiving a request for a selected block of data in the primary storage system and retrieving a restore block from the secondary storage system, where the restore block encompasses the selected block of data. The method further includes writing the restore block to the empty volume in the primary storage system as an incremental restore process.

Abstract: A technique for safely rolling back transactional memory transactions without impacting concurrent readers of the uncommitted transaction data. An updater uses a transactional memory technique to perform an data update on data that is shared with a reader. The update is implemented as a transaction in which the updated data is initially uncommitted due to the transaction being subject to roll back. The reader is allowed to perform a data read on the uncommitted data during the transaction. Upon a rollback of the transaction, reclamation of memory locations used by the uncommitted data is deferred until a grace period has elapsed after which the reader can no longer be referencing the uncommitted data.

Abstract: A primary coordinator generates a prepare message for a two-phase commit distributed transaction, the prepare message including an address of a backup coordinator. The primary coordinator maintains a transaction log of the distributed transaction, wherein the transaction log is accessible to both the primary coordinator and the backup coordinator. The prepare message is sent to a plurality of participants. The primary coordinator fails over to the backup coordinator without interrupting the distributed transaction.

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: In one aspect, a method to recover data includes annotating metadata entries in a journal to indicate changes by an application to an object stored in a continuous data protection environment. Each entry of the metadata corresponds to one of a unique group of DO stream data blocks or a unique group of UNDO stream data blocks. The method also includes determining a version of the object that meets criteria by searching the annotated entries and obtaining the version of the object that meets the criteria. In another aspect, a method to recover data includes receiving criteria to recover an object, determining a version of the object that meets the criteria by searching point-in-time images using a DO stream and an UNDO stream and obtaining the version of the object that meets the criteria.

Abstract: The present disclosure is directed toward a method for restoring a computer processor to a previous state. Described is a processor/memory architecture that may store successive instructions/data into a pushdown stack. As instructions are loaded and executed, the loading and executing of new instructions may be suspended. The instruction execution and memory stack then may be restored to a previous processor state in terms of instructions, processor memory state, register values, etc.