RT Journal Article
JF IEEE Transactions on Computers
YR 1985
VO 34
SP 1130
TI Evaluation of a flexible task scheduling algorithm for distributed hard real-time systems
A1 Krithivasan Ramamritham,
A1 Shengchang Cheng,
K1 simulation studies
K1 Bidding
K1 deadlines
K1 distributed computing
K1 estimation techniques
K1 focused addressing
K1 real-time
K1 scheduling
AB Most systems that are required to operate under severe real-time constraints assume that all tasks and their characteristics are known a priori. Scheduling of such tasks can be done statically. Further, scheduling algorithms operating under such conditions are usually limited to multiprocessor configurations. This paper presents a scheduling algorithm, that works dynamically and on loosely coupled distributed systems, for tasks with hard real-time constraints, i.e., the tasks must meet their deadlines. It uses a scheduling component local to every node and a distributed scheduling scheme that is specifically suited to hard real-time constraints and other timing considerations. Periodic tasks, nonperiodic tasks, scheduling overheads, communication overheads due to scheduling, and preemption are all accounted for in the algorithm. Simulation studies are used to evaluate the performance of the algorithm.
PB IEEE Computer Society, [URL:http://www.computer.org]
SN 0018-9340
LA English
DO 10.1109/TC.1985.6312211
LK http://doi.ieeecomputersociety.org/10.1109/TC.1985.6312211