Alea – Grid Scheduling Simulation Environment

  • Dalibor Klusáček
  • Luděk Matyska
  • Hana Rudová
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4967)


This work concentrates on the design of a system intended for study of advanced scheduling techniques for planning various types of jobs in a Grid environment. The solution is able to deal with common problems of the job scheduling in Grids like heterogeneity of jobs and resources, and dynamic runtime changes such as arrivals of new jobs.

Our new simulator called Alea is based on the GridSim simulation toolkit which we extended to provide a simulation environment that supports simulation of varying Grid scheduling problems. To demonstrate the features of the GridSim environment, we implemented an experimental centralised Grid scheduler which uses advanced scheduling techniques for schedule generation. By now local search based algorithms and some dispatching rules were tested.

The scheduler is capable to handle both static and dynamic situation. In the static case, all jobs are known in advance while the dynamic situation means that jobs appear in the system during simulation. In this case generated schedule is changing through time as some jobs are already finished while the new ones are arriving. Comparison of FCFS, local search and dispatching rules is presented for both cases and we demonstrate that the new local search based algorithm provides the best schedule while keeping the running time acceptable.


Grid scheduling Local search Dispatching rules Simulation with GridSim 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Abramson, D., Buyya, R., Murshed, M., Venugopal, S.: Scheduling parameter sweep applications on global Grids: A deadline and budget constrained cost-time optimisation algorithm. International Journal of Software: Practice and Experience (SPE) 35(5), 491–512 (2005)CrossRefGoogle Scholar
  2. 2.
    Armentano, V.A., Yamashita, D.S.: Tabu search for scheduling on identical parallel machines to minimize mean tardiness. Journal of Intelligent Manufacturing 11, 453–460 (2000)CrossRefGoogle Scholar
  3. 3.
    Baraglia, R., Ferrini, R., Ritrovato, P.: A static mapping heuristics to map parallel applications to heterogeneous computing systems: Research articles. Concurrency and Computation: Practice and Experience 17(13), 1579–1605 (2005)CrossRefGoogle Scholar
  4. 4.
    Bidot, J.: A General Framework Integrating Techniques for Scheduling under Uncertainty. PhD thesis, Institut National Polytechnique de Toulouse, France (2005)Google Scholar
  5. 5.
    Brucker, P.: Scheduling Algorithms. Springer, Heidelberg (1998)zbMATHGoogle Scholar
  6. 6.
    Buyya, R., Murshed, M.: GridSim: A toolkit for the modeling and simulation of distributed resource management and scheduling for Grid computing. The Journal of Concurrency and Computation: Practice and Experience (CCPE) 14, 1175–1220 (2002)zbMATHCrossRefGoogle Scholar
  7. 7.
    Capannini, G., Baraglia, R., Puppin, D., Ricci, L., Pasquali, M.: A job scheduling framework for large computing farms. In: SC 2007 International Conference for High Performance Computing, Networking, Storage and Analysis (to appear, 2007)Google Scholar
  8. 8.
    Fibich, P., Matyska, L., Rudová, H.: Model of Grid Scheduling Problem, Exploring Planning and Scheduling for Web Services, Grid and Autonomic Computing, Papers from the AAAI 2005 workshop. Technical Report WS-05-03, AAAI Press (2005)Google Scholar
  9. 9.
    Foster, I., Kesselman, C.: The Grid 2: Blueprint for a New Computing Infrastructure, 2nd edn. Morgan Kaufmann, San Francisco (2004)Google Scholar
  10. 10.
    Gay, J.-S., Caniou, Y.: Simbatch: an API for simulating and predicting the performance of parallel resources and batch systems. Research Report 6040, INRIA (2006)Google Scholar
  11. 11.
    Glover, F.W., Kochenberger, G.A. (eds.): Handbook of Metaheuristics. Kluwer, Dordrecht (2003)zbMATHGoogle Scholar
  12. 12.
    He, X., Sun, X., von Laszewski, G.: QoS guided min-min heuristic for Grid task scheduling. Journal of Computer Science and Technology 18(4), 442–451 (2003)zbMATHCrossRefGoogle Scholar
  13. 13.
    Ho, N.B., Tay, J.C.: Evolving dispatching rules for solving the flexible job-shop problem. In: Proceedings of the IEEE Congress on Evolutionary Computation, pp. 2848–2855 (2005)Google Scholar
  14. 14.
    Klusáček, D., Matyska, L., Rudová, H.: Local Search for Deadline Driven Grid Scheduling. In: Third Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2007), pp. 74–81 (2007)Google Scholar
  15. 15.
    Klusáček, D., Matyska, L., Rudová, H.: Local Search for Grid Scheduling. In: Doctoral Consortium at the International Conference on Automated Planning and Scheduling (ICAPS 2007), Providence, RI, USA (2007)Google Scholar
  16. 16.
    Kocjan, W.: Dynamic scheduling state of the art report. Technical report, SICS Technical Report T2002:28 (2002)Google Scholar
  17. 17.
    Kolliopoulos, S.G., Steiner, G.: On minimizing the total weighted tardiness on a single machine. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol. 2996, pp. 176–186. Springer, Heidelberg (2004)Google Scholar
  18. 18.
    Legrand, A., Marchal, L., Casanova, H.: Scheduling distributed applications: the SimGrid simulation framework. In: Proceedings of the Third IEEE International Symposium on Cluster Computing and the Grid, pp. 138–145. IEEE Computer Society, Los Alamitos (2003)CrossRefGoogle Scholar
  19. 19.
    Liu, X., Xia, H., Chien, A.: Validating and scaling the MicroGrid: A scientific instrument for Grid dynamics. The Journal of Grid Computing 2(2), 141–161 (2004)CrossRefGoogle Scholar
  20. 20.
    Loganantharaj, R., Thomas, B.: An overview of a synergetic combination of local search with evolutionary learning to solve optimization problems. In: IEA/AIE 2000: Proceedings of the 13th international conference on Industrial and engineering applications of artificial intelligence and expert systems, pp. 129–138. Springer, Heidelberg (2000)Google Scholar
  21. 21.
    Mathirajan, M., Sivakumar, A.I.: Minimizing total weighted tardiness on heterogeneous batch processing machines with incompatible job families. The International Journal of Advanced Manufacturing Technology 28, 1038–1047 (2006)CrossRefGoogle Scholar
  22. 22.
    Pinedo, M.: Planning and Scheduling in Manufacturing and Services. Springer, Heidelberg (2005)zbMATHGoogle Scholar
  23. 23.
    Takefusa, A., Matsuoka, S., Aida, K., Nakada, H., Nagashima, U.: Overview of a performance evaluation system for global computing scheduling algorithms. In: HPDC 1999: Proceedings of the 8th IEEE International Symposium on High Performance Distributed Computing, USA, pp. 97–104. IEEE, Los Alamitos (1999)Google Scholar
  24. 24.
    van den Akker, J.M., Hoogeveen, J.A., van Kempen, J.W.: Parallel machine scheduling through column generation: Minimax objective functions. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol. 2996, pp. 648–659. Springer, Heidelberg (2004)Google Scholar
  25. 25.
    Verfaillie, G., Jussien, N.: Constraint solving in uncertain and dynamic environments: A survey. Constraints 10(3), 253–281 (2005)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Dalibor Klusáček
    • 1
  • Luděk Matyska
    • 1
  • Hana Rudová
    • 1
  1. 1.Faculty of InformaticsMasaryk UniversityBrnoCzech Republic

Personalised recommendations