Abstract
The paper introduces a family of scheduling problems called fault-tolerant programs scheduling (FTPS). Since FTPS problems are, in general, computationally difficult, a challenge is to find effective scheduling procedures. Three evolution-based algorithms solving three basic kinds of FTPS problems have been proposed. The problems involve scheduling multiple variant tasks on multiple identical processors under time constraints. To validate the algorithms computational experiment has been carried. Experiment results show that evolution based algorithms produce satisfactory to good solutions in reasonable time.
Preview
Unable to display preview. Download preview PDF.
References
Avizienis A., L. Chen: On the implementation of the N-version programming for software fault tolerance during execution, Proc. IEEE COMPSAC 77, 1977, pp. 149–155.
Belli F., P. Jedrzejowicz: Fault Tolerant Programs and Their Reliability, IEEE Trans. on Reliability, 39(2), 1990, pp. 184–192.
Belli F., P. Jedrzejowicz: An Approach to the Reliability Optimization of Software with Redundancy, IEEE Trans. on Software Engineering, 17(3), 1991, pp. 310–312.
Blazewicz J., K.H. Ecker, E. Pesch, G. Schmidt, J. Weglarz: Scheduling Computer and Manufacturing Processes, Springer, Berlin, 1996.
Bondavalli, A., F. Di Giandomenico, J. Xu: Cost-effective and flexible scheme for software fault tolerance, Computer System Science & Engineering, 4, 1993, pp. 234–244.
Garey M.R., D.S. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman, New York, 1979.
Ghosh S., R. Melham, D. Mosse: Fault-Tolerance through Scheduling of Aperiodic Tasks in Hard Real-Time Multiprocessor Systems, IEEE Trans. on Parallel and Distributed Systems, 8(13), 1997, pp. 272–284.
Graham R.L., E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan: Optimization and approximation in deterministic sequencing and scheduling: a survey, Annals Discrete Math., 5, 1979, pp. 287–326.
Hertz A., D. Kobler: A Framework for the Description of Population Based Methods, 16th European Conference on Operational Research—Tutorials and Research Reviews, Brussels, 1998, pp. 1–23
Jedrzejowicz P.: Scheduling multiple-variant programs under hard real-time constraints, Proc. International Workshop Project Management and Scheduling, Istambul, 1998, pp.
Jedrzejowicz P.: Maximizing number of program variants run under hard time constarints, Proc. International Symposium Software Reliability, Paderborn, 1998, pp.
Kim K.H.: Distributed execution of recovery blocks: an approach to uniform treatment of hardware and software faults, Proc. 4th International Conference on Distributed Computing Systems, IEEE Computer Society Press, 1984, pp. 526–532.
Laprie J.C., J. Arlat, C. Beounes, K. Kanoun: Definition and Analysis of Hardware-and-Software Fault-Tolerant Architectures, IEEE Computer, 23(7), 1990, pp. 39–51.
Liestman A.L., R.H. Campbell: A Fault-tolerant Scheduling Problem, IEEE Trans. on Software Engineering, SE-12(11), 1988, pp. 1089–1095.
Melliar-Smith P.M., B. Randell: Software reliability: the role of programmed exception handling, SIGPLAN Notices 12(3), 1977, pp. 95–100.
Scott R.K., J.W. Gault, D.F. Mc Allister: Fault tolerant software reliability modelling, IEEE Trans. on Software Engineering, 13(5), 1987, pp. 582–592.
Vouk, M.A.: Back-to-back testing, Information and software technology, vol. 32, no 1, 1990, pp. 34–35.
Yau S.S., R.C. Cheung: Design of Self-Checking Software, Proc. Int. Conf. on Reliable Software, 1975, pp. 450–457.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1999 Springer-Verlag
About this paper
Cite this paper
Jedrzejowicz, P., Czarnowski, I., Szreder, H., Skakowski, A. (1999). Evolution-based scheduling of fault-tolerant programs on multiple processors. In: Rolim, J., et al. Parallel and Distributed Processing. IPPS 1999. Lecture Notes in Computer Science, vol 1586. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0097902
Download citation
DOI: https://doi.org/10.1007/BFb0097902
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65831-3
Online ISBN: 978-3-540-48932-0
eBook Packages: Springer Book Archive