On Job Scheduling on a Hypercube

The problem of scheduling n independent jobs on an m-dimensional hypercube system to minimize the finish time is studied. Each job J/sub i/, where 1 >

[1]  Yahui Zhu,et al.  Job scheduling on a hypercube , 1990, Proceedings.,10th International Conference on Distributed Computing Systems.

[2]  David S. Johnson,et al.  Approximation Algorithms for Bin-Packing — An Updated Survey , 1984 .

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

[4]  Robert E. Tarjan,et al.  Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms , 1980, SIAM J. Comput..

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

[6]  Jeffrey D. Ullman,et al.  NP-Complete Scheduling Problems , 1975, J. Comput. Syst. Sci..

[7]  David S. Johnson,et al.  Fast Algorithms for Bin Packing , 1974, J. Comput. Syst. Sci..

[8]  Sartaj Sahni,et al.  Preemptive Scheduling with Due Dates , 1979, Oper. Res..

[9]  W. Daniel Hillis,et al.  The connection machine , 1985 .

[10]  John C. Peterson,et al.  The Mark III Hypercube-Ensemble Concurrent Computer , 1985, International Conference on Parallel Processing.

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

[12]  Yahui Zhu,et al.  Preemptive Job Scheduling on a Hypercube , 1990, ICPP.

[13]  Ming-Syan Chen,et al.  Processor Allocation in an N-Cube Multiprocessor Using Gray Codes , 1987, IEEE Transactions on Computers.

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

[15]  Ronald L. Rivest,et al.  Orthogonal Packings in Two Dimensions , 1980, SIAM J. Comput..

[16]  John P. Hayes,et al.  A Microprocessor-based Hypercube Supercomputer , 1986, IEEE Micro.

[17]  D. G. KAFURA,et al.  Task Scheduling on a Multiprocessor System with Independent Memories , 1977, SIAM J. Comput..

[18]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[19]  Charles U. Martel.  Preemptive Scheduling to Minimize Maximum Completion Time on Uniform Processors with Memory Constraints , 1985, Oper. Res..

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

[21]  Edward G. Coffman,et al.  Bin packing with divisible item sizes , 1987, J. Complex..

[22]  Ten-Hwang Lai,et al.  Scheduling Independent Jobs on Hypercubes , 1988, STACS.

[23]  Ellis Horowitz,et al.  Fundamentals of Data Structures , 1984 .

[24]  Jair M. Babad.  A record and file partitioning model , 1977, CACM.

[25]  Nimrod Megiddo.  Combinatorial Optimization with Rational Objective Functions , 1979, Math. Oper. Res..