Skip to main content
SpringerLink
Log in

Scheduling in Multi-organization Grids: Measuring the Inefficiency of Decentralization

  • Conference paper
Book cover Parallel Processing and Applied Mathematics (PPAM 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4967))

  • 1153 Accesses

Abstract

We present a novel, generic model of the grid that emphasises the roles of individual organizations that form the system. The model allows us to study the global behaviour of the system without introducing external forms of recompense. Using game-theory and equitable multicriteria optimization, we study three diverse types of computational grids: an off-line system with dedicated uniprocessors, an on-line system with divisible load and an off-line system with parallel jobs. Results show that, unless strong assumptions are made, the complete decentralization leads to a significant loss of performance.

This research was partly supported by the FP6 Network of Excellence CoreGRID funded by the European Commission (Contract IST-2002-004265).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Foster, I.: What is the grid (2002), http://www-fp.mcs.anl.gov/~foster/Articles/WhatIsTheGrid.pdf

  2. Buyya, R., Abramson, D., Venugopal, S.: The grid economy. In: Special Issue on Grid Computing, vol. 93, pp. 698–714. IEEE Press, Los Alamitos (2005)

    Google Scholar 

  3. Marchal, L., Yang, Y., Casanova, H., Robert, Y.: A realistic network/application model for scheduling divisible loads on large-scale platforms. In: Proceedings of the International Parallel & Distributed Processing Symposium (IPDPS), vol. 01, p. 48b (2005)

    Google Scholar 

  4. Kurowski, K., Nabrzyski, J., Oleksiak, A., Weglarz, J.: Multicriteria aspects of grid resource management. In: Nabrzyski, J., Schopf, J.M., Weglarz, J. (eds.) Grid resource management: state of the art and future trends, pp. 271–293. Kluwer, Dordrecht (2004)

    Google Scholar 

  5. Osborne, M.J.: An Introduction to Game Theory, Oxford (2004)

    Google Scholar 

  6. Liu, J., Jin, X., Wang, Y.: Agent-based load balancing on homogeneous minigrids: Macroscopic modeling and characterization. IEEE TPDS 16(7), 586–598 (2005)

    Google Scholar 

  7. Kwok, Y.-K., Song, S., Hwang, K.: Selfish grid computing: Game-theoretic modeling and nash performance results. In: Proceedings of CCGrid (2005)

    Google Scholar 

  8. Kostreva, M.M., Ogryczak, W., Wierzbicki, A.: Equitable aggregations and multiple criteria analysis. EJOR 158, 362–377 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  9. Brucker, P.: Scheduling Algorithms. Springer, Heidelberg (2004)

    MATH  Google Scholar 

  10. Agnetis, A., Mirchandani, P.B., Pacciarelli, D., Pacifici, A.: Scheduling Problems with Two Competing Agents. Operations Research 52(2), 229–242 (2004)

    Article  MathSciNet  Google Scholar 

  11. Rzadca, K., Trystram, D., Wierzbicki, A.: Fair game-theoretic resource management in dedicated grids. In: Proceedings of the IEEE International Symposium on Cluster Computing and the Grid (CCGRID 2007) (2007)

    Google Scholar 

  12. Robertazzi, T.G.: Ten reasons to use divisible load theory. Computer 36(5), 63–68 (2003)

    Article  Google Scholar 

  13. Anderson, D.: BOINC: a system for public-resource computing and storage. In: Grid Computing, 2004. Proceedings. Fifth IEEE/ACM International Workshop on, pp. 4–10 (2004)

    Google Scholar 

  14. Rzadca, K., Trystram, D.: Promoting cooperation in selfish computational grids. European Journal of Operational Research (to appear, 2007)

    Google Scholar 

  15. Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. WH Freeman & Co, New York (1979)

    MATH  Google Scholar 

  16. Eyraud-Dubois, L., Mounie, G., Trystram, D.: Analysis of scheduling algorithms with reservations. In: Proceedings of IPDPS, pp. 1–8. IEEE Computer Society, Los Alamitos (2007)

    Google Scholar 

  17. Pascual, F., Rzadca, K., Trystram, D.: Cooperation in multi-organization scheduling. In: Kermarrec, A.-M., Bougé, L., Priol, T. (eds.) Euro-Par 2007. LNCS, vol. 4641, Springer, Heidelberg (2007)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Polish-Japanese Institute of Information Technology, LIG, Grenoble Universities, France, Warsaw, Poland

    Krzysztof Rzadca

Authors
  1. Krzysztof Rzadca
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Roman Wyrzykowski Jack Dongarra Konrad Karczewski Jerzy Wasniewski

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rzadca, K. (2008). Scheduling in Multi-organization Grids: Measuring the Inefficiency of Decentralization. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Wasniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2007. Lecture Notes in Computer Science, vol 4967. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68111-3_111

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-68111-3_111

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-68105-2

  • Online ISBN: 978-3-540-68111-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation