An apparatus causes a program loader to load a first program and a second program that is obtained by correcting the first program, into a memory, and causes a linker to load a library used for execution of the second program into the memory. The apparatus writes first data that has been processed at a suspension time at which execution of the first program is suspended, into a first data area for the first program loaded into the memory, and starts execution of the second program from a second position on the second program corresponding to a first position where execution of the first program is suspended.

Embodiments of the present disclosure are directed to dynamic shadow operations configured to dynamically shadow data-plane resources in a network device. In some embodiments, the dynamic resource shadow operations are used to locally maintain a shadow copy of data plane resources to avoid having to read them through a bus interconnect. In other embodiments, the dynamic shadow framework is used to provide memory protection for hardware resources against SEU failures. The dynamic shadow framework may operate in conjunction with adaptive memory scrubbing operations. In other embodiments, the dynamic shadow infrastructure is used to facilitate fast boot-up and fast upgrade operations.

In some embodiments, a method receives a share of a signature of a decision block from at least a portion of the plurality of replicas. The share of the signature being generated when a respective replica signs the decision block and the decision block includes a set of requests from a client for a service. A combined signature is created based on the share of the signature block from at least the portion of the plurality of replicas. The method broadcasts a message that includes the combined signature to the plurality of replicas. The plurality of replicas use the combined signature to determine whether to process the decision block for the service.

In a method of molecular scaffold hopping an interface of a scheduler computer sends instructions, prepared by the scheduler computer, to a job runner computer to perform a plurality of separate computational tasks. Each of the separate computational tasks includes calculating one or more chemical properties for a query molecule or molecules in a library of molecules. One or more of the plurality of separate computational tasks performed on the job runner computer are preemptible computing instances. Status indicators sent from the job runner computer are received by the interface for each of the plurality of separate computational tasks. The indicators are one of: incomplete, completed, or failed computing instances. The interface resends the instructions to the job runner computer that correspond to the separate computational tasks having the failed computing instance indicator to increase fault-tolerance against the separate computational tasks not attaining the completed computing instance indicator.

Cloud computing is continuously growing as a business model for hosting information and communications technology applications. While the on-demand resource consumption and faster deployment time make this model appealing for the enterprise, other concerns arise regarding the quality of service offered by the cloud. Systems and methods are provided for enabling disaster recovery of applications hosted in the cloud and for monitoring data center sites for failure.

Methods, apparatuses, systems, and implementations of a zero silent data corruption (ZDC) compiler technique are disclosed. The ZDC technique may use an effective instruction duplication approach to protect programs from soft errors. The ZDC may also provide an effective control flow checking mechanism to detect most control flow errors. The ZDC technique may provide a failure percentage close to zero while incurring a lower performance overhead than prior art systems. The ZDC may also be effectively applied in a multi-thread environment.

The disclosure describes a failure-free execution agreement that includes n=3F+1 parties acting as replicas, and a number of parties acting as clients. One replica is designated as a primary. At most F replicas are presumed Byzantine faulty. The basic agreement protocol proceeds in three rounds: (1) client sends a request to the primary, who sends to all replicas; (2) each replica sends a threshold-part signature on hash to a first collector; (3) the collector combines the threshold-parts into a single signature and sends to all 3F+1 replicas which then commit and send to a second collector. The client proceeds when a signed block of requests arrives from the second collector.

A method includes detecting a triggering event at a hypervisor, where the hypervisor is executed by a computing node. The method also includes capturing, from a memory device of the computing node using the hypervisor, one or more images of a basic input/output system (BIOS) of the computing node and/or a firmware of the computing node. The method further includes analyzing the one or more images to detect a problem with the computing node and taking at least one action in response to detecting the problem with the computing node. The one or more images are obtained by the hypervisor directly from the memory device.

An apparatus is provided in which a user can easily check that an appropriate audio file is assigned. A system includes a PC connected to a communication line, and an audio interface apparatus that has an immediate output switch that outputs, to the PC, a reproduction start instruction signal of an audio file which is assigned in advance in response to a user operation. The PC judges, when an audio file or a video file is assigned by a user operation and in the background, whether or not the assignment is normal, and displays a judgment result in association with a virtual switch displayed on the display corresponding to the immediate output switch. The judgment is also repeatedly executed in the background at a predetermined timing after the assignment, and when the assignment is not normal, this is displayed.

Disclosed are systems, methods, and computer program products for emulation of files using multiple images of the emulator state. In one example, the method includes loading the file into an emulator of the computer system; initiating emulation of the file by the emulator; storing an initial image of an initial state of the emulator; continuing the emulation of the file and detecting occurrence of a condition that results during the emulation of the file; creating and storing a new image of a next state of the emulator when an occurrence of the condition is detected; determining whether the emulation of the file has terminated correctly or incorrectly; and upon determining that the emulation of the file has terminated incorrectly, loading the new image of the next state into the emulator and resuming the emulation of the file from the next state of the emulator.