A REAL-TIME SCHEDULING ALGORITHM FOR TASKS WITH RESOURCE CONTENTION ON A MULTIPROCESSOR

Our scheduling algorithm is based on a general model with timing and resource constraints which permits OR requests. In order to keep run-time costs low, we propose an algorithm that does not search the whole search space. This paper defines two measures, survivability and impact, for scheduling tasks conflicted for some resources. The survivability is a metric to show how urgent a task is, and how constrained it is by its resources. The impact of a resource for a task measures how much other tasks are influenced by the allocation of the resource to the task. Our scheduling algorithm uses the survivability to schedule tasks on multiple processors. After a task is picked out to be run in a time slice using the survivability, the least impact resources are allocated from several alternative resources.
Publisher
WORLD SCIENTIFIC PUBL CO PTE LTD
Issue Date
1994-09
Language
ENG
Citation

JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS, v.4, no.3, pp.243 - 253

ISSN
0218-1266
URI
http://hdl.handle.net/10203/66068
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
  • Hit : 109
  • Download : 0
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0