Title :
Scheduling periodic distributed hard real-time tasks
Author :
Khemka, Ashok ; Shyamasundar, R.K.
Author_Institution :
Comput. Sci. Group, Tata Inst. of Fundamental Res., India
Abstract :
We present several efficient online and offline strategies for assigning periodic tasks to the nodes of a distributed system, such that the tasks can be feasibly scheduled by the node using some local static/dynamic priority assigning rule. We describe rules that lead to a near optimal utilization factor. Strategies are given for approximation algorithms and the approach leads to a high guarantee ratio
Keywords :
distributed processing; processor scheduling; real-time systems; approximation algorithms; distributed system; feasible scheduling; high guarantee ratio; local static/dynamic priority assigning rule; near optimal utilization factor; offline strategies; online strategies; periodic distributed hard real time task scheduling; periodic task assignment; Approximation algorithms; Computer science; Delay effects; Dynamic scheduling; Processor scheduling; Real time systems; Scheduling algorithm;
Conference_Titel :
Parallel and Distributed Real-Time Systems, 1996. Proceedings of the 4th International Workshop on
Conference_Location :
Honolulu, HI
Print_ISBN :
0-8186-7515-2
DOI :
10.1109/WPDRTS.1996.557470
