A fault-tolerant scheduling problem
IEEE Transactions on Software Engineering
Scheduling Multiprocessor Tasks to Minimize Schedule Length
IEEE Transactions on Computers
On Scheduling Tasks with a Quick Recovery from Failure
IEEE Transactions on Computers
Fault-Tolerant SoFtware Reliability Modeling
IEEE Transactions on Software Engineering
Distributed Scheduling of Tasks with Deadlines and Resource Requirements
IEEE Transactions on Computers
Analysis and evaluation of heuristic methods for static task scheduling
Journal of Parallel and Distributed Computing
An Approach to the Reliability Optimization of Software with Redundancy
IEEE Transactions on Software Engineering
Genetic algorithms + data structures = evolution programs (2nd, extended ed.)
Genetic algorithms + data structures = evolution programs (2nd, extended ed.)
Scheduling computer and manufacturing processes
Scheduling computer and manufacturing processes
Fault-Tolerance Through Scheduling of Aperiodic Tasks in Hard Real-Time Multiprocessor Systems
IEEE Transactions on Parallel and Distributed Systems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Scheduling and Load Balancing in Parallel and Distributed Systems
Scheduling and Load Balancing in Parallel and Distributed Systems
Efficient Scheduling Algorithms for Real-Time Multiprocessor Systems
IEEE Transactions on Parallel and Distributed Systems
Design of self-checking software
Proceedings of the international conference on Reliable software
Reliability Optimization of Redundant Software with Correlated Failures
ISSRE '98 Proceedings of the The Ninth International Symposium on Software Reliability Engineering
| Hi-index | 0.00 |
The paper proposes to manage complexity and costs issues of the fault-tolerant programs not at a single program level but rather from the point of view of the whole set of such programs, which are to be run under hard time constraints. A concept of the multiple processor programs is used to model a fault-tolerant program structure. This model, in turn, is used to formulate the fault-tolerant programs scheduling problem under hard time constraints. Since the discussed problem is computationally difficult, three scheduling algorithms, based on three different metaheuristics, have been proposed. To evaluate the proposed algorithms computational experiment has been carried. The proposed global approach has been also compared with scheduling without search for the global optimum. Experiment results prove that the approach could be advantageous by producing more reliable schedules within hard time constraints.