Optimal Scheduling of Compute-Intensive Tasks on a Network of Workstations

In a network of high performance workstations, many workstations are underutilized by their owners. The problem of using these idle cycles for solving computationally intensive tasks by executing a large task on many workstations has been addressed before and algorithms with O(N/sup 2/) time and O(N) space for choosing the optimal subset of workstations out of N workstations were presented. We improve these algorithms to reduce the running time to O(N log N), while keeping the space requirement the same. The proposed algorithms are particularly useful for SPMD parallelism where computation is the same for all workstations and the data space is partitioned between the workstations. >

[1]  Margaret A. Schaar,et al.  Performance of co-scheduling on a network of workstations , 1993, [1993] Proceedings. The 13th International Conference on Distributed Computing Systems.

[2]  Çetin Kaya Koç,et al.  Parallel matrix multiplication on networked microcomputers , 1992 .

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

[4]  Leonard Kleinrock,et al.  Collecting Unused Processing Capacity: An Analysis of Transient Distributed Systems , 1993, IEEE Trans. Parallel Distributed Syst..

[5]  R. Chawla,et al.  The Stealth distributed scheduler , 1991, [1991] Proceedings. 11th International Conference on Distributed Computing Systems.

[6]  John K. Ousterhout.  Scheduling Techniques for Concurrebt Systems. , 1982, ICDCS 1982.

[7]  Andrew S. Tanenbaum,et al.  An overview of the Amoeba distributed operating system , 1981, OPSR.

[8]  Robert B. Hagmann,et al.  Process Server: Sharing Processing Power in a Workstation Environment , 1986, ICDCS.

[9]  Donald F. Towsley,et al.  Imbedding gradient estimators in load balancing algorithms , 1988, [1988] Proceedings. The 8th International Conference on Distributed.

[10]  Bruce M. McMillin,et al.  DAWGS - A Distributed Compute Server Utilizing Idle Workstations , 1992, J. Parallel Distributed Comput..

[11]  Stanley B. Gershwin,et al.  Hierarchical flow control: a framework for scheduling and planning discrete events in manufacturing systems , 1989, Proc. IEEE.

[12]  Duncan A. Mellichamp,et al.  Job Scheduling in a Single-Node Hierarchical Network for Process Control , 1980, IEEE Transactions on Computers.

[13]  Fred Douglis,et al.  Process Migration in the Sprite Operating System , 1987, ICDCS.

[14]  Weijia Shang,et al.  Independent Partitioning of Algorithms with Uniform Dependencies , 1992, IEEE Trans. Computers.

[15]  Andrew R. Cherenson,et al.  The Sprite network operating system , 1988, Computer.

[16]  Monica S. Lam,et al.  Heterogeneous parallel programming in Jade , 1992, Proceedings Supercomputing '92.