Subscribe

Issue No.02 - February (2010 vol.59)

pp: 202-217

Anne Benoit , ENS Lyon, University of Lyon, and LIP

Loris Marchal , CNRS, University of Lyon, and LIP

Jean-François Pineau , ENS Lyon, University of Lyon, and LIP

Yves Robert , ENS Lyon, University of Lyon, and LIP

Frédéric Vivien , INRIA, ENS Lyon, University of Lyon, CNRS, UCBL, and LIP

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2009.117

ABSTRACT

Scheduling problems are already difficult on traditional parallel machines, and they become extremely challenging on heterogeneous clusters. In this paper, we deal with the problem of scheduling multiple applications, made of collections of independent and identical tasks, on a heterogeneous master-worker platform. The applications are submitted online, which means that there is no a priori (static) knowledge of the workload distribution at the beginning of the execution. The objective is to minimize the maximum stretch, i.e., the maximum ratio between the actual time an application has spent in the system and the time this application would have spent if executed alone. On the theoretical side, we design an optimal algorithm for the offline version of the problem (when all release dates and application characteristics are known beforehand). We also introduce a heuristic for the general case of online applications. On the practical side, we have conducted extensive simulations and MPI experiments, showing that we are able to deal with very large problem instances in a few seconds. Also, the solution that we compute totally outperforms classical heuristics from the literature, thereby fully assessing the usefulness of our approach.

INDEX TERMS

Scheduling and task partitioning, online computation, parallelism and concurrency, measurement, evaluation, modeling, simulation of multiple-processor systems.

CITATION

Anne Benoit, Loris Marchal, Jean-François Pineau, Yves Robert, Frédéric Vivien, "Scheduling Concurrent Bag-of-Tasks Applications on Heterogeneous Platforms",

*IEEE Transactions on Computers*, vol.59, no. 2, pp. 202-217, February 2010, doi:10.1109/TC.2009.117REFERENCES

- [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.
- [5] J. Dongarra, J.-F. Pineau, Y. Robert, and F. Vivien, “Matrix Product on Heterogeneous Master-Worker Platforms,”
Proc. ACM SIGPLAN, pp. 53-62, 2008.- [7] P. Brucker,
Scheduling Algorithms. Springer-Verlag, 2004.- [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. 15-24, 1999.- [12] T. Saif and M. Parashar, “Understanding the Behavior and Performance of Non-Blocking Communications in MPI,”
Proc. Euro-Par 2004: Parallel Processing, pp. 173-182, 2004.- [15] O. Beaumont, L. Carter, J. Ferrante, A. Legrand, and Y. Robert, “Bandwidth-Centric 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. 270-279, 1998.- [17] O. Beaumont, A. Legrand, L. Marchal, and Y. Robert, “Independent and Divisible Tasks Scheduling on Heterogeneous Star-Shaped Platforms with Limited Memory,”
Proc. Euromicro Conf. Parallel, Distributed and Network-Based Processing (PDP '05), pp.179-186, 2005.- [20] “GNU Linear Programming Kit,” http://www.gnu.org/softwareglpk/, 2009.
- [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. 37-42, 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. 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. Int'l Conf. Parallel Processing (ICCP '03), Oct. 2003.- [28] F.A. da Silva, S. Carvalho, and E.R. Hruschka, “A Scheduling Algorithm for Running Bag-of-Tasks Data Mining Applications on the Grid,”
Proc. Euro-Par 2004: Parallel Processing, pp. 254-262, 2004.- [29] C. Weng and X. Lu, “Heuristic Scheduling for Bag-of-Tasks Applications in Combination with QoS in the Computational Grid,”
Future Generation Computer Systems, vol. 21, no. 1, pp. 271-280, 2005.- [30] A. Sulistio and R. Buyya, “A Time Optimization Algorithm for Scheduling Bag-of-Task Applications in Auction-Based Proportional Share Systems,”
Proc. 17th Int'l Symp. Computer Architecture and High Performance Computing (SBAC-PAD '05), pp. 235-242, 2005.- [31] C. Anglano and M. Canonico, “Scheduling Algorithms for Multiple Bag-of-Task Applications on Desktop Grids: A Knowledge-Free 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.- [34] 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.- [35] K. Baker,
Introduction to Sequencing and Scheduling. Wiley, 1974.- [38] C. Chekuri and S. Khanna, “Approximation Schemes for Preemptive Weighted Flow Time,”
Proc. 34th Ann. ACM Symp. Theory of Computing, pp. 297-305, 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. 433-442, 1999. |