DocumentCode
1884857
Title
Fault-tolerant real-time task scheduling in the MAFT distributed system
Author
Kieckhafer, R.M.
Author_Institution
Dept. of Comput. Sci. & Eng., Nebraska Univ., Lincoln, NE, USA
Volume
1
fYear
1989
fDate
3-6 Jan 1989
Firstpage
143
Abstract
The development of the task scheduling mechanism for the multicomputer architecture for fault-tolerance (MAFT) is discussed. MAFT is a distributed computer system designed to provide high performance and extreme reliability in real-time control applications. The impact of the system´s functional requirements, fault-tolerance requirements, and architecture on the development of the scheduling mechanism is examined. MAFT uses a priority-list scheduling algorithm modified to provide extreme reliability in the monitoring of tasks and the detection of scheduling errors. It considers such issues as modular redundancy, Byzantine agreement, and the use of multiversion software and dissimilar hardware. An example of scheduler performance with a realistic workload is presented
Keywords
computer architecture; distributed processing; fault tolerant computing; real-time systems; scheduling; Byzantine agreement; MAFT distributed system; fault tolerant real time task scheduling; fault-tolerance; functional requirements; modular redundancy; multicomputer architecture; multiversion software; priority-list scheduling algorithm; reliability; Application software; Computer architecture; Control systems; Distributed computing; Fault tolerance; Fault tolerant systems; High performance computing; Processor scheduling; Real time systems; Scheduling algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
System Sciences, 1989. Vol.I: Architecture Track, Proceedings of the Twenty-Second Annual Hawaii International Conference on
Conference_Location
Kailua-Kona, HI
Print_ISBN
0-8186-1911-2
Type
conf
DOI
10.1109/HICSS.1989.47154
Filename
47154
Link To Document