Adaptive Scheduling of Fault-Tolerant Parallel Programs with Timing Constraints
1995 IEEE International Conference on Systems, Man and Cybernetics Intelligent Systems for the 21st Century
Abstract
We propose an adaptive preemptive scheduler for scheduling external sporadic tasks in a multiprocessor real-time system. We first present a pre-run-time scheduler to schedule a fault-tolerant parallel program with precedence constraints. Every task in the parallel program consists of two subtasks, namely, mandatory and optional. During run-time we optimally schedule the external tasks using the proposed adaptive scheduler. The scheduler removes the minimum number of optionals from the pre-run-time schedule to accommodate the external tasks. The performance of the system due to use of fault-tolerance is also demonstrated
MoreTranslated text
Key words
fault tolerant computing,multiprocessing systems,parallel programming,processor scheduling,real-time systems,scheduling,shared memory systems,adaptive scheduling,fault-tolerant parallel programs,multiprocessor systems,real-time system,shared memory systems,timing constraints
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined