
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Olivier Beaumont, Larry Carter, Jeanne Ferrante, Arnaud Legrand, Loris Marchal, Yves Robert, "Centralized versus Distributed Schedulers for BagofTasks Applications," IEEE Transactions on Parallel and Distributed Systems, vol. 19, no. 5, pp. 698709, May, 2008.  
BibTex  x  
@article{ 10.1109/TPDS.2007.70747, author = {Olivier Beaumont and Larry Carter and Jeanne Ferrante and Arnaud Legrand and Loris Marchal and Yves Robert}, title = {Centralized versus Distributed Schedulers for BagofTasks Applications}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {19}, number = {5}, issn = {10459219}, year = {2008}, pages = {698709}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2007.70747}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Centralized versus Distributed Schedulers for BagofTasks Applications IS  5 SN  10459219 SP698 EP709 EPD  698709 A1  Olivier Beaumont, A1  Larry Carter, A1  Jeanne Ferrante, A1  Arnaud Legrand, A1  Loris Marchal, A1  Yves Robert, PY  2008 KW  Distributed architectures KW  Scheduling and task partitioning KW  Linear programming VL  19 JA  IEEE Transactions on Parallel and Distributed Systems ER   
[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 MasterWorker Platforms: Centralized versus Distributed Solutions,” Technical Report 200545, 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. ElkenbrachtHuizing, 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. 382394, 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. 104111, 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. 369382, 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, “CondorG: A Computation Management Agent for MultiInstitutional Grids,” Proc. 10th IEEE Symp. High Performance Distributed Computing (HPDC10 '01), Aug. 2001.
[12] W. Cirne, D. Paranhos, L. Costa, E. SantosNeto, F. Brasileiro, J. Sauvé, F.A.B. da Silva, C.O. Barros, and C. Silveira, “Running BagofTasks 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 NPCompleteness. 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. 296318, 1999.
[17] O. Beaumont, A. Legrand, L. Marchal, and Y. Robert, “SteadyState Scheduling on Heterogeneous Clusters,” Int'l J. Foundations of Computer Science, vol. 16, no. 2, pp. 163194, 2005.
[18] O. Beaumont, L. Carter, J. Ferrante, A. Legrand, and Y. Robert, “BandwidthCentric 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 MasterSlave Tasking on Heterogeneous Processor Platforms,” IEEE Trans. Parallel and Distributed Systems, vol. 15, no. 4, pp. 319330, 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 BandwidthCentric Scheduling of IndependentTask 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, “ReciprocationBased Economy for Multiple Services in PeertoPeer Grids,” Proc. Sixth IEEE Int'l Conf. PeertoPeer Computing (P2P '06), Sept. 2006.
[24] T. Bonald and L. Massoulié, “Impact of Fairness on Internet Performance,” Proc. ACM SIGMETRICS/Performance '01, pp. 8291, 2001.
[25] L. Massoulié and J. Roberts, “Bandwidth Sharing: Objectives and Algorithms,” IEEE/ACM Trans. Networking, vol. 10, no. 3, pp. 320328, 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. 1524, 1999.
[27] P. Bhat, C. Raghavendra, and V. Prasanna, “Efficient Collective Communication in Distributed Heterogeneous Systems,” J. Parallel and Distributed Computing, vol. 63, pp. 251263, 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. 300313, Apr. 2005.
[29] O. Beaumont and L. Marchal, “Pipelining Broadcasts on Heterogeneous Platforms under the OnePort Model,” Research Report RR200436, 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 StarShaped Platforms with Limited Memory,” Proc. 13th Euromicro Workshop Parallel, Distributed and NetworkBased Processing (PDP '05), pp. 179186, 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. 10521070, 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 NPerson Games,” Proc. Nat'l Academy of Sciences USA, vol. 36, pp. 4849, 1950.
[36] A. Legrand and C. Touati, “NonCooperative Scheduling of Multiple BagofTask 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. 667678, 2000.