Patent classifications
G06F11/1492
Predictive analysis, scheduling and observation system for use with loading multiple files
A method for creating a common platform graphical user interface is provided. The interface may enable a user to trigger a data load job from a tool. The tool may monitor file upload events, trigger jobs and identify lists of missing or problematic file names. The tool may run on a single thread, thereby consuming relatively less system resources than a multi-thread program to perform its capabilities. The tool may enable selection of file names using wildcard variables or keyword variables. The tool may validate a list of files received against a master file list for each data load job. The tool may receive user input relating to each data load job. The tool may generate a loop within the single thread to receive information. The tool may analyze the received information and use the received information to predict future metadata associated with future data load jobs.
Fault tolerant processor for real-time systems
A fault tolerant multi-threaded processor uses the temporal and/or spatial separation of instructions running in two or more different threads. An instruction is fetched, decoded and executed by each of two or more threads to generate a result for each of the two or more threads. These results are then compared using comparison hardware logic and if there is a mismatch between the results obtained, then an error or event is raised. The comparison is performed on an instruction by instruction basis so that errors are identified (and hence can be resolved) quickly.
DYNAMICALLY ADJUSTING THE NUMBER OF REPLICAS OF A FILE ACCORDING TO THE PROBABILITY THAT THE FILE WILL BE ACCESSED WITHIN A DISTRIBUTED FILE SYSTEM
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, the timer is reset to count to a second timer window threshold and 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. Responsive to the timer matching the second timer window threshold, the timer is reset to count to a third timer window threshold. Responsive to receiving a read access prior to the timer reaching the third timer window threshold, the number of replicas of the file is increased and the timer reset to count to the second timer window threshold.
METHODS AND SYSTEMS OF MANAGING CONSISTENCY AND AVAILABILITY TRADEOFFS IN A REAL-TIME OPERATIONAL DBMS
in one aspect, a computerized method for managing consistency and availability tradeoffs in a real-time operational database management system (DBMS) includes the step of implementing consistency in an AP mode of the real-time operational DBMS by implementing the following steps. The method adds a set of schemes that enable a real-time operational DBMS to linearize read/write operations in all situations except a first specified situation and a second specified situation. The real-time operational DBMS is in AP mode, at least one master node for every data item is available in the database cluster of the real-time operational DBMS at all times. The method implements a CP mode of operation.
Dynamically adjusting the number of replicas of a file according to the probability that the file will be accessed within a distributed file system
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.
Autoscaling in a stateful system
A process for facilitating autoscaling in a stateful system is described herein. In embodiments, a set of metrics associated with a set of components of a stateful service is obtained. The set of metrics may generally indicate a utilization or a load of each of the components of the set of components (e.g., message managers and/or data stores). Thereafter, it is determined to initiate a scaling event at the stateful service in association with the set of components of the stateful service based on at least a portion of the set of metrics attaining a metric threshold indicating a threshold value for determining whether to scale stateful service components. A scaling request can then be provided to the stateful service to initiate the scaling event at the stateful service in association with the set of components of the stateful service.
Electronic computer, electronic system, method for monitoring the execution of an application and associated computer program
The invention relates to an electronic system with a built-in computer, designed to execute a source application in response to an external request. The capabilities of the system may include creating a clone of the source application by duplicating the application's executable, which is stored in a separate memory area. The system may then initiate an internal request to run the clone application. The original source and its clone may be executed independently, with the system generating a unified output by comparing the results of both the source and clone applications' execution. The invention provides for an approach to running and comparing software applications, enhancing computational efficiency and reliability.
System and method for modular construction of executable programs having self-contained program elements
A method for performing a fault tolerant automated sequence of computer implemented tasks including, presenting for selection by a user a plurality of pre-programmed elements, each pre-programmed element being independently executable relative each other pre-programmed element, receiving from the user a selection of one or more of the pre-programmed elements and a sequence for performing each pre-programmed element to form an exemplary routine, creating an instance of the exemplary routine, the instance of the exemplary routine including an instance of each of the selected pre-programmed elements arranged for performance in accordance with the sequence and configured to perform tasks defined by the pre-programmed elements and the sequence, initiating implementation of the instance of the exemplary routine by initiating performance of the instances of the pre-programmed elements in accordance with the sequence, and executing each instance of the pre-programmed elements according to the sequence.
Bufferless communication for redundant multithreading using register permutation
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.
MANAGING A COMPUTING CLUSTER USING REPLICATED TASK RESULTS
A method for processing tasks in a distributed data processing system includes processing sets of tasks. The method includes maintaining, at a first processing node a number of counters including a working counter indicating a current time interval of the number of time intervals in the distributed data processing system, and a replication counter indicating a time interval of the number of time intervals for which at least one of (1) all tasks associated with that time interval, or (2) all corresponding results associated with that time interval, are replicated at multiple processing nodes of the number of processing nodes. The method includes providing messages from the first processing node to the other processing nodes of the number of processing nodes, the messages including the working counter and the replication counter.