This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Scheduling Strategies for Master-Slave Tasking on Heterogeneous Processor Platforms
April 2004 (vol. 15 no. 4)
pp. 319-330

Abstract—In this paper, we consider the problem of allocating a large number of independent, equal-sized tasks to a heterogeneous computing platform. We use a nonoriented graph to model the platform, where resources can have different speeds of computation and communication. Because the number of tasks is large, we focus on the question of determining the optimal steady state scheduling strategy for each processor (the fraction of time spent computing and the fraction of time spent communicating with each neighbor). In contrast to minimizing the total execution time, which is NP-hard in most formulations, we show that finding the optimal steady state can be solved using a linear programming approach and, thus, in polynomial time. Our result holds for a quite general framework, allowing for cycles and multiple paths in the interconnection graph, and allowing for several masters. We also consider the simpler case where the platform is a tree. While this case can also be solved via linear programming, we show how to derive a closed-form formula to compute the optimal steady state, which gives rise to a bandwidth-centric scheduling strategy. The advantage of this approach is that it can directly support autonomous task scheduling based only on information local to each node; no global information is needed. Finally, we provide a theoretical comparison of the computing power of tree-based versus arbitrary platforms.

[1] M. Adler, Y. Gong, and A.L. Rosenberg, Optimal Sharing of Bags of Tasks in Heterogeneous Clusters Proc. 15th ACM Symp. Parallelism in Algorithms and Architectures, pp. 1-10, 2003.
[2] C. Banino, O. Beaumont, A. Legrand, and Y. Robert, Scheduling Strategies for Master-Slave Tasking on Heterogeneous Processor Grids Proc. Int'l Conf. Applied Parallel Computing, pp. 423-432, 2002.
[3] C. Banino, O. Beaumont, A. Legrand, and Y. Robert, Scheduling Strategies for Master-Slave Tasking on Heterogeneous Processor Grids Technical Report 2002-12, LIP, Mar. 2002.
[4] O. Beaumont, L. Carter, J. Ferrante, A. Legrand, and Y. Robert, Bandwidth-Centric Allocation of Independent Tasks on Heterogeneous Platforms Proc. Int'l Parallel and Distributed Processing Symp., 2002.
[5] O. Beaumont, A. Legrand, L. Marchal, and Y. Robert, Optimal Algorithms for the Pipelined Scheduling of Task Graphs on Heterogeneous Systems Technical Report RR-2003-29, LIP, ENS Lyon, France, May 2003.
[6] S. Charcranoon, T.G. Robertazzi, and S. Luryi, Optimizing Computing Costs Using Divisible Load Analysis IEEE Trans. Computers, vol. 49, no. 9, pp. 987-991, Sept. 2000.
[7] Scheduling Theory and Its Applications. P. Chrétienne, E.G. Coffman Jr., J.K. Lenstra, and Z. Liu, eds. John Wiley and Sons, 1995.
[8] Entropia,http:/www.entropia.com, 2003.
[9] M.R. Garey and D.S. Johnson, Computers and Intractability, A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, 1991.
[10] J. Linderoth, S. Kilkarni, J.-P. Goux, and M. Yoder, “An Enabling Framework for Master-Worker Applications on the Computational Grid,” Proc. Ninth IEEE Symp. High Performance Distributed Computing, pp. 43-50, Aug. 2000.
[11] E. Heymann, M.A. Senar, E. Luque, and M. Livny, Adaptive Scheduling for Master-Worker Applications on the Computational Grid R. Buyya and M. Baker, eds., Proc. Workshop Grid Computing, pp. 214-227, 2000.
[12] T.S. Hsu, J.C. Lee, D.R. Lopez, and W.A. Royce, Task Allocation on a Network of Processors IEEE Trans. Computers, vol. 49, no. 12, pp. 1339-1353, 2000.
[13] B. Kreaseck, L. Carter, H. Casanova, and J. Ferrante, Autonomous Protocols for Bandwidth-Centric Scheduling of Independent Task Applications Proc. Int'l Parallel and Distributed Processing Symp., 2003.
[14] A.L. Rosenberg, “Sharing Partitionable Workloads in Heterogeneous NOWs: Greedier Is not Better,” Proc. IEEE Int'l Conf. Cluster Computing, pp. 124-131, 2001.
[15] A. Schrijver, Combinatorial Optimization: Polyhedra and Efficiency Algorithms and Combinatorics, vol. 24, Springer-Verlag, 2003.
[16] SETI,http:/setiathome.ssl.berkeley.edu, 2003.
[17] G. Shao and R. Wolski, and F. Berman, “Master/Slave Computing on the Grid,” Proc. Ninth Heterogeneous Computing Workshop, pp. 3-16, May 2000.
[18] B.A. Shirazi, A.R. Hurson, and K.M. Kavi, Scheduling and Load Balancing in Parallel and Distributed Systems. IEEE Computer Science Press, 1995.
[19] O. Sinnen and L. Sousa, Comparison of Contention-Aware List Scheduling Heuristics for Cluster Computing Proc. Workshop Scheduling and Resource Management for Cluster Computing, pp. 382-387, 2001.
[20] J. Sohn, T.G. Robertazzi, and S. Luryi, Optimizing Computing Costs Using Divisible Load Analysis IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 3, pp. 225-234, Mar. 1998.
[21] H. Topcuoglu, S. Hariri, and M.-Y. Wu, Task Scheduling Algorithms for Heterogeneous Processors Proc. Eighth Heterogeneous Computing Workshop, 1999.
[22] J.B. Weissman, Scheduling Multi-Component Applications in Heterogeneous Wide-Area Networks Proc. Heterogeneous Computing Workshop, 2000.

Index Terms:
Scheduling, heterogeneous, divisible load, steady-state, bandwidth-centric.
Citation:
Cyril Banino, Olivier Beaumont, Larry Carter, Jeanne Ferrante, Arnaud Legrand, Yves Robert, "Scheduling Strategies for Master-Slave Tasking on Heterogeneous Processor Platforms," IEEE Transactions on Parallel and Distributed Systems, vol. 15, no. 4, pp. 319-330, April 2004, doi:10.1109/TPDS.2004.1271181
Usage of this product signifies your acceptance of the Terms of Use.