On-line multiprocessor scheduling algorithms for real-time tasks

Author

Lee, Suk Kyoon

Author_Institution

Dept. of Manage. Inf. Syst., King Sejong Univ., Seoul, South Korea

fYear

1994

fDate

22-26 Aug 1994

Firstpage

607

Abstract

The existing on-line scheduling algorithms EDA (Earliest Deadline Algorithm) and LLA (Least Laxity Algorithm) are not sufficient for scheduling real-time sporadic tasks in multiprocessor systems. EDA has low context switching overhead but suffers from “multiple processor anomalies”. LLA has good scheduling power, but the potential for high context switching overhead. We propose a new on-line scheduling algorithm EDZL which has both good scheduling power and low context switching overhead even in multiprocessor systems

Keywords

multiprocessing systems; online operation; parallel algorithms; processor scheduling; real-time systems; EDA; EDZL; Earliest Deadline Algorithm; LLA; Least Laxity Algorithm; high context switching overhead; low context switching overhead; multiple processor anomalies; multiprocessor scheduling algorithms; multiprocessor systems; online scheduling algorithm; real-time sporadic tasks; real-time tasks; scheduling power; Computers; Design methodology; Electronic design automation and methodology; Management information systems; Multiprocessing systems; Operating systems; Processor scheduling; Real time systems; Scheduling algorithm; Stochastic systems;

fLanguage

English

Publisher

ieee

Conference_Titel

TENCON '94. IEEE Region 10's Ninth Annual International Conference. Theme: Frontiers of Computer Technology. Proceedings of 1994

Print_ISBN

0-7803-1862-5

Type

conf

DOI

10.1109/TENCON.1994.369148

Filename

369148