Dynamic scheduling on parallel machines

The problem of online job scheduling on various parallel architectures is studied. An O((log log n)/sup 1/2/)-competitive algorithm for online dynamic scheduling on an n*n mesh is given. It is proved that this algorithm is optimal up to a constant factor. The algorithm is not greedy, and the lower bound proof shows that no greedy-like algorithm can be very good. The upper bound result can be generalized to any fixed-dimensional meshes. Competitive scheduling algorithms for other architectures are given.<<ETX>>

[1]  Abhiram G. Ranade,et al.  How to emulate shared memory (Preliminary Version) , 1987, FOCS.

[2]  Abraham Silberschatz,et al.  Operating System Concepts , 1983 .

[3]  David P. Williamson,et al.  Scheduling parallel machines on-line , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[4]  David P. Williamson,et al.  On-Line Scheduling of Parallel Machines , 1990 .

[5]  Larry Rudolph,et al.  Wasted resources in gang scheduling , 1990, Proceedings of the 5th Jerusalem Conference on Information Technology, 1990. 'Next Decade in Information Technology'.

[6]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

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

[8]  Edward G. Coffman,et al.  Dynamic Bin Packing , 1983, SIAM J. Comput..

[9]  H. T. Kung,et al.  Computational models for parallel computers , 1988, Philosophical Transactions of the Royal Society of London. Series A, Mathematical and Physical Sciences.

[10]  Jeffrey M. Jaffe,et al.  Algorithms for Scheduling Tasks on Unrelated Processors , 1981, JACM.

[11]  Jan Karel Lenstra,et al.  Approximation algorithms for scheduling unrelated parallel machines , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[12]  Arnold L. Rosenberg,et al.  Optimal simulations by Butterfly Networks , 1988, STOC '88.

[13]  Mikhail J. Atallah,et al.  Optimal simulations between mesh-connected arrays of processors , 1986, STOC '86.

[14]  Ronald L. Graham,et al.  Bounds for certain multiprocessing anomalies , 1966 .

[15]  Richard M. Karp,et al.  A Survey of Parallel Algorithms for Shared-Memory Machines , 1988 .