Algorithm for synthesis of real-time systems under reliability constraints

Abstract

The problem of constructing a real time computing system that has a minimum number of processors is addressed. It is necessary that the system meets the deadlines of program execution and the system reliability requirements implying that the system must tolerate both hardware and software failures. The formal statement of this problem is presented, a method for its solution using an iterative scheduling algorithm based on the method of simulated annealing is proposed, and an experimental study of the proposed algorithm is conducted.

Scheduling Signal Processing Tasks for Antenna Arrays with Simulated Annealing

“…Since processor performance is known, it is possible to calculate the execution time of each node, as well as the amount of data sent between the nodes. So, we reach the following mathematical problem statement [2].…”

“…This paper suggests the application of simulated annealing algorithm to this problem. The purpose of this work is to show how the simulated annealing algorithm (discussed, for instance, in [2] and [3]) can work with realworld industrial problems.…”

CS676 Real Time Systems: Magnus Technology R&D Real Time Systems

“…The more expensive machines have some critical spare parts, but it takes time to replace these, meanwhile work proceeds manually. Magnus Technology R&D would like to get to a point where it has multiple redundancy in its process as Zorin and Kostenko (Zorin & Kostenko, 2015) describe.…”

Algorithm for resource allocation in data centers with independent schedulers for different types of resources

“…Problems of scheduling in real time systems [5][6][7][8][9][10] are viewed as the closest problems in terms of the assured compliance with the SLA. In these problems, the constraints placed on the feasible time of exe cuting applied programs or program processes are used as the SLA criteria that cannot be violated.…”