Abstract: Method and system for allowing temporal navigation or time travel of data or data object across time are disclosed. In one embodiment, events that affected data objects are retrieved and inversed to revert the data objects back to a selected point-in-time, forward events are applied to move data objects to forward point-in-time. A sliding bar or a time dial allows a user to move data objects back and forward in time. Events that are applied may be a selected subset of events, altered events, new events, or events generated synthetically or any combinations thereof, for instance, to create counterfactual history.

Abstract: Provided are a method, system, and program for reassigning storage volumes from a failed processing system to a surviving processing system. A first processing system detects a failure of a second processing system. The first processing system determines device groups of storage devices managed by the failed second processing system and determines for each determined device group, hosts that connect to storage devices in the device group. The first processing system sends, for each device group, a unit check to each determined host indicating failure of each device group through one storage device in the device group to which the determined host connects. The determined hosts execute instructions to terminate any I/O operations in progress on the storage devices in the device group in response to the unit check indicating failure of one storage device in the device group and issue, a command to one storage device for the device group to end the busy condition.

Abstract: A computer implemented method, apparatus, and computer program product for managing state data in a workload partitioned environment. Process state data for a process in a workload partition is saved. Process state data is used to restore the process to a given state. State data associated with open sockets and open files bound to the first process is saved. In response to a determination that the process is associated with a domain socket that is bound to a socket file, an absolute pathname for the socket file is saved. A domain socket associated with a connecting process in the workload partition uses the socket file to connect to a domain socket associated with a listening process in the same workload partition to enable the two processes to communicate with each other.

Abstract: A system, method, and computer program product are provided for saving an unprocessed portion of as push buffer in response to an error. In use, operation of hardware is controlled utilizing a push buffer. Furthermore, an error is detected. In response to the error, an unprocessed portion of the push buffer is saved, at least in part.

Abstract: A method for optimizing the use of digital computing resources to achieve reliability and availability of the computing resources is disclosed. The method comprises providing one or more processors with a recovery mechanism, the one or more processors executing one or more applications. A determination is made whether the one or more processors needs to be reconfigured. A rapid recovery is employed to reconfigure the one or more processors when needed. A computing system that provides reconfigurable and recoverable computing resources is also disclosed. The system comprises one or more processors with a recovery mechanism, with the one or more processors configured to execute a first application, and an additional processor configured to execute a second application different than the first application. The additional processor is reconfigurable with rapid recovery such that the additional processor can execute the first application when one of the one more processors fails.

Abstract: A method for running a computer program on computing hardware, in particular on a microprocessor, is described, the computer program including multiple program objects and errors being detected in the method while running the computer program on the computing hardware, the program objects being subdivided into at least two classes and program objects of the first class being repeated when an error is detected and, when an error is detected in one program object of the first class, which has already been sent for execution, this program object of the first class being restarted instead of a program object of the second class.

Abstract: Disaster recovery is performed based on journaling events prioritization in information in an information technology environment. One implementation involves prioritizing log file events for scheduling of jobs on a computing system, by logging events concerning each job execution plan, in a log file, and for disaster recovery, prioritizing logged events based on corresponding job urgency and relevance level and performing recovery by reapplying the events of log files in the priority order such that more urgent and relevant jobs are recovered first.

Abstract: A data reading method includes the steps of: a reading request issuing step of issuing a reading request for reading predetermined stored data; and a reading request re-issuing step of re-issuing a reading request when read data responsive to the reading request has not arrived within a predetermined time period, wherein: in the reading request re-issuing step, a flag is attached to the re-reading request, and thus, the re-reading request is differed from the first issued reading request.

Abstract: An electronic computing device including at least one processing unit that implements a specific fault signal upon experiencing an associated fault, a control unit that generates a specific recovery signal upon receiving the fault signal from the at least one processing unit, and at least one input memory unit. The recovery signal initiates specific recovery processes in the at least one processing unit. The input memory buffers input data signals input to the at least one processing unit that experienced the fault during the recovery period.

