G06F11/1492

DYNAMICALLY ADJUSTING THE NUMBER OF REPLICAS OF A FILE ACCORDING TO THE PROBABILITY THAT THE FILE WILL BE ACCESSED WITHIN A DISTRIBUTED FILE SYSTEM
20180314608 · 2018-11-01 ·

In a data storage system with a number of replicas of a file set to one or more replicas, a timer is set to track a time since a last access to the file. Responsive to the timer matching a first timer window threshold, a number of replicas of the file are automatically reduced within the data storage system, wherein the probability that the file will be accessed prior to the first timer window threshold is greater than the probability that the file will be accessed after the first timer window threshold.

Methods, apparatus and system for selective duplication of subtasks

A method for selective duplication of subtasks in a high-performance computing system includes: monitoring a health status of one or more nodes in a high-performance computing system, where one or more subtasks of a parallel task execute on the one or more nodes; identifying one or more nodes as having a likelihood of failure which exceeds a first prescribed threshold; selectively duplicating the one or more subtasks that execute on the one or more nodes having a likelihood of failure which exceeds the first prescribed threshold; and notifying a messaging library that one or more subtasks were duplicated.

System for cross-host, multi-thread session alignment

A method of detecting aberrant behavior in a software application is described. The method includes instantiating replicated applications on computing devices using identical initial setting. Each replicated application is a replicated instance of the software application. Information associated with a first API call from the first replicated application, and information associated with a second API call from the second replicated application is received. The information includes a call identifier of the API call and a digest. The call identifier is unique during the lifetime of the replicated application issuing it and is identical across the replicated applications. If the first and second call identifiers are identical, the method determines whether the first and second digests match. The method also includes, in response to the first and second digests not matching, signaling that aberrant behavior has occurred. Apparatus and computer readable media are also described.

Circuit and method for compensating for lost frames
10032457 · 2018-07-24 · ·

A circuit to compensate for a lost audio frame, comprising: an identifier configured to identify a reference audio segment with a first length followed by the lost audio frame with a second length; a searcher coupled to the identifier and configured to search for a first audio segment similar to the reference audio segment in a cached audio segment followed by the reference audio segment by utilizing a cross-correlation search; the identifier further configured to identify a second audio segment subsequent to the first audio segment as a pre-compensated audio frame; an adjustor coupled to the identifier and configured to adjust an amplitude of the second audio segment based on a scale factor; and an output coupled to the adjustor to output the adjusted second audio segment as a compensated audio frame.

Autonomous organization and role selection of homogenous workers
12130713 · 2024-10-29 · ·

A method for configuring replicas in a distributed computing system is disclosed. In one example embodiment, a plurality of replicas with associated bootstrap modules may be created. The same bootstrap module code may be used for each replica, thereby simplifying configuration. Using the bootstrap module, the replicas may automatically configure themselves and self-assign a role for a set of predetermined roles such as master and worker. The bootstrap module may check a predetermined location such as a shared network folder for earlier registration entries and then self-select based on the remaining available roles. The bootstrap module may also store its own registration entry to inform subsequent replicas of the role and network address for the current replica so that they may self-configure correctly.

Dynamically adjusting the number of replicas of a file according the probability that the file will be accessed within a distributed file system

In a distributed file system with a number of replicas of a file set to two or more replicas, a computer sets a timer to track a time since a last access to the file, wherein the replicas of the file are distributed across two or more nodes within the distributed file system. Responsive to an access to the file prior to the timer reaching a first timer window threshold, the computer resets the timer. Responsive to the timer matching a first timer window threshold, the computer automatically reduces a number of replicas of the file within the distributed file system, wherein the probability that the file will be accessed prior to the first timer window threshold is greater than the probability that the file will be accessed after the first timer window threshold.

BUFFERLESS COMMUNICATION FOR REDUNDANT MULTITHREADING USING REGISTER PERMUTATION
20180143829 · 2018-05-24 ·

Systems, apparatuses, and methods for implementing bufferless communication for redundant multithreading applications using register permutation are disclosed. In one embodiment, a system includes a parallel processing unit, a register file, and a scheduler. The scheduler is configured to cause execution of a plurality of threads to be performed in lockstep on the parallel processing unit. The plurality of threads include a first thread and a second thread executing on adjacent first and second lanes, respectively, of the parallel processing unit. The second thread is configured to perform a register permute operation from a first register location to a second register location in a first instruction cycle, with the second register location associated with the second processing lane. The second thread is configured to read from the second register location in a second instruction cycle, wherein the first and second instruction cycles are successive instruction cycles.

Redundant transactions for detection of timing sensitive errors

A method for detecting a software-race condition in a program includes copying a state of a transaction of the program from a first core of a multi-core processor to at least one additional core of the multi-core processor, running the transaction, redundantly, on the first core and the at least one additional core given the state, outputting a result of the first core and the at least one additional core, and detecting a difference in the results between the first core and the at least one additional core, wherein the difference indicates the software-race condition.

DOCUMENT DISPLAY DEVICE AND METHOD
20180032482 · 2018-02-01 ·

A device for displaying a document includes a display screen, a human-machine interface, a first memory zone and at least one second memory zone separate from the first memory zone. The zones are configured to contain similar information. A processor is configured to execute a first process and at least one second process when a display request is received via the human-machine interface. Those processes include respectively reading first information in the first memory zone and second information in the second memory zone. That information corresponds to the display request. The processes also include respectively producing a first display layer and a second display layer associated with the display screen, the first display layer and the second display layer being displayed on the display screen superimposed.

Systems and methods for error correction in quantum computation
09870277 · 2018-01-16 · ·

The effects of decoherence and/or noise in adiabatic quantum computation and quantum annealing are reduced by implementing replica coding schemes. Multiple instances of the same problem are mapped to respective subsets of the qubits and coupling devices of a quantum processor. The multiple instances are evolved simultaneously in the presence of coupling between the qubits of different instances. Quantum processor architectures that are adapted to facilitate replica coding are also described.