Abstract
The scheduling of real-time tasks with primary-backup based fault-tolerant requirements has been an important problem for several years. Most of the known scheduling schemes are non-adaptive in nature meaning that they do not adapt to the dynamics of faults and task’s parameters in the system. In this paper,we propose an adaptive faulttolerant scheduling scheme that has a mechanism to control the overlap interval between the primary and backup versions of tasks such that the overall performance of the system is improved. The overlap interval is determined based on the estimated primary fault probability and task’s soft laxity. We also propose a new performance index that integrates schedulability (S) and reliability (R) into a single metric, called SR index. To evaluate the proposed scheme, we have conducted analytical and simulation studies under different fault and deadline scenarios, and found that the proposed adaptive scheme adapts to system dynamics and offers better SR index than that of the non-adaptive schemes.
This research was supported in part by the NSF under grant CCR-0098354.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
K.G. Shin and P. Ramanathan,“Real-time computing: A new discipline of computer science and engineering,” Proc. of IEEE, vol. 82, no. 1, pp. 6–24, Jan. 1994.
L. Chen and A. Avizienis,“N-v ersion programming: A fault tolerant approach to reliability of software operation”, In Proc. IEEE Fault-Tolerant Computing Symposium, pp. 3–9., 1978.
B. Randell,“System structure for software fault-tolerance,” IEEE Transactions on Software Engineering, vol. 1, no. 2, pp. 220–232, June 1975.
S. Tridandapani, A. K. Somani, and U. Reddy,“Lo w overhead multiprocessor allocation strategies exploiting system spare capacity for fault detection and location,” IEEE Transactions on Computers,vol. 44, no. 7, pp. 865–877, July 1995.
S. Ghosh, R. Melhem, and D. Mosse,“F ault-tolerance through scheduling of aperiodic tasks in hard real-time multiprocessor systems,” IEEE Transactions on Parallel and Distributed Systems, vol. 8, no. 3, pp. 272–284, Mar. 1997.
O. González, H. Shrikumar, J.A. Stankovic, and K. Ramamritham,“Adaptive fault-tolerance and graceful degradation under dynamic hard real-time scheduling,” In Proc. IEEE Real-Time Systems Symposium, 1997.
G. Manimaran and C. Siva Ram Murthy,“ A fault-tolerant dynamic scheduling algorithm for multiprocessor real-time systems and its analysis,” IEEE Transactions on Parallel and Distributed Systems, vol. 9, no. 11, pp. 1137–1152, Nov. 1998.
I. Gupta, G. Manimaran, and C. Siva Ram Murthy,“Primary-Bac kup based faulttolerant dynamic scheduling of object-based tasks in multiprocessor real-time systems,” in Dependable Network Computing, D.R. Avresky (editor), Kluwer Academic Publishers, 1999.
F. Wang, K. Ramamritham and J. A. Stankovic,“Determining redundancy levels for fault tolerant real-time systems,” IEEE Transactions on Computers, vol. 44, no. 2, pp. 292–301, Feb. 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Al-Omari, R., Somani, A.K., Manimaran, G. (2001). An Adaptive Scheme for Fault-Tolerant Scheduling of Soft Real-Time Tasks in Multiprocessor Systems. In: Monien, B., Prasanna, V.K., Vajapeyam, S. (eds) High Performance Computing — HiPC 2001. HiPC 2001. Lecture Notes in Computer Science, vol 2228. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45307-5_7
Download citation
DOI: https://doi.org/10.1007/3-540-45307-5_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43009-4
Online ISBN: 978-3-540-45307-9
eBook Packages: Springer Book Archive