Abstract: Various embodiments include fault tolerant memory apparatus, methods, and systems, including an apparatus comprising a memory device including a plurality of addressable memory locations, and a memory manager coupled to the memory device, the memory manager including a scheduling unit operable to detect a multi-bit error in data read from the memory device, and to retry the read operation in order to distinguish between an intermittent error and a persistent error.

Abstract: A method and system of inherited transactions in an asynchronous messaging are provided. A producer requests a message put operation in a transaction. A consumer carries out a get operation with the option to inherit the transaction of the put operation. In an inherited transaction, the consumer's transaction will not commit until the transaction it has inherited from commits. Work performed in the producer's transaction is visible to the consumer, but work performed in the consumer's transaction is not visible to the producer preserving asynchronous messaging semantics. A transaction hierarchy results and only the net effect of transaction hierarchy is hardened to non-volatile storage.

Abstract: A system and method of updating firmware and a method of creating firmware are provided. The system includes a firmware storage module having first firmware and second firmware. The first and second firmware each have image header file data, including a cyclic redundancy checksum (CRC) and an image header file creation time. The method of updating firmware includes determining whether the first and second firmware have an abnormality according to the CRC information. When an abnormality is present in the first or second firmware, the abnormality-stricken firmware is replaced with new firmware. When the abnormality is absent from the first and second firmware, the first firmware is compared with the second firmware in terms of the image header file creation time such that the firmware with the earlier creation time is replaced by the new firmware. Operable firmware is available even if the firmware updating operation fails.

Abstract: Mapping fault processing may be provided. First, user selectable elements may be received defining a process comprising a plurality of activities. Next, code may be produced, based on the received user selectable element, configured to implement the process. Then the code may be executed and an exception may be detected during the code execution. The exception may be scheduled in a queue and one of the following may be performed: handling the exception and compensating for the exception. Handing the exception may comprise undoing one of the plurality of activities that was partially completed and unsuccessful. Compensating for the exception may comprise undoing one of the plurality of activities that was completed.

Abstract: The subject matter disclosed herein provides methods and apparatus, including computer program products for handing transactions. The method may include, for example, processing, at a state correlation engine, a plurality of transactions; saving the effects of at least one of the transactions to a persistence, when the at least one transaction includes a reliable interaction with an external application; saving other transactions to a buffer rather than to the persistence; and reading the at least one transaction from the persistence and continuously executing rules representing the other transactions in response to a failure causing a recovery. Related systems, apparatus, methods, and/or articles are also described.

Abstract: Asynchronous fault handling for a workflow. A state automaton for an activity in the workflow is defined. The state automaton includes at least an executing state, a faulting state, and a closed state and classifies an execution lifetime of the activity. The activity is defined to include work items and includes an execution hierarchy for the work items. Each work item includes an operation for executing a portion of the activity. Each work item is transitioned to the executing state. The included operation of transitioned work items is executed in the executing state. One or more of the transitioned work items are identified in response to the faulting event as a function of the execution hierarchy and the included operation. The faulting event is asynchronously handled by transitioning the one or more identified work items to the faulting state while executing the included operation of the remaining transitioned work items.

Abstract: A method and apparatus are described for a programming language with fully undoable, timed reactive instructions. More specifically, the present invention relates to providing a multi-modal user interface for controlling the execution of fully undoable programs. An embodiment of the present invention includes a method for providing a multi-modal user interface that is enabled to control the order of execution of a program having fully undoable instructions using checkpoints associated with discrete locations within the program.

Abstract: A logging last resource (LLR) system can provide a transaction log and transaction data to a LLR resource after a number of two-phase-commit resources have been prepared. The LLR resource manager can operate on the transaction log and transaction data in an atomic fashion so that the local commit can be done. The local commit can be done by the LLR manager in an atomic manner.

Abstract: Provided are techniques for failover when at least one of a first network adapter and a data path through the first network adapter fails, wherein the first network adapter is connected to a filter driver, and wherein the first network adapter is connected to a second network adapter. With the filter driver, a path fail notification is received that at least one of the first network adapter and the data path through the first network adapter has failed. With the filter driver, packets directed to the first network adapter are rerouted to the second network adapter.

