The Community for Technology Leaders
Green Image
A set of four heuristic algorithms is presented to schedule tasks that have headlines and resource requirements in a distributed system. When a task arrives at a node, the local scheduler at that node attempts to guarantee that the task will complete execution on that node before its deadline. If the attempt fails, the scheduling components on individual nodes cooperate to determine which other
distributed scheduling; simulation studies; tasks; deadlines; resource requirements; heuristic algorithms; distributed system; bidding algorithm; communication delay; task laxity; task computation times; hard real-time environment; distributed processing; heuristic programming; real-time systems; scheduling.

J. Stankovic, W. Zhao and K. Ramamritham, "Distributed Scheduling of Tasks with Deadlines and Resource Requirements," in IEEE Transactions on Computers, vol. 38, no. , pp. 1110-1123, 1989.
86 ms
(Ver 3.3 (11022016))