A linear-time online task assignment scheme for multiprocessor systems

Author

Burchard, Almut ; Oh, Yingfeng ; Liebeherr, Jörg ; Son, Sang H.

Author_Institution

Sch. of Math., Georgia Inst. of Technol., Atlanta, GA, USA

fYear

1994

fDate

18-19 May 1994

Firstpage

28

Lastpage

31

Abstract

A new online task assignment scheme is presented for multiprocessor systems where individual processors execute the rate-monotonic scheduling algorithm. The computational complexity of the task assignment scheme grows linearly with the number of tasks, and its performance is shown to be significantly better than previously existing schemes. The superiority of the assignment scheme is achieved by a new schedulability condition derived for the rate-monotonic scheduling discipline

Keywords

computational complexity; multiprocessing systems; online operation; operating systems (computers); performance evaluation; real-time systems; scheduling; computational complexity; linear-time online task assignment; multiprocessor systems; performance; rate-monotonic scheduling algorithm; real-time systems; schedulability condition; Computational complexity; Computer science; Dynamic scheduling; Heuristic algorithms; Mathematics; Multiprocessing systems; Processor scheduling; Real time systems; Scheduling algorithm; Upper bound;

fLanguage

English

Publisher

ieee

Conference_Titel

Real-Time Operating Systems and Software, 1994. RTOSS '94, Proceedings., 11th IEEE Workshop on

Conference_Location

Seattle, WA

Print_ISBN

0-8186-5710-3

Type

conf

DOI

10.1109/RTOSS.1994.292566

Filename

292566