BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-93-1491
       ENTRY:: October 19, 1993
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: Subtask Deadline Assignment for Complex Distributed Soft
               Real-Time Tasks
        TYPE:: Technical Report
      AUTHOR:: Kao, Ben
      AUTHOR:: Garcia-Molina, Hector
       PAGES:: 25
    ABSTRACT:: 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
               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. 
       NOTES:: [Adminitrivia V3/ACK19940321 Added the ORGANIZATION and
               TYPE information]
               [Adminitrivia V2/ACK/19931216 Reformat authors to
               last-name, first-name.]
               [Adminitrivia V1/ACK/19931019]
         END:: STAN//CS-TR-93-1491