The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (2008 vol.19)
pp: 698-709
ABSTRACT
Multiple applications that execute concurrently on heterogeneous platforms compete for CPU and network resources. In this paper we consider the problem of fairly and efficiently scheduling Bags of Tasks applications on a distributed network of processors organized as a tree. The goal of scheduling is to maximize throughput of each application while ensuring a fair sharing of resources between applications. We particularly investigate decentralized schedulers that use only local information at each participating resource and we assess their performance via simulation, and compare to an optimal centralized solution obtained via linear programming.
INDEX TERMS
Distributed architectures, Scheduling and task partitioning, Linear programming
CITATION
Olivier Beaumont, Larry Carter, Jeanne Ferrante, Arnaud Legrand, Loris Marchal, Yves Robert, "Centralized versus Distributed Schedulers for Bag-of-Tasks Applications", IEEE Transactions on Parallel & Distributed Systems, vol.19, no. 5, pp. 698-709, May 2008, doi:10.1109/TPDS.2007.70747
REFERENCES
[1] Berkeley Open Infrastructure for Network Computing, http:/boinc.berkeley.edu, 2007.
[2] O. Beaumont, L. Carter, J. Ferrante, A. Legrand, L. Marchal, and Y. Robert, “Scheduling Multiple Bags of Tasks on Heterogeneous Master-Worker Platforms: Centralized versus Distributed Solutions,” Technical Report 2005-45, LIP, Sept. 2005.
[3] A. Legrand, L. Marchal, and H. Casanova, “Scheduling Distributed Applications: The SimGrid Simulation Framework,” Proc. Third IEEE Int'l Symp. Cluster Computing and the Grid (CCGrid '03), May 2003.
[4] SETI, http:/setiathome.ssl.berkeley.edu, 2007.
[5] J. Cowie, B. Dodson, R.-M. Elkenbracht-Huizing, A.K. Lenstra, P.L. Montgomery, and J. Zayer, “A World Wide Number Field Sieve Factoring Record: On to 512 Bits,” Advances in Cryptology— Proc. Int'l Conf. Theory and Applications of Cryptology and Information Security (Asiacrypt '96), pp. 382-394, 1996.
[6] Prime, http:/www.mersenne.org, 2007.
[7] Entropia, http:/www.entropia.com, 2007.
[8] M. Litzkow, M. Livny, and M.W. Mutka, “Condor—A Hunter of Idle Workstations,” Proc. Eighth Int'l Conf. Distributed Computing Systems (ICDCS '88), pp. 104-111, 1988.
[9] F. Berman, R. Wolski, H. Casanova, W. Cirne, H. Dail, M. Faerman, S. Figueira, J. Hayes, G. Obertelli, J. Schopf, G. Shao, S. Smallen, N. Spring, A. Su, and D. Zagorodnov, “Adaptive Computing on the Grid Using AppLeS,” IEEE Trans. Parallel and Distributed Systems, vol. 14, no. 4, pp. 369-382, Apr. 2003.
[10] H. Casanova and F. Berman, “Parameter Sweeps on the Grid with APST,” Grid Computing, F. Berman, G. Fox, and T. Hey, eds. John Wiley & Sons, 2002.
[11] J. Frey, T. Tannenbaum, I. Foster, M. Livny, and S. Tuecke, “Condor-G: A Computation Management Agent for Multi-Institutional Grids,” Proc. 10th IEEE Symp. High Performance Distributed Computing (HPDC-10 '01), Aug. 2001.
[12] W. Cirne, D. Paranhos, L. Costa, E. Santos-Neto, F. Brasileiro, J. Sauvé, F.A.B. da Silva, C.O. Barros, and C. Silveira, “Running Bag-of-Tasks Applications on Computational Grids: The MyGrid Approach,” Proc. 32nd Int'l Conf. Parallel Processing (ICCP '03), Oct. 2003.
[13] M.R. Garey and D.S. Johnson, Computers and Intractability, a Guide to the Theory of NP-Completeness. W.H. Freeman, 1979.
[14] B.A. Shirazi, A.R. Hurson, and K.M. Kavi, Scheduling and Load Balancing in Parallel and Distributed Systems. IEEE CS Press, 1995.
[15] Scheduling Theory and its Applications, P. Chrétienne, E. G. Coffman Jr., J.K. Lenstra, and Z. Liu, eds. John Wiley & Sons, 1995.
[16] D. Bertsimas and D. Gamarnik, “Asymptotically Optimal Algorithm for Job Shop Scheduling and Packet Routing,” J. Algorithms, vol. 33, no. 2, pp. 296-318, 1999.
[17] O. Beaumont, A. Legrand, L. Marchal, and Y. Robert, “Steady-State Scheduling on Heterogeneous Clusters,” Int'l J. Foundations of Computer Science, vol. 16, no. 2, pp. 163-194, 2005.
[18] O. Beaumont, L. Carter, J. Ferrante, A. Legrand, and Y. Robert, “Bandwidth-Centric Allocation of Independent Tasks on Heterogeneous Platforms,” Proc. 16th Int'l Parallel and Distributed Processing Symp. (IPDPS), 2002.
[19] C. Banino, O. Beaumont, L. Carter, J. Ferrante, A. Legrand, and Y. Robert, “Scheduling Strategies for Master-Slave Tasking on Heterogeneous Processor Platforms,” IEEE Trans. Parallel and Distributed Systems, vol. 15, no. 4, pp. 319-330, Apr. 2004.
[20] B. Kreaseck, “Dynamic Autonomous Scheduling on Heterogeneous Systems,” PhD dissertation, Univ. of California, San Diego, 2003.
[21] L. Carter, H. Casanova, J. Ferrante, and B. Kreaseck, “Autonomous Protocols for Bandwidth-Centric Scheduling of Independent-Task Applications,” Proc. 17th Int'l Parallel and Distributed Processing Symp. (IPDPS), 2003.
[22] B. Hong and V. Prasanna, “Distributed Adaptive Task Allocation in Heterogeneous Computing Environments to Maximize Throughput,” Proc. 18th Int'l Parallel and Distributed Processing Symp. (IPDPS), 2004.
[23] M. Mowbrayy, F. Brasileiroz, N. Andradez, J. Santanaz, and W. Cirnez, “Reciprocation-Based Economy for Multiple Services in Peer-to-Peer Grids,” Proc. Sixth IEEE Int'l Conf. Peer-to-Peer Computing (P2P '06), Sept. 2006.
[24] T. Bonald and L. Massoulié, “Impact of Fairness on Internet Performance,” Proc. ACM SIGMETRICS/Performance '01, pp. 82-91, 2001.
[25] L. Massoulié and J. Roberts, “Bandwidth Sharing: Objectives and Algorithms,” IEEE/ACM Trans. Networking, vol. 10, no. 3, pp. 320-328, June 2002.
[26] P. Bhat, C. Raghavendra, and V. Prasanna, “Efficient Collective Communication in Distributed Heterogeneous Systems,” Proc. 19th Int'l Conf. Distributed Computing Systems (ICDCS '99), pp. 15-24, 1999.
[27] P. Bhat, C. Raghavendra, and V. Prasanna, “Efficient Collective Communication in Distributed Heterogeneous Systems,” J. Parallel and Distributed Computing, vol. 63, pp. 251-263, 2003.
[28] O. Beaumont, A. Legrand, L. Marchal, and Y. Robert, “Pipelining Broadcasts on Heterogeneous Platforms,” IEEE Trans. Parallel and Distributed Systems, vol. 16, no. 4, pp. 300-313, Apr. 2005.
[29] O. Beaumont and L. Marchal, “Pipelining Broadcasts on Heterogeneous Platforms under the One-Port Model,” Research Report RR-2004-36, LIP, ENS Lyon, France, July 2004.
[30] D. Bertsekas and R. Gallager, Data Networks. Prentice Hall, 1987.
[31] O. Beaumont, A. Legrand, L. Marchal, and Y. Robert, “Independent and Divisible Tasks Scheduling on Heterogeneous Star-Shaped Platforms with Limited Memory,” Proc. 13th Euromicro Workshop Parallel, Distributed and Network-Based Processing (PDP '05), pp. 179-186, 2005.
[32] O. Beaumont, V. Boudet, A. Petitet, F. Rastello, and Y. Robert, “A Proposal for a Heterogeneous Cluster ScaLAPACK (Dense Linear Solvers),” IEEE Trans. Computers, vol. 50, no. 10, pp. 1052-1070, Oct. 2001.
[33] R. Jay, The Art of Computer Systems Performance Analysis : Techniques for Experimental Design, Measurement, Simulation, and Modeling. John Wiley & Sons, 1991.
[34] F. Berman and R. Wolski, “TheAppLeS Project: A Status Report,” Proc. Eighth NEC Research Symp., http://www.gcl.ucsd.edu/hetpubs.html#AppLeS , 1997.
[35] J.F. Nash, “Equilibrium Points in N-Person Games,” Proc. Nat'l Academy of Sciences USA, vol. 36, pp. 48-49, 1950.
[36] A. Legrand and C. Touati, “Non-Cooperative Scheduling of Multiple Bag-of-Task Applications,” Proc. IEEE INFOCOM '07, 2007.
[37] H. Yaïche, R.R. Mazumdar, and C. Rosenberg, “A Game Theoretic Framework for Bandwidth Allocation and Pricing in Broadband Networks,” IEEE/ACM Trans. Networking, vol. 8, no. 5, pp. 667-678, 2000.
18 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool