Selected problems of scheduling tasks in multiprocessor computer systems

[1]  John L. Gustafson,et al.  Reevaluating Amdahl's law , 1988, CACM.

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

[3]  Thomas G. Robertazzi,et al.  Ultimate performance limits for networks of load sharing processors , 1992 .

[4]  Edward McLellan.  The Alpha AXP architecture and 21064 processor , 1993, IEEE Micro.

[5]  Ten-Hwang Lai,et al.  The Complexity of Congestion-1 Embedding in a Hypercube , 1991, J. Algorithms.

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

[7]  Susanne E. Hambrusch,et al.  Embedding Complete Binary Trees into Butterfly Networks , 1991, IEEE Trans. Computers.

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

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

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

[11]  Kai Hwang,et al.  Advanced computer architecture - parallelism, scalability, programmability , 1992 .

[12]  Roger W. Hockney,et al.  The Communication Challenge for MPP: Intel Paragon and Meiko CS-2 , 1994, Parallel Computing.

[13]  Charles L. Seitz,et al.  The cosmic cube , 1985, CACM.

[14]  David J. Kuck,et al.  A Survey of Parallel Machine Organization and Programming , 1977, CSUR.

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

[16]  Thomas G. Robertazzi,et al.  A Multi-Job Load Sharing Strategy for Divisible Jobs on Bus Networks , 1993 .

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

[18]  SahniSartaj,et al.  Preemptive Scheduling of Uniform Processor Systems , 1978 .

[19]  Jake K. Aggarwal,et al.  A Generalized Scheme for Mapping Parallel Algorithms , 1993, IEEE Trans. Parallel Distributed Syst..

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

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

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

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

[24]  Klaus H. Ecker,et al.  Scheduling Computer and Manufacturing Processes , 2001 .

[25]  A. L. Decegama.  The Technology of Parallel Processing , 1989 .

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

[27]  Philippe Chrétienne.  Task scheduling with interprocessor communication delays , 1992 .

[28]  Multiprocessors.  Using Processor A � nity in Loop Scheduling on Shared Memory , 1994 .

[29]  Edward G. Coffman,et al.  Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems , 1970, JACM.

[30]  Vangelis F. Magirou,et al.  An algorithm for the multiprocessor assignment problem , 1989 .

[31]  Jadranka Skorin-Kapov,et al.  Tabu Search Applied to the Quadratic Assignment Problem , 1990, INFORMS J. Comput..

[32]  David W. Walker,et al.  The Design of a Standard Message Passing Interface for Distributed Memory Concurrent Computers , 1994, Parallel Comput..

[33]  Frank Thomson Leighton,et al.  Methods for message routing in parallel machines , 1992, STOC '92.

[34]  Peter J. Denning,et al.  Operating Systems Theory , 1973 .

[35]  Frédéric Guinand.  Ordonnancement avec communications pour architectures multiprocesseurs dans divers modèles d'exécution , 1995 .

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

[37]  Angel L. DeCegama,et al.  The technology of parallel processing: parallel processing architectures and VLSI hardware (vol. 1) , 1989 .

[38]  Zhen Liu,et al.  Scheduling of Parallel Programs in Single-Bus Multiprocessor Systems , 1994 .

[39]  Peter Brucker,et al.  Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems , 1996 .

[40]  Robert McNaughton,et al.  Scheduling with Deadlines and Loss Functions , 1959 .

[41]  Tilak Agerwala,et al.  SP2 System Architecture , 1999, IBM Syst. J..

[42]  Reinhard Lüling,et al.  Load balancing for distributed branch & bound algorithms , 1992, Proceedings Sixth International Parallel Processing Symposium.

[43]  T. Shepard,et al.  A Pre-Run-Time Scheduling Algorithm For Hard Real-Time Systems , 1991, IEEE Trans. Software Eng..

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

[45]  Wieslaw Kubiak,et al.  Scheduling parallel tasks withsequential heads and tails , 1999, Ann. Oper. Res..

[46]  Satish K. Tripathi,et al.  The Processor Working Set and Its Use in Scheduling Multiprocessor Systems , 1991, IEEE Trans. Software Eng..

[47]  Masahiro Tsuchiya,et al.  A Task Allocation Model for Distributed Computing Systems , 1982, IEEE Transactions on Computers.

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

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

[50]  Michael A. Driscoll,et al.  Accurate Predictions of Parallel Program Execution Time , 1995, J. Parallel Distributed Comput..

[51]  G. Amdhal,et al.  Validity of the single processor approach to achieving large scale computing capabilities , 1967, AFIPS '67 (Spring).

[52]  Steven J. Plimpton,et al.  Massively parallel methods for engineering and science problems , 1994, CACM.

[53]  Jack J. Dongarra,et al.  The PVM Concurrent Computing System: Evolution, Experiences, and Trends , 1994, Parallel Comput..

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

