Scheduling multiprocessor tasks -- An overview

Abstract Multiprocessor tasks require more than one processor at the same moment of time. This relatively new concept in scheduling theory emerged with the advent of parallel computing systems. In this work we present the state of the art for multiprocessor task scheduling. We show the rationale behind the concept of multiprocessor tasks. The standard three-field notation is extended to accommodate multiprocessor tasks. The main part of the work is presentation of the results in multiprocessor tasks scheduling both for parallel and for dedicated processors.

[1]  Lucio Bianco,et al.  Nonpreemptive scheduling of independent tasks with prespecified processor allocations , 1994 .

[2]  Rüdiger Esser,et al.  CM-5E, KSR2, Paragon XP/S: A Comparative Description of Massively Parallel Computers , 1995, Parallel Comput..

[3]  Maciej Drozdowski.  Scheduling multiprocessor tasks on hypercubes , 1994 .

[4]  Marek Kubale,et al.  The Complexity of Scheduling Independent Two-Processor Tasks on Dedicated Processors , 1987, Information Processing Letters.

[5]  Kewal K. Saluja,et al.  Test Scheduling and Control for VLSI Built-In Self-Test , 1988, IEEE Trans. Computers.

[6]  Yahui Zhu,et al.  An O(n log n) Feasibility Algorithm for Preemptive Scheduling of n Independent Jobs on a Hypercube , 1990, Inf. Process. Lett..

[7]  Thomas G. Robertazzi,et al.  Distributed computation with communication delay (distributed intelligent sensor networks) , 1988 .

[8]  Klaus Jansen.  Scheduling with constrained processor allocation for interval orders , 1992, Comput. Oper. Res..

[9]  S. Louis Hakimi,et al.  Characterization of Connection Assignment of Diagnosable Systems , 1974, IEEE Transactions on Computers.

[10]  Jacek Blazewicz,et al.  Deadline Scheduling of Multiprocessor Tasks , 1996, Discret. Appl. Math..

[11]  Y. H. Chin,et al.  Scheduling unit-time jobs on processors with different capabilities , 1989, Comput. Oper. Res..

[12]  Ravi Jain,et al.  Scheduling Parallel I/O Operations in Multiple Bus Systems , 1992, J. Parallel Distributed Comput..

[13]  Yahui Zhu,et al.  On Job Scheduling on a Hypercube , 1993, IEEE Trans. Parallel Distributed Syst..

[14]  Kemal Efe,et al.  Optimal Scheduling of Compute-Intensive Tasks on a Network of Workstations , 1995, IEEE Trans. Parallel Distributed Syst..

[15]  Joseph Y.-T. Leung,et al.  Complexity of Scheduling Parallel Task Systems , 1989, SIAM J. Discret. Math..

[16]  Michel X. Goemans,et al.  An Approximation Algorithm for Scheduling on Three Dedicated Machines , 1995, Discret. Appl. Math..

[17]  A.L. Hopkins,et al.  FTMP—A highly reliable fault-tolerant multiprocess for aircraft , 1978, Proceedings of the IEEE.

[18]  B. J. Lageweg,et al.  Multiprocessor scheduling with communication delays , 1990, Parallel Comput..

[19]  Jan Karel Lenstra,et al.  Scheduling subject to resource constraints: classification and complexity , 1983, Discret. Appl. Math..

[20]  Jacek Blazewicz,et al.  Scheduling Multiprocessor Tasks on Three Dedicated Processors , 1992, Inf. Process. Lett..

[21]  Kam-Hoi Cheng,et al.  A Heuristic of Scheduling Parallel Tasks and its Analysis , 1992, SIAM J. Comput..

[22]  Jacek Blazewicz,et al.  Scheduling Divisible Jobs on Hypercubes , 1995, Parallel Comput..

[23]  GERNOT METZE,et al.  On the Connection Assignment Problem of Diagnosable Systems , 1967, IEEE Trans. Electron. Comput..

[24]  V. G. Vizing.  Minimization of the maximum delay in servicing systems with interruption , 1982 .

[25]  Errol L. Lloyd,et al.  Concurrent Task Systems , 1981, Oper. Res..

[26]  Jacek Blazewicz,et al.  Scheduling in Computer and Manufacturing Systems , 1990 .

[27]  Lucio Bianco,et al.  Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors , 1995, Ann. Oper. Res..

[28]  Edward M. Reingold,et al.  Scheduling on a Hypercube , 1991, Inf. Process. Lett..

[29]  Edward D. Lazowska,et al.  The Effect of Scheduling Discipline on Spin Overhead in Shared Memory Parallel Systems , 1991, IEEE Trans. Parallel Distributed Syst..

[30]  Dan C. Marinescu,et al.  Models and Algorithms for Coscheduling Compute-Intensive Tasks on a Network of Workstations , 1992, J. Parallel Distributed Comput..

[31]  Daniel P. Siewiorek,et al.  Parallel processing: the Cm* experience , 1986 .

[32]  Jacek Blazewicz,et al.  Scheduling Independent Multiprocessor Tasks on a Uniform k-Processor System , 1994, Parallel Comput..

[33]  Bozoki George,et al.  A Branch-and-Bound Algorithm for the Continuous-Process Job-Shop Scheduling Problem , 1970 .

[34]  Maciej Drozdowski,et al.  Real-Time Scheduling of Linear Speedup Parallel Tasks , 1996, Information Processing Letters.

[35]  J. Węglarz,et al.  SCHEDULING UNDER CONTINUOUS PERFORMING SPEED VS. RESOURCE AMOUNT ACTIVITY MODELS , 1989 .

