Advertisement

A Grid Scheduling Based on Generalized Extremal Optimization for Parallel Job Model

  • Piotr Switalski
  • Franciszek Seredynski
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7204)

Abstract

In this paper we propose an efficient parallel job scheduling algorithm for a grid environment. The algorithm implies two stage scheduling. At the first stage, the algorithm allocates jobs to the suitable machines, where at the second stage jobs are independently scheduled on each machine. Allocation of jobs on the first stage of the algorithm is performed with use of a relatively new evolutionary algorithm called Generalized Extremal Optimization (GEO). Scheduling on the second stage is performed by some proposed heuristic. We compare GEO-based scheduling algorithm applied on the first stage with Genetic Algorithm (GA)-based scheduling algorithm. Experimental results show that the GEO, despite of its simplicity, outperforms the GA algorithm in all range of scheduling instances.

Keywords

grid computing evolutionary algorithm generalized extremal optimization parallel job 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ernemann, C., Yahyapour, R.: Applying Economic Scheduling Methods to Grid Environments. In: Grid Resource Management - State of the Art and Future Trends, pp. 491–506. Kluwer Academic Publishers (2003)Google Scholar
  2. 2.
    Ernemann, C., Hamscher, V., Schwiegelshohn, U., Streit, A., Yahyapour, R.: On Advantages of Grid Computing for Parallel Job Scheduling. In: Proc. of 2nd IEEE Int. Symposium on Cluster Computing and the Grid, pp. 39–46 (2002)Google Scholar
  3. 3.
    Foster, I., Kesselman, C., Tuecke, S.: The Anatomy of the Grid: Enabling Scalable Virtual Organizations. Int. Journal Supercomputer Applications. 15(3) (2001)Google Scholar
  4. 4.
    Ghafoor, A., Yang, J.: A Distributed Heterogeneous Supercomputing Management System. Computer 26(6), 78–86 (1993)CrossRefGoogle Scholar
  5. 5.
    Hall, R., Rosenberg, A.L., Venkataramani, A.: A Comparison of Dag-Scheduling Strategies for Internet-Based Computing. In: IEEE International Parallel and Distributed Processing Symposium, p. 55 (2007)Google Scholar
  6. 6.
    Schwiegelshohn, U.: An Owner-centric Metric for the Evaluation of Online Job Schedules. In: Proceedings of the 2009 Multidisciplinary International Conference on Scheduling: Theory and Applications, pp. 557–569 (2009)Google Scholar
  7. 7.
    Sinnen, O.: Task Scheduling for Parallel Systems, pp. 108–111. J. Wiley & Sons (2007)Google Scholar
  8. 8.
    Sousa, F.L., Ramos, F.M., Galski, R.L., Muraoka, I.: Generalized Extremal Optimization: A New Meta-heuristic Inspired by a Model of Natural Evolution. In: Recent Developments in Biologically Inspired Computing, pp. 41–60 (2004)Google Scholar
  9. 9.
    Tchernykh, A., Schwiegelshohn, U., Yahyapour, R., Kuzjurin, N.: On-line hierarchical job scheduling on grids with admissible allocation. Journal of Scheduling 13(5), 545–552 (2010)MathSciNetzbMATHCrossRefGoogle Scholar
  10. 10.
    Vazquez-Poletti, J.L., Huedo, E., Montero, R.S., Llorente, I.M.: A comparison between two grid scheduling philosophies: EGEE WMS and Grid Way. Journal Multiagent and Grid Systems 3(4), 429–440 (2007)zbMATHGoogle Scholar
  11. 11.
    Xhafa, F., Abraham, A. (eds.): Meta-heuristics for Grid Scheduling Problems in Distributed Computing Environments. SCI, vol. 146, pp. 1–37 (2008)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Piotr Switalski
    • 1
  • Franciszek Seredynski
    • 2
    • 3
  1. 1.Computer Science DepartmentSiedlce University of Natural Sciences and HumanitiesSiedlcePoland
  2. 2.Polish-Japanese Institute of Information TechnologyWarsawPoland
  3. 3.Dep. of Mathematics and Natural SciencesCardinal Stefan Wyszynski University in WarsawWarsawPoland

Personalised recommendations