Stanford InfoLab Publication Server

Subtask Deadline Assignment for Complex Distributed Soft Real-Time Tasks

Kao, B. and Garcia-Molina, H. (1993) Subtask Deadline Assignment for Complex Distributed Soft Real-Time Tasks. Technical Report. Stanford University.




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. Comparing to a local task (which involves execution at only one noa 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. Keywords: soft real-time, distributed systems, parallel systems, deadline assignment, scheduling.

Item Type:Techreport (Technical Report)
Subjects:Computer Science
Related URLs:Project Homepage
ID Code:41
Deposited By:Import Account
Deposited On:25 Feb 2000 16:00
Last Modified:02 Dec 2008 14:45

Download statistics

Repository Staff Only: item control page