[55]  Thomas G. Robertazzi,et al.  An optimum load sharing strategy for divisible jobs with time-varying processor and channel speed , 1995 .

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

[57]  John A. Ellis.  Embedding Rectangular Grids into Square Grids , 1988, AWOC.

[58]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[59]  Eugene L. Lawler,et al.  Sequencing and scheduling: algorithms and complexity , 1989 .

[60]  Christophe Picouleau.  New Complexity Results on Scheduling with Small Communication Delays , 1995, Discret. Appl. Math..

[61]  Debasish Ghose,et al.  An efficient load distribution strategy for a distributed linear network of processors with communication delays , 1995 .

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

[63]  Denis Trystram,et al.  Implementation of Parallel Numerical Routines Using Broadcast Communication Schemes , 1990, CONPAR.

[64]  Thomas G. Robertazzi,et al.  Distributed computation for a tree network with communication delays , 1990 .

[65]  Thomas G. Robertazzi,et al.  Optimal load sharing for a divisible job on a bus network , 1992 .

[66]  Jan Karel Lenstra,et al.  The Complexity of Scheduling Trees with Communication Delays , 1996, J. Algorithms.

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

[68]  Fred Douglis,et al.  Transparent process migration: Design alternatives and the sprite implementation , 1991, Softw. Pract. Exp..

[69]  Debasish Ghose,et al.  Distributed Computation with Communication Delays: Asymptotic Performance Analysis , 1994, J. Parallel Distributed Comput..

[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]  Thomas G. Robertazzi,et al.  Optimizing Computing Costs Using Divisible Load Analysis , 1998, IEEE Trans. Parallel Distributed Syst..

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

[74]  Debasish Ghose,et al.  Multi-installment load distribution in tree networks with delays , 1995 .

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

[76]  Teofilo F. Gonzalez,et al.  Preemptive Scheduling of Uniform Processor Systems , 1978, JACM.

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

[78]  Thomas Kunz,et al.  The Influence of Different Workload Descriptions on a Heuristic Load Balancing Scheme , 1991, IEEE Trans. Software Eng..

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

[80]  Andreas Jakoby,et al.  The Complexity of Scheduling Problems with Communication Delays for Trees , 1992, SWAT.

[81]  Mihalis Yannakakis,et al.  Towards an architecture-independent analysis of parallel algorithms , 1990, STOC '88.

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

[83]  D WilliamsRoy.  Performance of dynamic load balancing algorithms for unstructured mesh calculations , 1991 .

[84]  Wolfgang Schrr Oder-Preikschat,et al.  Design Principles of Parallel Operating Systems ? , 1993 .

[85]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

[87]  Michael J. Flynn,et al.  Very high-speed computing systems , 1966 .

[88]  Marco Spuri,et al.  Implications of Classical Scheduling Results for Real-Time Systems , 1995, Computer.

[89]  Frank D. Anger,et al.  Scheduling Precedence Graphs in Systems with Interprocessor Communication Times , 1989, SIAM J. Comput..

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

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

[92]  Maciej Drozdowski,et al.  Scheduling multiprocessor tasks -- An overview , 1996 .

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

[94]  Pascal Bouvry,et al.  personal communication , 1993 .

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

[96]  T. Kunz.  The Innuence of Diierent Workload Descriptions on a Heuristic Load Balancing Scheme the Innuence of Diierent Workload Descriptions on a Heuristic Load Balancing Scheme , 2007 .

[97]  David Gelernter,et al.  The Linda® Alternative to Message-Passing Systems , 1994, Parallel Comput..

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

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

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

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

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

[103]  Hyeong-Ah Choi,et al.  Circuit-Switched Broadcasting in Torus and Mesh Networks , 1996, IEEE Trans. Parallel Distributed Syst..

[104]  Thomas G. Robertazzi,et al.  Bus-oriented load sharing for a network of sensor driven processors , 1991, IEEE Trans. Syst. Man Cybern..

[105]  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.

[106]  Wolfgang K. Giloi,et al.  Parallel Supercomputer Architectures and their Programming Models , 1994, Parallel Comput..

[107]  Roger W. Hockney,et al.  Performance parameters and benchmarking of supercomputers , 1991, Parallel Comput..

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

[109]  Andrew S. Grimshaw,et al.  Metasystems: An Approach Combining Parallel Processing and Heterogeneous Distributed Computing Systems , 1994, J. Parallel Distributed Comput..

[110]  Roy D. Williams,et al.  Performance of dynamic load balancing algorithms for unstructured mesh calculations , 1991, Concurr. Pract. Exp..

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

[112]  C. C. Price,et al.  Optimal task allocation in hypercube multiprocessor ensembles , 1993 .

[113]  Jian Xu,et al.  Heuristic methods for dynamic load balancing in a message-passing supercomputer , 1990, Proceedings SUPERCOMPUTING '90.

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

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