[36]  Peter Brucker,et al.  Scheduling Algorithms , 1995 .

[37]  Jacek Blazewicz,et al.  Scheduling Multiprocessor Tasks to Minimize Schedule Length , 1986, IEEE Transactions on Computers.

[38]  David M. Nicol,et al.  Optimal Processor Assignment for a Class of Pipelined Computations , 1994, IEEE Trans. Parallel Distributed Syst..

[39]  Edward G. Coffman,et al.  Scheduling File Transfers , 1985, SIAM J. Comput..

[40]  Lucio Bianco,et al.  Scheduling Preemptive Multiprocessor Tasks on Dedicated Processors , 1994, Perform. Evaluation.

[41]  Larry Rudolph,et al.  Gang Scheduling Performance Benefits for Fine-Grain Synchronization , 1992, J. Parallel Distributed Comput..

[42]  Gerhard J. Woeginger,et al.  UET-scheduling with constrained processor allocations , 1992, Comput. Oper. Res..

[43]  Henryk Krawczyk,et al.  An Approximation Algorithm for Diagnostic Test Scheduling in Multicomputer Systems , 1985, IEEE Transactions on Computers.

[44]  Victor J. Rayward-Smith,et al.  UET scheduling with unit interprocessor communication delays , 1987, Discret. Appl. Math..

[45]  Philippe Chrétienne,et al.  C.P.M. Scheduling with Small Communication Delays and Task Duplication , 1991, Oper. Res..

[46]  Jacek Blazewicz,et al.  Scheduling Independent 2-Processor Tasks to Minimize Schedule Length , 1984, Inf. Process. Lett..

[47]  Ten-Hwang Lai,et al.  Scheduling Independent Jobs on Partitionable Hypercubes , 1991, J. Parallel Distributed Comput..

[48]  Lucio Bianco,et al.  Preemptive Scheduling of Multiprocessor Tasks on the Dedicated Processor System Subject to Minimal Lateness , 1993, Inf. Process. Lett..

[49]  Edward G. Coffman,et al.  Computer and job-shop scheduling theory , 1976 .

[50]  Uday S. Karmarkar,et al.  Simultaneous Resource Scheduling to Minimize Weighted Flow Times , 1989, Oper. Res..

[51]  Han Hoogeveen,et al.  Complexity of Scheduling Multiprocessor Tasks with Prespecified Processor Allocations , 1994, Discret. Appl. Math..

[52]  Phillip Krueger,et al.  ob Scheduling is More Important than Processor Allocation for Hypercube Computers , 1994, IEEE Trans. Parallel Distributed Syst..

[53]  Evangelos P. Markatos,et al.  Using processor affinity in loop scheduling on shared-memory multiprocessors , 1992, Supercomputing '92.

[54]  Lucio Bianco,et al.  Scheduling Independent Tasks with Multiple Modes , 1995, Discret. Appl. Math..

[55]  Günter Schmidt,et al.  Scheduling independent two processor tasks on a uniform duo-processor system , 1990, Discret. Appl. Math..

[56]  Kenneth C. Sevcik,et al.  Application Scheduling and Processor Allocation in Multiprogrammed Parallel Processing Systems , 1994, Perform. Evaluation.

[57]  Ramesh Krishnamurti.  An Approximation Algorithm for Scheduling Tasks on Varying Partition Sizes in Partitionable Multiprocessor Systems , 1992, IEEE Trans. Computers.

[58]  Zhen Liu,et al.  Scheduling multiprocessor tasks with chain constraints , 1996 .

[59]  Roman Słowiński,et al.  Advances in project scheduling , 1989 .

[60]  Marek Kubale,et al.  Preemptive versus nonpreemptive scheduling of biprocessor tasks on dedicated processors , 1996 .

[61]  Debasish Ghose,et al.  Optimal Sequencing and Arrangement in Distributed Single-Level Tree Networks with Communication Delays , 1994, IEEE Trans. Parallel Distributed Syst..

[62]  Ten-Hwang Lai,et al.  Preemptive Scheduling of Independent Jobs on a Hypercube , 1988, Inf. Process. Lett..

[63]  Sao-Jie Chen,et al.  Scheduling algorithm for nonpreemptive multiprocessor tasks , 1994 .

[64]  Lucio Bianco,et al.  Preemptive multiprocessor task scheduling with release times and time windows , 1997, Ann. Oper. Res..

[65]  Algirdas Avizienis,et al.  The STAR (Self-Testing And Repairing) Computer: An Investigation of the Theory and Practice of Fault-Tolerant Computer Design , 1971, IEEE Transactions on Computers.

[66]  Philippe Chrétienne.  Tree Scheduling with Communication Delays , 1994, Discret. Appl. Math..

[67]  Maciej Drozdowski.  On the complexity of multiprocessor task scheduling , 1995 .

[68]  G. N. Srinivasa Prasanna,et al.  Generalized multiprocessor scheduling for directed acyclic graphs , 1994, Proceedings of Supercomputing '94.

[69]  Richard C. T. Lee,et al.  On a scheduling problem where a job can be executed only by a limited number of processors , 1988, Comput. Oper. Res..

[70]  Ji.irgen PLEHN.  Preemptive Scheduling of Independent Jobs with Releas Times and Deadlines on a Hypercube , 1990, Inf. Process. Lett..

[71]  Kam-Hoi Cheng,et al.  List Scheduling of Parallel Tasks , 1991, Inf. Process. Lett..

[72]  Lucio Bianco,et al.  Linear Algorithms for Preemptive Scheduling of Multiprocessor Tasks Subject to Minimal Lateness , 1997, Discret. Appl. Math..

[73]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .