[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science (1991)

San Juan, Puerto Rico

Oct. 1, 1991 to Oct. 4, 1991

ISBN: 0-8186-2445-0

pp: 111-120

S. Feldmann , Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA

J. Sgall , Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA

S.-H. Teng , Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA

ABSTRACT

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.

INDEX TERMS

fixed-dimensional meshes, dynamic scheduling, parallel machines, online job scheduling, parallel architectures, lower bound proof, upper bound

CITATION

S. Teng, J. Sgall and S. Feldmann, "Dynamic scheduling on parallel machines,"

*[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science(FOCS)*, San Juan, Puerto Rico, 1991, pp. 111-120.

doi:10.1109/SFCS.1991.185355

CITATIONS