[116]  Charles E. Leiserson,et al.  Fat-trees: Universal networks for hardware-efficient supercomputing , 1985, IEEE Transactions on Computers.

[117]  Vipin Kumar,et al.  Analysis of scalability of parallel algorithms and architectures: a survey , 1991, ICS '91.

[118]  Evripidis Bampis,et al.  Optimal Parallel Execution of Complete Binary Trees and Grids Into Most Popular Interconnection Networks , 1994, Theor. Comput. Sci..

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

[120]  Lionel M. Ni,et al.  A survey of wormhole routing techniques in direct networks , 1993, Computer.

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

[122]  Donald B. Alpert,et al.  Architecture of the Pentium microprocessor , 1993, IEEE Micro.

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

[124]  Joseph G. Peters,et al.  Circuit-Switched Broadcasting in Torus Networks , 1996, IEEE Trans. Parallel Distributed Syst..

[125]  Chien-Chung Shen,et al.  A Graph Matching Approach to Optimal Task Assignment in Distributed Computing Systems Using a Minimax Criterion , 1985, IEEE Trans. Computers.

[126]  Peter Brucker,et al.  Shop scheduling problems with multiprocessor tasks on dedicated processors , 1995, Ann. Oper. Res..

[127]  Arthur L. Liestman,et al.  A survey of gossiping and broadcasting in communication networks , 1988, Networks.

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

[129]  C. Murray Woodside,et al.  Fast Allocation of Processes in Distributed and Parallel Systems , 1993, IEEE Trans. Parallel Distributed Syst..

[130]  Hongyi Zhou,et al.  Dynamic Scheduling of Hard Real-Time Tasks and Real-Time Threads , 1992, IEEE Trans. Software Eng..

[131]  Manoj Kumar,et al.  Measuring Parallelism in Computation-Intensive Scientific/Engineering Applications , 1988, IEEE Trans. Computers.

[132]  Matt W. Mutka.  Estimating Capacity For Sharing in a Privately Owned Workstation Environment , 1992, IEEE Trans. Software Eng..

[133]  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..

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

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

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

[137]  Thomas L. Casavant,et al.  A Taxonomy of Scheduling in General-Purpose Distributed Computing Systems , 1988, IEEE Trans. Software Eng..

[138]  Maw-Sheng Chern,et al.  An LC Branch-and-Branch Algorithm for the Module Assignment Problem , 1989, Inf. Process. Lett..

[139]  Roy E. Marsten,et al.  Feature Article - Interior Point Methods for Linear Programming: Computational State of the Art , 1994, INFORMS J. Comput..

[140]  Thomas G. Robertazzi,et al.  Closed Form Solutions for Bus and Tree Networks of Processors Load Sharing A Divisible Job , 1993, 1993 International Conference on Parallel Processing - ICPP'93.

[141]  P. Chrétienne.  A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints , 1989 .

[142]  Wolfgang A. Halang,et al.  Real-time systems - implementation of industrial computerised process automation , 1992 .

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

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

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

[146]  D. Parnas,et al.  On satisfying timing constraints in hard-real-time systems , 1991, SIGSOFT '91.

[147]  Victor J. Rayward-Smith,et al.  The Complexity of Preemptive Scheduling Given Interprocessor Communication Delays , 1987, Inf. Process. Lett..

[148]  Michael J. Fischer,et al.  Boolean Matrix Multiplication and Transitive Closure , 1971, SWAT.

[149]  Yousef Saad,et al.  Data communication in parallel architectures , 1989, Parallel Comput..

[150]  Andrew S. Tanenbaum,et al.  Distributed operating systems , 2009, CSUR.

[151]  B. Clifford Neuman,et al.  The Prospero Resource Manager: A scalable framework for processor allocation in distributed systems , 1994, Concurr. Pract. Exp..

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

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

[154]  Bhagirath Narahari,et al.  An Approximation Algorithm for Preemptive Scheduling on Parallel-Task Systems , 1995, SIAM J. Discret. Math..

[155]  J. R. Zirbas,et al.  Measuring the scalability of parallel computer systems , 1989, Proceedings of the 1989 ACM/IEEE Conference on Supercomputing (Supercomputing '89).

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

[157]  Thomas G. Robertazzi.  Processor equivalence for a linear daisy chain of load sharing processors , 1992 .

[158]  Craig B. Stunkel,et al.  The SP1 high-performance switch , 1994, Proceedings of IEEE Scalable High Performance Computing Conference.

[159]  Debasish Ghose,et al.  Distributed computation in linear networks: closed-form solutions , 1994 .

[160]  M Ben Ahmed,et al.  Programming parallel processors , 1990 .

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

[162]  Masafumi Yamashita,et al.  Graph endpoint coloring and distributed processing , 1993, Networks.