Skip to main content
SpringerLink
Log in

Workload Analysis of a Cluster in a Grid Environment

  • Conference paper
Book cover Job Scheduling Strategies for Parallel Processing (JSSPP 2005)

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

Included in the following conference series:

Abstract

With Grids, we are able to share computing resources and to provide for scientific communities a global transparent access to local facilities. In such an environment the problems of fair resource sharing and best usage arise. In this paper, the analysis of the LPC cluster usage (Laboratoire de Physique Corpusculaire, Clermont-Ferrand, France) in the EGEE Grid environment is done, and from the results a model for job arrival is proposed.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Feitelson, D.G.: Workload modeling for performance evaluation. In: Calzarossa, M.C., Tucci, S. (eds.) Performance 2002. LNCS, vol. 2459, pp. 114–141. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  2. England, D., Weissman, J.B.: Costs and benefits of load sharing in the computational grid. In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2004. LNCS, vol. 3277, pp. 160–175. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  3. Garey, M., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)

    MATH  Google Scholar 

  4. Mertens, S.: The easiest hard problem: Number partitioning. In: Percus, A.G., Istrate, G., Moore, C. (eds.) Computational Complexity and Statistical Physics, New York. Oxford University Press, Oxford (2004)

    Google Scholar 

  5. Feitelson, D.G., Rudolph, L.: Parallel job scheduling: Issues and approaches. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1995 and JSSPP 1995. LNCS, vol. 949, pp. 1–18. Springer, Heidelberg (1995)

    Google Scholar 

  6. Jackson, D., Snell, Q., Clement, M.: Core algorithms of the Maui scheduler. In: Feitelson, D.G., Rudolph, L. (eds.) JSSPP 2001. LNCS, vol. 2221, pp. 87–102. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  7. Bode, B., Halstead, D.M., Kendall, R., Lei, Z.: The Portable Batch Scheduler and the Maui Scheduler on Linux Clusters, USENIX Association. In: 4th Annual Linux Showcase Conference (2000)

    Google Scholar 

  8. Agostinelli, S., et al.: Geant 4 (GEometry ANd Tracking): a Simulation toolkit. In: Nuclear Instruments and Methods in Physics Research, pp. 250–303 (2003)

    Google Scholar 

  9. Foster, I., Kesselman, C.: Globus: A metacomputing infrastructure toolkit. The International Journal of Supercomputer Applications and High Performance Computing 11(2), 115–128 (summer 1997)

    Article  Google Scholar 

  10. EGEE Design Team. EGEE middleware architecture, EGEE-DJRA1.1-476451-v1.0 (August 2004), Also available as https://edms.cern.ch/document/476451/1.0

  11. Zotkin, D., Keleher, P.J.: Job-length estimation and performance in backfilling schedulers. In: HPDC (1999)

    Google Scholar 

  12. Peris, A.D., Lorenzo, P.M., Donno, F., Sciabà, A., Campana, S., Santinelli, R.: LCG User guide (2004)

    Google Scholar 

  13. Avellino, G., Beco, S., Cantalupo, B., Maraschini, A., Pacini, F., Sottilaro, M., Terracina, A., Colling, D., Giacomini, F., Ronchieri, E., Gianelle, A., Peluso, R., Sgaravatto, M., Guarise, A., Piro, R., Werbrouck, A., Kouřil, D., Křenek, A., Matyska, L., Mulač, M., Pospíšil, J., Ruda, M., Salvet, Z., Sitera, J., Škrabal, J., Vocū, M., Mezzadri, M., Prelz, F., Monforte, S., Pappalardo, M.: The datagrid workload management system: Challenges and results. Kluwer Academic Publishers, Dordrecht (2004)

    Google Scholar 

  14. Feitelson, D.G., Rudolph, L.: Toward convergence in job schedulers for parallel supercomputers. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1996 and JSSPP 1996. LNCS, vol. 1162, pp. 1–26. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  15. Chiang, S.-H., Arpaci-Dusseau, A., Vernon, M.K.: The impact of more accurate requested runtimes on production job scheduling performance. In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2002. LNCS, vol. 2537, pp. 103–127. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  16. Calzarossa, M., Serazzi, G.: Workload characterization: A survey. Proc. IEEE 81(8), 1136–1150 (1993)

    Article  Google Scholar 

  17. Chapin, S.J., Cirne, W., Feitelson, D.G., Jones, J.P., Leutenegger, S.T., Schwiegelshohn, U., Smith, W., Talby, D.: Benchmarks and standards for the evaluation of parallel job schedulers. In: Feitelson, D.G., Rudolph, L. (eds.) JSSPP 1999, IPPS-WS 1999, and SPDP-WS 1999. LNCS, vol. 1659, pp. 67–90. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  18. Cirne, W., Berman, F.: A comprehensive model of the supercomputer workload (2001)

    Google Scholar 

  19. Downey, A.B., Feitelson, D.G.: The elusive goal of workload characterization. Perf. Eval. Rev. 26(4), 14–29 (1999)

    Article  Google Scholar 

  20. Feitelson, D.G., Nitzberg, B.: Job characteristics of a production parallel scientific workload on the NASA Ames iPSC/860. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1995 and JSSPP 1995. LNCS, vol. 949, pp. 337–360. Springer, Heidelberg (1995)

    Google Scholar 

  21. Paxson, V., Floyd, S.: Wide area traffic: the failure of Poisson modeling. IEEE/ACM Transactions on Networking 3(3), 226–244 (1995)

    Article  Google Scholar 

  22. Li, H., Groep, D., Wolters, L.: Workload characteristics of a multi-cluster supercomputer. In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2004. LNCS, vol. 3277, pp. 176–193. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  23. Kelsey, R., Clinger, W., Rees, J. (eds.): Revised5 report on the algorithmic language Scheme. ACM SIGPLAN Notices 33(9), 26–76 (1998)

    Article  Google Scholar 

  24. Feitelson, D.G.: Metrics for parallel job scheduling and their convergence. In: Feitelson, D.G., Rudolph, L. (eds.) JSSPP 2001. LNCS, vol. 2221, pp. 188–205. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  25. Jann, J., Pattnaik, P., Franke, H., Wang, F., Skovira, J., Riodan, J.: Modeling of workload in MPPs. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1997 and JSSPP 1997. LNCS, vol. 1291, pp. 95–116. Springer, Heidelberg (1997)

    Google Scholar 

  26. Talby, D., Feitelson, D.G., Raveh, A.: Comparing logs and models of parallel workloads using the co-plot method. In: Feitelson, D.G., Rudolph, L. (eds.) JSSPP 1999, IPPS-WS 1999, and SPDP-WS 1999. LNCS, vol. 1659, pp. 43–66. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  27. Azar, Y., Kalyansasundaram, B., Plotkin, S.A., Pruhs, K., Waarts, O.: On-line load balancing of temporary tasks. J. Algorithms 22(1), 93–110 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  28. Azar, Y., Broder, A.Z., Karlin, A.R.: On-line load balancing. Theoretical Computer Science 130(1), 73–84 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  29. Bar-Noy, A., Freund, A., Naor, J.: New algorithms for related machines with temporary jobs. In: Burke, E.K. (ed.) Journal of Scheduling, pp. 259–272. Springer, Heidelberg (2000)

    Google Scholar 

  30. Lam, T.-W., Ting, H.-F., To, K.-K., Wong, W.-H.: On-line load balancing of temporary tasks revisited. Theoretical Computer Science 270(1–2), 325–340 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  31. Andrade, N., Cirne, W., Brasileiro, F., Roisenberg, P.: OurGrid: An approach to easily assemble grids with equitable resource sharing. In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2003. LNCS, vol. 2862, pp. 61–86. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  32. EGEE Design Team, Design of the EGEE middleware grid services. EGEE JRA1 (2004), Also available as https://edms.cern.ch/document/487871/1.0

Download references

Author information

Authors and Affiliations

  1. Laboratoire de Physique Corpusculaire, CNRS-IN2P3, Campus des Cézeaux, 63177 Cedex, Aubière, France

    Emmanuel Medernach

Authors
  1. Emmanuel Medernach
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, The Hebrew University of Jerusalem,  

    Dror Feitelson

  2. Powerset, Inc.,,  

    Eitan Frachtenberg

  3. Massachusetts Institute of Technology, 77 Massachusetts Avenue, MA 02139, Cambridge, USA

    Larry Rudolph

  4. No Affiliations,,  

    Uwe Schwiegelshohn

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Medernach, E. (2005). Workload Analysis of a Cluster in a Grid Environment. In: Feitelson, D., Frachtenberg, E., Rudolph, L., Schwiegelshohn, U. (eds) Job Scheduling Strategies for Parallel Processing. JSSPP 2005. Lecture Notes in Computer Science, vol 3834. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11605300_2

Download citation

  • DOI: https://doi.org/10.1007/11605300_2

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-31617-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation