The master-slave paradigm with heterogeneous processors

We revisit the master-slave tasking paradigm in the context of heterogeneous processors. We assume that communications are handled by a bus and, therefore, at most one communication can take place at a given time step. We present a polynomial algorithm that gives the optimal solution when a single communication is needed before the execution of the tasks on the slave processors. When communications are required both before and after the processing of the tasks, we show that the problem is strongly NP-complete. In this case, we present a guaranteed approximation algorithm. Finally, we present asymptotically optimal algorithms when communications are required before the processing of each task, or both before and after the processing of each task.

[1]  Snezana Lawrence.  October , 1855, The Hospital.

[2]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

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

[4]  Michel Minoux,et al.  Graphs and Algorithms , 1984 .

[5]  M. F.,et al.  Bibliography , 1985, Experimental Gerontology.

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

[7]  Jack Dongarra,et al.  PVM: Parallel virtual machine: a users' guide and tutorial for networked parallel computing , 1995 .

[8]  Wenci Yu,et al.  The two-machine flow shop problem with delays and the one-machine total tardiness problem , 1996 .

[9]  Hochang Lee,et al.  A Hybrid Bounding Procedure for the Workload Allocation Problem on Parallel Unrelated Machines with Setups , 1996 .

[10]  Debasish Ghose,et al.  Scheduling Divisible Loads in Parallel and Distributed Systems , 1996 .

[11]  Kathryn Fraughnaugh,et al.  Introduction to graph theory , 1973, Mathematical Gazette.

[12]  Svetlana A. Kravchenko,et al.  Parallel machine scheduling problems with a single server , 1997 .

[13]  Stephen Taylor,et al.  A Practical Approach to Dynamic Load Balancing , 1998, IEEE Trans. Parallel Distributed Syst..

[14]  Thomas G. Robertazzi,et al.  Optimizing Computing Costs Using Divisible Load Analysis , 1998, IEEE Trans. Parallel Distributed Syst..

[15]  Joel R. Stiles,et al.  Monte Carlo simulation of neuro-transmitter release using MCell, a general simulator of cellular physiological processes , 1998 .

[16]  Yves Robert,et al.  Algorithmic Issues on Heterogeneous Computing Platforms , 1999, Parallel Process. Lett..

[17]  Thomas G. Robertazzi,et al.  Parallel Processor Configuration Design with Processing/Transmission Costs , 2000, IEEE Trans. Computers.

[18]  Chelliah Sriskandarajah,et al.  Parallel machine scheduling with a common server , 2000, Discret. Appl. Math..

[19]  Yves Robert,et al.  Matrix-matrix multiplication on heterogeneous platforms , 2000, Proceedings 2000 International Conference on Parallel Processing.

[20]  Yves Robert,et al.  The Master-Slave Paradigm with Heterogeneous Processors , 2001, CLUSTER.

[21]  Yves Robert,et al.  A Proposal for a Heterogeneous Cluster ScaLAPACK (Dense Linear Solvers) , 2001, IEEE Trans. Computers.

[22]  Rajkumar Buyya,et al.  2001 IEEE International Conference on Cluster Computing , 2001 .

[23]  Peter Brucker,et al.  Complexity results for parallel machine problems with a single server , 2002 .

[24]  Larry Carter,et al.  Bandwidth-centric allocation of independent tasks on heterogeneous platforms , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.