Abstract: A method for executing a computer program on computing hardware, e.g., on a microprocessor, is provided, the computer program including multiple program objects and errors being detected in the method while running the computer program on the computing hardware. The program objects are subdivided into at least two classes, and multiple program objects are executed during one run, program objects of the first class being repeated when an error is detected and, when an error is detected in one program object of the first class, which has already been sent for execution, this program object of the first class is restarted instead of a program object of the second class after the other program objects of the first class of a run.

Abstract: A method for executing a computer program on computing hardware, e.g., on a microprocessor, is provided, the computer program including multiple program objects and errors being detected in this method while the computer program is running on the computing hardware. When an error is detected, at least one program object, which has already been sent for execution, is transferred into a defined state and is restarted from there, and subsequent additional program objects are shifted.

Abstract: A processor predicts predicted slack which is a predicted value of local slack of an instruction to be executed and executes the instruction using the predicted slack. A slack table is referred to upon execution of an instruction to obtain predicted slack of the instruction and execution latency is increased by an amount equivalent to the obtained predicted slack. Then, it is estimated, based on behavior exhibited upon execution of the instruction, whether or not the predicted slack has reached target slack which is an appropriate value of current local slack of the instruction. The predicted slack is gradually increased each time the instruction is executed, until it is estimated that the predicted slack has reached the target slack.

Abstract: Method, apparatus and computer program product for transaction resolution in a system comprising a transaction manager, a plurality of resource managers and a connection distributor for distributing transaction requests from the transaction manager amongst the plurality of resource managers. The transaction manager is allocated a first resource manager via which to conduct its transactions and the first resource manager has a transaction resolution queue associated with it. The system also comprises an asynchronous messaging infrastructure able to transmit messages originating at the transaction manager to the transaction resolution queue. The resource managers may comprise part of the asynchronous messaging infrastructure. Responsive to a failure between the transaction manager and the first resource manager, state data is received from the transaction manager at a second resource manager, the state data being addressed to the transaction resolution queue.

Abstract: A storage controller changes a block size to carry out a shredding process. A data shredder uses a large block size set by a block size setting part to write shredding data in a storage area of a disk drive and erase data stored therein. An error arising during the writing operation of the shredding data is detected by an error detecting part. When the error is detected, the block size setting part sets the block size smaller by one stage than the initial block size to the data shredder. Every time the error arises, the block size used in the shredding process is diminished. Thus, the number of times of writings of the shredding data is reduced as much as possible to improve a processing speed and erase the data of a wide range as much as possible.

Abstract: A method for forward recovery of a catalog of a data storage system, comprising providing a recovery catalog and SMF records. In reverse chronological order, the (i)th entry of the record is checked for a data set change command. If none, the next entry is examined. Otherwise, the (j)th data set is identified and checked for inclusion in the recovery catalog. If it already is, the next entry is selected. If not, a data set location record is added. This process is repeated for each entry in the SMF record. Next, a (h)th data set on the (k)th volume is selected and checked for inclusion in the recovery catalog. If that (h)th data set has been added to the recovery catalog, a next data set is selected. Otherwise, a data set location record for the (h)th data set is added. The process is repeated for each data set on each volume.

Abstract: A method and an apparatus to perform fast log replay have been disclosed. In one embodiment, the method includes preloading a buffer with data based on a catalog in response to a failure of a storage server and replaying a log as the buffer is being preloaded, wherein replaying the log comprises re-executing a set of modifying operations previously logged in a local non-volatile storage device in the storage server using the data preloaded.

