
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Anne Benoit, Loris Marchal, JeanFrançois Pineau, Yves Robert, Frédéric Vivien, "Scheduling Concurrent BagofTasks Applications on Heterogeneous Platforms," IEEE Transactions on Computers, vol. 59, no. 2, pp. 202217, February, 2010.  
BibTex  x  
@article{ 10.1109/TC.2009.117, author = {Anne Benoit and Loris Marchal and JeanFrançois Pineau and Yves Robert and Frédéric Vivien}, title = {Scheduling Concurrent BagofTasks Applications on Heterogeneous Platforms}, journal ={IEEE Transactions on Computers}, volume = {59}, number = {2}, issn = {00189340}, year = {2010}, pages = {202217}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2009.117}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Scheduling Concurrent BagofTasks Applications on Heterogeneous Platforms IS  2 SN  00189340 SP202 EP217 EPD  202217 A1  Anne Benoit, A1  Loris Marchal, A1  JeanFrançois Pineau, A1  Yves Robert, A1  Frédéric Vivien, PY  2010 KW  Scheduling and task partitioning KW  online computation KW  parallelism and concurrency KW  measurement KW  evaluation KW  modeling KW  simulation of multipleprocessor systems. VL  59 JA  IEEE Transactions on Computers ER   
[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 (SPAA '03), pp. 110, 2003.
[2] H. Casanova and F. Berman, “Parameter Sweeps on the Grid with APST,” Proc. Grid Computing: Making the Global Infrastructure a Reality, F. Berman, G. Fox, and T. Hey, eds., 2003.
[3] “BOINC: Berkeley Open Infrastructure for Network Computing,” http:/boinc.berkeley.edu, 2009.
[4] 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.
[5] J. Dongarra, J.F. Pineau, Y. Robert, and F. Vivien, “Matrix Product on Heterogeneous MasterWorker Platforms,” Proc. ACM SIGPLAN, pp. 5362, 2008.
[6] T. Yang and A. Gerasoulis, “DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors,” IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 9, pp. 951967, Sept. 1994.
[7] P. Brucker, Scheduling Algorithms. SpringerVerlag, 2004.
[8] H. Topcuoglu, S. Hariri, and M.Y. Wu, “PerformanceEffective and LowComplexity Task Scheduling for Heterogeneous Computing,” IEEE Trans. Parallel and Distributed Systems, vol. 13, no. 3, pp. 260274, Mar. 2002.
[9] B. Hong and V. Prasanna, “Distributed Adaptive Task Allocation in Heterogeneous Computing Environments to Maximize Throughput,” Proc. Int'l Symp. Parallel and Distributed Processing (IPDPS '04), 2004.
[10] P. Bhat, C. Raghavendra, and V. Prasanna, “Efficient Collective Communication in Distributed Heterogeneous Systems,” Proc. IEEE Int'l Conf. Distributed Computing Systems (ICDCS '99), pp. 1524, 1999.
[11] P. Bhat, C. Raghavendra, and V. Prasanna, “Efficient Collective Communication in Distributed Heterogeneous Systems,” J. Parallel and Distributed Computing, vol. 63, no. 3, pp. 251263, 2003.
[12] T. Saif and M. Parashar, “Understanding the Behavior and Performance of NonBlocking Communications in MPI,” Proc. EuroPar 2004: Parallel Processing, pp. 173182, 2004.
[13] W. Gropp, E. Lusk, N. Doss, and A. Skjellum, “A HighPerformance, Portable Implementation of the MPI Message Passing Interface Standard,” Parallel Computing, vol. 22, no. 6, pp. 789828, Sept. 1996.
[14] N.T. Karonis, B. Toonen, and I. Foster, “MPICHG2: A GridEnabled Implementation of the Message Passing Interface,” J.Parallel and Distributed Computing, vol. 63, no. 5, pp. 551563, 2003.
[15] O. Beaumont, L. Carter, J. Ferrante, A. Legrand, and Y. Robert, “BandwidthCentric Allocation of Independent Tasks on Heterogeneous Platforms,” Proc. Int'l Symp. Parallel and Distributed Processing (IPDPS '02), 2002.
[16] M.A. Bender, S. Chakrabarti, and S. Muthukrishnan, “Flow and Stretch Metrics for Scheduling Continuous Job Streams,” Proc. Symp. Discrete Algorithms (SODA '98), pp. 270279, 1998.
[17] O. Beaumont, A. Legrand, L. Marchal, and Y. Robert, “Independent and Divisible Tasks Scheduling on Heterogeneous StarShaped Platforms with Limited Memory,” Proc. Euromicro Conf. Parallel, Distributed and NetworkBased Processing (PDP '05), pp.179186, 2005.
[18] P. Boulet, J. Dongarra, Y. Robert, and F. Vivien, “Static Tiling for Heterogeneous Computing Platforms,” Parallel Computing, vol. 25, no. 5, pp. 547568, 1999.
[19] O. Beaumont, L. Carter, J. Ferrante, A. Legrand, L. Marchal, and Y. Robert, “Centralized versus Distributed Schedulers for Multiple BagofTask Applications,” IEEE Trans. Parallel and Distributed Systems, vol. 19, no. 5, pp. 698709, May 2008.
[20] “GNU Linear Programming Kit,” http://www.gnu.org/softwareglpk/, 2009.
[21] A. Legrand, L. Marchal, and H. Casanova, “Scheduling Distributed Applications: The SIMGRID Simulation Framework,” Proc. IEEE/ACM Int'l Symp. Cluster Computing and the Grid (CCGrid '03), pp. 138145, May 2003.
[22] W. Gropp, “MPICH2: A New Start for MPI Implementations,” Proc. European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface, pp. 3742, 2002.
[23] D.G. Feitelson, Workload Characterization and Modeling Book. John Wiley and Sons, http://www.cs.huji.ac.il/feitwlmod/, 2008.
[24] SETI, http:/setiathome.ssl.berkeley.edu, 2009.
[25] 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. Int'l Conf. Parallel Processing (ICCP '03), Oct. 2003.
[26] 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.
[27] M. Litzkow, M. Livny, and M.W. Mutka, “Condor—A Hunter of Idle Workstations,” Proc. Eighth Int'l Conf. Distributed Computing Systems. pp. 104111, 1988.
[28] F.A. da Silva, S. Carvalho, and E.R. Hruschka, “A Scheduling Algorithm for Running BagofTasks Data Mining Applications on the Grid,” Proc. EuroPar 2004: Parallel Processing, pp. 254262, 2004.
[29] C. Weng and X. Lu, “Heuristic Scheduling for BagofTasks Applications in Combination with QoS in the Computational Grid,” Future Generation Computer Systems, vol. 21, no. 1, pp. 271280, 2005.
[30] A. Sulistio and R. Buyya, “A Time Optimization Algorithm for Scheduling BagofTask Applications in AuctionBased Proportional Share Systems,” Proc. 17th Int'l Symp. Computer Architecture and High Performance Computing (SBACPAD '05), pp. 235242, 2005.
[31] C. Anglano and M. Canonico, “Scheduling Algorithms for Multiple BagofTask Applications on Desktop Grids: A KnowledgeFree Approach,” Proc. Second Int'l Workshop Desktop Grids and Volunteer Computing Systems (PCGRID '08) Workshop Colocated with Int'l Symp. Parallel and Distributed Processing (IPDPS '08), 2008.
[32] Scheduling Theory and Its Applications, P. Chrétienne, E.G. Coffman,Jr., J.K. Lenstra, and Z. Liu, eds. John Wiley and Sons, 1995.
[33] D. Bertsimas and D. Gamarnik, “Asymptotically Optimal Algorithms for Job Shop Scheduling and Packet Routing,” J. Algorithms, vol. 33, no. 2, pp. 296318, 1999.
[34] 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.
[35] K. Baker, Introduction to Sequencing and Scheduling. Wiley, 1974.
[36] A. Legrand, A. Su, and F. Vivien, “Minimizing the Stretch When Scheduling Flows of Divisible Requests,” J. Scheduling, vol. 11, no. 5, pp. 381404, 2008.
[37] M.A. Bender, S. Muthukrishnan, and R. Rajaraman, “Approximation Algorithms for Average Stretch Scheduling,” J. Scheduling, vol. 7, no. 3, pp. 195222, 2004.
[38] C. Chekuri and S. Khanna, “Approximation Schemes for Preemptive Weighted Flow Time,” Proc. 34th Ann. ACM Symp. Theory of Computing, pp. 297305, 2002.
[39] S. Muthukrishnan, R. Rajaraman, A. Shaheen, and J. Gehrke, “Online Scheduling to Minimize Average Stretch,” Proc. IEEE Symp. Foundations of Computer Science, pp. 433442, 1999.
[40] O. Sinnen and L. Sousa, “Communication Contention in Task Scheduling,” IEEE Trans. Parallel and Distributed Systems, vol. 16, no. 6, pp. 503515, June 2004.