Advertisement

Non-clairvoyant Scheduling of Multiple Bag-of-Tasks Applications

  • Henri Casanova
  • Matthieu Gallet
  • Frédéric Vivien
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6271)

Abstract

The bag-of-tasks application model, albeit simple, arises in many application domains and has received a lot of attention in the scheduling literature. Previous works propose either theoretically sound solutions that rely on unrealistic assumptions, or ad-hoc heuristics with no guarantees on performance. This work attempts to bridge this gap through the design of non-clairvoyant heuristics based on solid theoretical foundations. The performance achieved by these heuristics is studied via simulations in a view to comparing them both to previously proposed solutions and to theoretical upper bounds on achievable performance. Also, an interesting theoretical result in this work is that a straightforward on-demand heuristic delivers asymptotically optimal performance when the communications or the computations can be neglected.

Keywords

Computation Cost Communication Cost Desktop Grid Achievable Performance Application Instance 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Casanova, H., Berman, F.: Grid 2002. In: Berman, F., Fox, G., Hey, T. (eds.) Parameter sweeps on the grid with APST. Wiley, Chichester (2002)Google Scholar
  2. 2.
    Anderson, D.: BOINC: A system for public-resource computing and storage. In: GRID 2004: 5th IEEE/ACM Int. Workshop on Grid Computing, pp. 4–10 (2004)Google Scholar
  3. 3.
    Banino, C., Beaumont, O., Carter, L., Ferrante, J., Legrand, A., Robert, Y.: Scheduling strategies for master-slave tasking on heterogeneous processor platforms. IEEE Trans. Parallel Distributed Systems 15(4), 319–330 (2004)CrossRefGoogle Scholar
  4. 4.
    Beaumont, O., Carter, L., Ferrante, J., Legrand, A., Marchal, L., Robert, Y.: Centralized versus distributed schedulers for multiple bag-of-task applications. IEEE Trans. Parallel Distributed Systems 19(5), 698–709 (2008)CrossRefGoogle Scholar
  5. 5.
    Benoit, A., Marchal, L., Pineau, J.F., Robert, Y., Vivien, F.: Scheduling concurrent bag-of-tasks applications on heterogeneous platforms. IEEE Transactions on Computers 59(2), 202–217 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Bertin, R., Legrand, A., Touati, C.: Toward a fully decentralized algorithm for multiple bag-of-tasks application scheduling on grids. In: 9th IEEE/ACM International Conference on Grid Computing, pp. 118–125 (2008)Google Scholar
  7. 7.
    Legrand, A., Touati, C.: Non-cooperative scheduling of multiple bag-of-task applications. In: INFOCOM 2007, pp. 427–435 (2007)Google Scholar
  8. 8.
    Sulistio, A., Buyya, R.: A time optimization algorithm for scheduling bag-of-task applications in auction-based proportional share systems. In: Computer Architecture and High Performance Computing (SBAC-PAD 2005), pp. 235–242 (2005)Google Scholar
  9. 9.
    da Silva, F.A., Carvalho, S., Hruschka, E.R.: A scheduling algorithm for running bag-of-tasks data mining applications on the grid. In: Danelutto, M., Vanneschi, M., Laforenza, D. (eds.) Euro-Par 2004. LNCS, vol. 3149, pp. 254–262. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  10. 10.
    Anglano, C., Canonico, M.: Scheduling algorithms for multiple bag-of-task applications on desktop grids: A knowledge-free approach. In: IPDPS 2008 (2008)Google Scholar
  11. 11.
    Lee, Y.C., Zomaya, A.Y.: Practical scheduling of bag-of-tasks applications on grids with dynamic resilience. IEEE Transactions on Computers 56(6), 815–825 (2007)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Iosup, A., Sonmez, O., Anoep, S., Epema, D.: The performance of bags-of-tasks in large-scale distributed systems. In: HPDC 2008, pp. 97–108. ACM, New York (2008)Google Scholar
  13. 13.
    Kondo, D., Chien, A., Casanova, H.: Scheduling Task Parallel Applications for Rapid Application Turnaround on Enterprise Desktop Grids. Journal of Grid Computing 5(4), 379–405 (2007)CrossRefGoogle Scholar
  14. 14.
    Casanova, H., Gallet, M., Vivien, F.: Non-clairvoyant scheduling of multiple bag-of-tasks applications. Research report 2010-08, LIP - ENS Lyon (2010)Google Scholar
  15. 15.
    Hong, B., Prasanna, V.: Distributed adaptive task allocation in heterogeneous computing environments to maximize throughput. In: IPDPS 2004. IEEE CS Press, Los Alamitos (2004)Google Scholar
  16. 16.
    Beaumont, O., Legrand, A., Marchal, L., Robert, Y.: Steady-state scheduling on heterogeneous clusters. Int. J. of Found. of Computer Science 16(2), 163–194 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Casanova, H., Legrand, A., Quinson, M.: SimGrid: a generic framework for large-scale distributed experimentations. In: 10th IEEE International Conference On Computer Modeling and Simulation, pp. 126–131. IEEE CS Press, Los Alamitos (2008)Google Scholar
  18. 18.
    Makhorin, A.: GLPK, GNU Linear Programming Kit (2009), http://www.gnu.org/software/glpk/

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Henri Casanova
    • 1
  • Matthieu Gallet
    • 2
    • 3
  • Frédéric Vivien
    • 1
    • 2
    • 3
  1. 1.University of Hawai’i at MānoaUSA
  2. 2.École normale supérieure de LyonFrance
  3. 3.INRIAFrance

Personalised recommendations