Abstract: A method of automated disaster site recovery of a DB2 subsystem is presented. The method reads parameters contained in a user modifiable control dataset of recovery parameters for objects, systems, and applications to be recovered. The method also reads a DB2 system catalog containing recovery requirements. The method then creates recovery jobs based on the control dataset parameters and DB2 system catalog requirements. Control cards are created that will automatically submit the recovery jobs to a CA7 scheduling system via a batch terminal interface such that dependent recovery jobs will not be submitted until their pre-requisite recovery jobs have completed. An installation verification job is created that selects a row from each table being recovered and ensures that the recovery was successful. The control dataset can be updated with new application, object, and system recovery parameters on an as needed basis without affecting the recovery job creation process.

Abstract: A technique capable of constructing a disaster recovery system reduced in performance degradation of a primary system is provided. The technique includes a step of conducting synchronous writing of log information into a secondary storage subsystem in a secondary system when a write request received from a host computer is a write request of log information, a step of temporarily storing a write request and conducting asynchronous writing into the secondary storage subsystem when the received write request is a write request of database data or status information, a step of modifying log information, data in a database area, and status information in the secondary storage subsystem according to contents of a write request received from a primary storage subsystem, and a step of recovering the database area according to contents of log information in a location indicated by the status information.

Abstract: A method maintains a hierarchy of application objects in a computer system. The method includes automatically detecting an exit of a child application object, the exit resulting from a failed process, the child application object launched by a parent application object. A grandchild application object is automatically terminated after the exit of the child application object, the grandchild application object launched by the child application object. Notwithstanding the exit of the child application object, the computer system, which maintains the hierarchy of application objects, the parent application object, and the grandchild application object, remains active.

Abstract: Performing data management operations on replicated data in a computer network. Log entries are generated for data management operations of an application executing on a source system. Consistency point entries are used to indicate a time of a known good, or recoverable, state of the application. A destination system is configured to process a copy of the log and consistency point entries to replicate data in a replication volume, the replicated data being a copy of the application data on the source system. When the replicated data represents a known good state of the application, as determined by the consistency point entries, the destination system(s) may perform a storage operation (e.g., snapshot, backup) to copy the replicated data and to logically associate the copied data with a time information (e.g., time stamp) indicative of the source system time when the application was in the known good state.

Abstract: Methods, apparatus, and products are disclosed for error recovery during execution of an application on a parallel computer that includes a plurality of compute nodes. Such error recovery includes: storing, by the application during execution on the nodes, application restore data in a restore buffer at predetermined points during execution of the application, the restore data specifying an execution state of the application at one or more points during application execution; encountering, by at least one of the nodes executing the application, a recoverable error during application execution; determining, by the application, the nodes affected by the recoverable error; restarting, by each of the affected nodes, execution of the application; retrieving, by the restarted application executing on each of the affected nodes, the restore data from the restore buffer; and continuing, by each affected node, execution of the application with the execution state specified by the retrieved restore data.

Abstract: A DB server included in an old operation node corrects a recovery log stored in a recovery log storage unit by using a difference log stored in a difference log storage unit. A duplication control device and a DBMS compare a difference log file stored in the difference log storage unit and a recovery log file stored in the recovery log storage unit, and correct the content of the recovery log file accordingly.

Abstract: Disclosed is a technique for system recovery. Information identifying one or more work requests is retrieved, along with an order of the work requests, for a business process. If the business process is non-transactional, an in-memory structure is created for the business process, a recovery stub is created for each work request, and the recovery stub for each work request is placed into the in-memory structure based on the order.

Abstract: Techniques for maintaining a cascading index are provided. In one approach, one or more branch node compression techniques are applied to the main index of a cascading index. In an approach, a Bloom filter is generated and associated with, e.g., a branch node in the main index. The Bloom filter is used to determine whether, without accessing any leaf blocks, a particular key value exists, e.g., in leaf blocks associated with the branch node. In an approach, a new redo record is generated in response to a merge operation between two levels of the cascading index. The new redo record comprises (a) one or more addresses of blocks that are affected by the merge operation, (b) data is that being “pushed down” to a lower level of the cascading index, and (c) one or more addresses of blocks that are written to disk storage as a result of the merge operation.

