학술논문

A transfer policy for global scheduling algorithms to schedule tasks with deadlines
Document Type
Conference
Source
[1991] Proceedings. 11th International Conference on Distributed Computing Systems Distributed Computing Systems, 1991., 11th International Conference on. :248-255 1991
Subject
Computing and Processing
Communication, Networking and Broadcast Technologies
Scheduling algorithm
Processor scheduling
Delay
Real time systems
Information science
Language
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.ETX