The Community for Technology Leaders
14th International Conference on Distributed Computing Systems (1994)
Pozman, Poland
June 21, 1994 to June 24, 1994
ISBN: 0-8186-5840-1
pp: 172-181
B. Kao , Dept. of Comput. Sci., Stanford Univ., CA, USA
Complex distributed tasks often involve parallel execution of subtasks at different nodes. To meet the deadline of a global task, all of its parallel subtasks have to be finished on time. Compared to a local task (which involves execution at only one node), a global task may have a much harder time making its deadline because it is fairly likely that at least one of its subtasks run into an overloaded node. Another problem with complex distributed tasks occurs when a global task consists of a number of serially executing subtasks. In this case, we have the problem of dividing up the end-to-end deadline of the global task and assigning them to the intermediate subtasks. In this paper, we study both of these problems. Different algorithms for assigning deadlines to subtasks are presented and evaluated.<>
scheduling, real-time systems, distributed processing

B. Kao and H. Garcia-Molina, "Subtask deadline assignment for complex distributed soft real-time tasks," 14th International Conference on Distributed Computing Systems(ICDCS), Pozman, Poland, 1994, pp. 172-181.
91 ms
(Ver 3.3 (11022016))