Abstract: One embodiment of the present invention provides a system that reports reasons for failure during transactional execution. During operation, the system transactionally executes a block of instructions in a program. If the transactional execution of the block of instructions completes successfully, the system commits changes made during the transactional execution, and resumes normal non-transactional execution of the program past the block of instructions. Otherwise, if transactional execution of the block of instructions fails, the system discards changes made during the transactional execution, and records failure information indicating why the transactional execution failed.

Abstract: Processing means for assisting computer programs running in a distributed computer system, the processing means including: detection means (530) for detecting that a running program (510) has encountered a problem caused by not having direct access to another piece of code; requisition means (530) for obtaining the other piece of code from another part of the system (550, 560); and means for controlling the computer to re-run the program from a point before the problem was encountered, in such a way that it has the necessary direct access to the other piece of code.

Abstract: Provided is a computer system including a first storage subsystem and a second storage subsystem. The first storage subsystem has a first storage unit and a first control unit. The second storage subsystem has a second storage unit and a second control unit. The first control unit records journals, and identifies, when data stored in the first storage unit is to be migrated to the second storage unit, which ones of the recorded journals are related to the data that is to be migrated. The first control unit chooses the identified journals one at a time in reverse chronological order, and judges whether or not the chosen journal corresponds to a data update made at some point between a current time and a time that precedes the current time by a length of a journal retention term set for the second storage subsystem.

Abstract: Embodiments include a controller apparatus, a computerized apparatus, a device, an apparatus, and a method. A controller-apparatus includes a monitoring circuit for detecting a computational error corresponding to an execution of an instruction of a sequence of instructions by a processor subsystem having an adjustable operating parameter. The controller apparatus also includes a recovery circuit for rolling back an execution of the sequence of instructions to a checkpoint in response to the detected computational error. The controller apparatus further includes a control circuit for adjusting the adjustable operating parameter in response to a performance criterion.

Abstract: A remote copy system includes a first storage system including a first storage controller and a first data volume. The first storage controller is configured to control data access requests to the first data volume. The first storage system is configured to store write data in the first data volume upon receiving a write request from a first host associated with the first storage system and generate a journal including control data and journal data. A second storage system includes a journal volume and configured to receive and store the journal generated by the first storage system in the journal volume. A third storage system includes a second data volume and configured to receive the journal from the second storage system and store the journal data of the journal to the second storage system according to information provided in the control data.

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: The image reading apparatus continuously reads image data of a plurality of pages of a document, each page being added with identification information including specific information of the page and common information showing relationship with at least one precedent and one subsequent pages, that includes an image storage potion for storing image data of each page of the read document, an identification information extracting portion for extracting the identification information from the image data, a missing page detecting portion for detecting a page missed by failure of reading in the document based on identification information of each extracted page, and a display portion for prompting reading of the document by displaying the missing page, in which when an instruction of rereading is given and identification information of the missing page is extracted from image data read again, the image data is additionally stored in the image storage portion.

Abstract: A high availability, high performance software component architecture includes a primary configuration and at least one secondary configuration to take over from the primary configuration in the event of a failure thereof. The primary configuration includes at least one task processing component and a first client component and the secondary configuration includes at least one task processing component and one client component. Status data is present in both configurations and services for write access and read access for the task processing components are separated in such a way that status data read requests coming from the client components are divided between the configurations.

Abstract: A clock synchronizer, for generating a local clock signal synchronized to a received clock signal, is described and claimed, along with a corresponding clock synchronization method. The clock synchronizer incorporates a reference oscillator providing a reference signal, and a synthesizer circuit arranged to synthesize a local clock signal from the reference signal. The synthesizer circuit comprises a phase-locked-loop circuit, including a phase detector receiving the reference signal, and a controllable divider arranged in a feedback path from a controlled oscillator to the phase detector, the divider being controllable to set a frequency division value N along the path to determine a ratio of the local clock frequency to the reference frequency. The clock synchronizer also incorporates a clock comparison circuit adapted to generate a digital signal indicative of an asynchronism between the local and remote clock signals. A control link is arranged to link the clock comparison circuit to the divider.

