Job arrival analysis for a cluster in a Grid environment

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, CNRS-IN2P3, Clermont-Ferrand, France) in the EGEE Grid environment is done, and from the results a model for job arrival is proposed.

[1]  Bala Kalyanasundaram,et al.  On-Line Load Balancing of Temporary Tasks , 1997, J. Algorithms.

[2]  Dror G. Feitelson,et al.  Workload Modeling for Performance Evaluation , 2002, Performance.

[3]  Jon B. Weissman,et al.  Costs and Benefits of Load Sharing in the Computational Grid , 2004, JSSPP.

[4]  Yossi Azar,et al.  On-line load balancing , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[5]  Allen B. Downey,et al.  The elusive goal of workload characterization , 1999, PERV.

[6]  Zhou Lei,et al.  The portable batch scheduler and the maui scheduler on linux clusters , 2000 .

[7]  Warren Smith,et al.  Benchmarks and Standards for the Evaluation of Parallel Job Schedulers , 1999, JSSPP.

[8]  W. Cirne,et al.  A comprehensive model of the supercomputer workload , 2001, Proceedings of the Fourth Annual IEEE International Workshop on Workload Characterization. WWC-4 (Cat. No.01EX538).

[9]  Zdenek Salvet,et al.  The DataGrid Workload Management System: Challenges and Results , 2004, Journal of Grid Computing.

[10]  Daniel Kouřil,et al.  Practical approaches to Grid workload and resource management in the EGEE project , 2004 .

[11]  Sally Floyd,et al.  Wide area traffic: the failure of Poisson modeling , 1995, TNET.

[12]  Robert Hieb,et al.  Revised 5 Report on the Algorithmic Language , 1999 .

[13]  P. Sadayappan,et al.  On fairness in distributed job scheduling across multiple sites , 2004, 2004 IEEE International Conference on Cluster Computing (IEEE Cat. No.04EX935).

[14]  Larry Rudolph,et al.  Towards Convergence in Job Schedulers for Parallel Supercomputers , 1996, JSSPP.

[15]  Joseph Naor,et al.  New algorithms for related machines with temporary jobs , 2000 .

[16]  Ian T. Foster,et al.  Globus: a Metacomputing Infrastructure Toolkit , 1997, Int. J. High Perform. Comput. Appl..

[17]  Andrea C. Arpaci-Dusseau,et al.  The Impact of More Accurate Requested Runtimes on Production Job Scheduling Performance , 2002, JSSPP.

[18]  Prudence W. H. Wong,et al.  On-line load balancing of temporary tasks revisited , 1999, Theor. Comput. Sci..

[19]  Giuseppe Serazzi,et al.  Workload characterization: a survey , 1993, Proc. IEEE.

[20]  Hui Li,et al.  Workload Characteristics of a Multi-cluster Supercomputer , 2004, JSSPP.

[21]  Francine Berman,et al.  A model for moldable supercomputer jobs , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.

[22]  Dmitry N. Zotkin,et al.  Job-length estimation and performance in backfilling schedulers , 1999, Proceedings. The Eighth International Symposium on High Performance Distributed Computing (Cat. No.99TH8469).