BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-92-1452
       ENTRY:: August 28, 1994
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: Deadline assignment in a distributed soft real-time system
        TYPE:: Technical Report
      AUTHOR:: Kao, Ben
      AUTHOR:: Garcia-Molina, Hector
        DATE:: October 1992
       PAGES:: 28
    ABSTRACT:: In a distributed environment, tasks often have processing
               demands on multiple different sites. A distributed task is
               usually divided up into several subtasks, each one to be
               executed at some site in order. In a real-time system, an
               overall deadline is usually specified by an application
               designer indicating when a distributed task is to be
               finished. However, the problem of how a global deadline is
               automatically translated to the deadline of each individual
               subtask has not been well studied. This paper examines
               (through simulations) four strategies for subtask deadline
               assignment in a distributed soft real-time environment.
       NOTES:: [Adminitrivia V1/RAM/19940828]
         END:: STAN//CS-TR-92-1452