Abstract: A transaction management engine, such as a business process management (BPM) engine, can allow an application to define transaction demarcations in order to ensure that portions of a workflow are processed atomically. In one such system, a JMS message is queued to the workflow as part of an existing transaction. If that transaction commits, the queued JMS message ensures that the workflow will be invoked in a new transaction that allows the workflow to perform the next unit of work in the newly initiated transaction. When the unit of work is completed, the workflow queues another JMS message. If this transaction commits, the transaction ensures the unit of work has executed in a transaction. When the workflow is invoked again due to the second JMS message, the workflow can continue its operation in a different transaction.

Abstract: A method for running a computer program on computing hardware, in particular on a microprocessor. The computer program includes multiple program objects designed as tasks, for example. Transient and permanent errors are detected during the running of the computer program on the computing hardware. To be able to handle these transient errors constructively when they occur in a computer system in such a way that the functionality and function reliability of the computer system are restored within the shortest possible error tolerance time, at least one program object that has already been sent for execution is set into a defined state on detection of an error and is restarted from this state. The program object is a runtime object of the computer program, for example, also known as a task. One or more tasks that are still being executed or have already been executed on occurrence of an error are restarted and run again.

Abstract: When an event occurs in a storage system that is not recognized by a host, it is not possible to recover data at the point before and after this event. Provided is a storage system including a first storage area storing data to be used by a computer, and a second storage area for storing updated data and its update log information when there is an update request from the computer to the first storage area. This storage system monitors its own storage system and detects an event, and creates a recovery point and its update log information based on the event. When the storage system receives a recovery command at a certain recovery point, it recovers data of the first storage area at the time of recovery point by writing, in a replication storage area at a certain point of the first storage area, update data up to the recovery point among the update data stored in the second 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: Computer implemented method, system and computer usable program code for configuring a computing system. A determination is made whether there are any errors in the model, and responsive to determining that there is at least one error in the model, a determination is made whether there is at least one resolution for correcting the at least one error. Responsive to determining that there is at least one resolution for correcting the at least one error, at least one resolution among the at least one resolution for correcting the at least one error is selected to form at least one selected resolution to correct the at least one error. The at least one selected resolution is applied to the model to form a transformed model, and the transformed model is output to a user.

Abstract: A method, apparatus and program storage device for providing self-quiesced logic for handling an error recovery instruction such as a reset or self-test instruction. For example, during a reset or self test procedure, the logic is isolated without adversely affecting the local processor. Self-quiesced logic processes an error recovery instruction by monitoring the processor interface for an idle condition and withholding access to the local processor. Once the local processor interface has been quiesced and the internal logic paths are idle, the logic will proceed with the reset or self-test.

Abstract: The present invention is a checkpoint processor configured for coupling to individual Web services through a Web services engine. The checkpoint processor can include checkpoint logic programmed to store checkpoint data for the individual Web service instance invocations. The checkpoint processor further can include restart logic programmed to restore the stored checkpoint data to a replacement for failed ones of the individual Web service instance invocations. Finally, the checkpoint processor can include cleanup logic programmed to removed the stored checkpoint data for concluded, non-failed ones of the individual Web service instance invocations. Notably, in a preferred aspect of the invention, logic can be included for identifying an asynchronous correlator for each one of the individual Web service instance invocations and for storing the asynchronous correlator in association with corresponding ones of the stored checkpoint data.

Abstract: A technique capable of constructing a disaster recovery system reduced in performance degradation of a primary system is provided. The technique includes a step of conducting synchronous writing of log information into a secondary storage subsystem in a secondary system when a write request received from a host computer is a write request of log information, a step of temporarily storing a write request and conducting asynchronous writing into the secondary storage subsystem when the received write request is a write request of database data or status information, a step of modifying log information, data in a database area, and status information in the secondary storage subsystem according to contents of a write request received from a primary storage subsystem, and a step of recovering the database area according to contents of log information in a location indicated by the status information.