BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-72-310
       ENTRY:: October 16, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: Anomalies in scheduling unit-time tasks.
        TYPE:: Technical Report
      AUTHOR:: Kaufman, Marc T.
        DATE:: June 1972
       PAGES:: 32
    ABSTRACT:: In this paper we examine the problem of scheduling a set of
               tasks on a system with a number of identical processors.
               Several timing anomalies are known to exist for the general
               case, in which the execution time can increase when
               inter-task constraints are removed or processors are added.
               It is shown that these anomalies also exist when tasks are
               restricted to be of equal (unit) length. Several,
               increasingly restrictive, heuristic scheduling algorithms are
               reviewed. The "added processor" anomaly is shown to persist
               through all of them, though in successively weaker form.
       NOTES:: [Adminitrivia V1/Prg/19951016]
         END:: STAN//CS-TR-72-310