A transfer policy for global scheduling algorithms to schedule tasks with deadlines

Author

Shivaratri, Niranjan G. ; Singhal, Mukesh

Author_Institution

Dept. of Comput. & Inf. Sci., Ohio State Univ., Columbus, OH, USA

fYear

1991

fDate

20-24 May 1991

Firstpage

248

Lastpage

255

Abstract

The authors present a load index to characterize the system state that is more conducive to apply preventive and corrective measures, and a transfer policy which takes preventive measures by doing anticipatory task transfers in addition to corrective measures. Key features of this transfer policy are: (1) it is general and can be used in conjunction with a broad range of existing location policies, (2) it does not require the capability to transfer partially executed tasks, and (3) it adapts better to the system state by looking-ahead. A simulation study shows that an algorithm making use of the transfer policy and the load index reduces the number of deadline misses significantly when compared to algorithms taking only corrective measures

Keywords

distributed processing; scheduling; corrective measures; deadlines; global scheduling algorithms; load index; looking-ahead; simulation study; tasks; transfer policy; Delay; Information science; Processor scheduling; Real time systems; Scheduling algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Distributed Computing Systems, 1991., 11th International Conference on

Conference_Location

Arlington, TX

Print_ISBN

0-8186-2144-3

Type

conf

DOI

10.1109/ICDCS.1991.148673

Filename

148673