By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Shivaratri, N.G. ; Dept. of Comput. & Inf. Sci., Ohio State Univ., Columbus, OH, USA ; Singhal, M.

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

Published in:

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

Date of Conference:

20-24 May 1991