Skip to main content
SpringerLink
Log in

A Bio-Inspired Scheduling Algorithm for Grid Environments

  • Chapter
  • First Online:
Remote Instrumentation Services on the e-Infrastructure

  • 308 Accesses

Abstract

The design of an effective scheduling policy represents one of the open issues in the field of grid computing research. The dynamism and the heterogeneity of grids, in fact, make difficult the creation of a scheduler able to satisfy, at the same time, all the needs required by these complex environments.

The scientific literature has proposed several solutions based on meta-heuristics techniques: these approaches, in fact, have demonstrated to be able to solve many optimization problems, as the grid scheduling one, adopting behaviors inspired by nature. In this chapter, the authors discuss the implementation of the Aliened Ant Algorithm, a new technique that, forcing the adoption of a “non natural” behavior, exploits the self-organization ability of an ant colony to obtain an effective scheduling policy for a multi-broker grid environment.

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 EPUB and 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
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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

Notes

  1. 1.

    Scalable groups of research organizations without a particular geographic characterization.

  2. 2.

    In particular, the x component will be chosen for the RB and the y component for the CE.

  3. 3.

    These can be owner, groups, QoS parameter, execution time, etc.

  4. 4.

    Without this time reference, to maintain a consistence among the pheromone trails’ values it would be necessary to perform a synchronous update which could be very expensive in terms of computational power.

  5. 5.

    It should be noted that \(\Delta \phi_{\textrm{sp}}\) value cannot be less than zero. If the \(\Delta \phi_{\textrm{sp}}\), after the updating process, has a negative value, it is rounded to zero.

  6. 6.

    This information is available by the RB that has submitted the job through the above mentioned update notification mechanism.

References

  1. C. Kesselman, I. Foster, and S. Tuecke. The anatomy of the grid - enabling scalable virtual organizations. International Journal of High Performance Computing Applications, 15(3), 200–222, 2001

    Article  Google Scholar 

  2. I. Foster, C. Kesselman, J. Nick, and S. Tuecke. The Physiology of the grid: An open Grid services architecture for distributed systems integration, Open Grid Service Infrastructure WG, Global Grid Forum, 2002

    Google Scholar 

  3. I. Foster and C. Kesselman. The grid: blueprint for a new computing infrastructure, Chapter 3. Morgan Kaufmann Publishers, San Francisco, CA ISBN: 1-558660-475-8, 1999

  4. Globus toolKit:http://www.globus.org, 2008

  5. gLite middleware:http://www.egee.org, 2008

  6. Omii-UK middleware:http://www.omii.org

  7. M. Dorigo and C. Blum. Ant colony optimization theory: A survey. Journal Theoretical Computer Science, 344 (2-3), 243–278, 2005

    Article  MathSciNet  MATH  Google Scholar 

  8. K. M. Sim and W. H. Sun. Ant colony optimization for routing and load-balancing: Survey and new directions systems, man and cybernetics, Part A, IEEE Transactions, 33, 560–572, 2003

    Google Scholar 

  9. D. Merkle, M. Middendorf, and H. Schmeck: Ant colony optimization for resource-constrained project scheduling. IEEE Transaction on Evolutionary Computation, 6(4), 333–346, 2002

    Google Scholar 

  10. C. Blum, and M. Sampels. An ant colony optimization algorithm for shop scheduling problems. Journal of Mathematical Modelling and Algorithms, 3(3), 2004

    Google Scholar 

  11. COMETA: http://www.consorzio-cometa.it, 2008

  12. C. Blum, and A. Roli. Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM computing surveys, 35(3) pp., 268–308, 2003

    Google Scholar 

  13. T. Stutzle and M. Dorigo. ACO algorithms for the quadratic assignment problem, new ideas in optimization, isbn:0-07-709506-5, McGraw-Hill, London pp. 33–50, 1999

    Google Scholar 

  14. M. Dorigo and L.M. Gambardella. Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transaction on Evolutionary Computation 1, 53–66, 1997

    Article  Google Scholar 

  15. L.M. Gambardella, M. Dorigo. Ant colony system hybridized with a new local search for the sequential ordering problem. INFORMS Journal Computing 12, 237–255, 2000

    Article  MathSciNet  MATH  Google Scholar 

  16. R. Schoonderwoerd, O. Holland and J. Bruten. Ant-like Agents for Load Balancing in Telecommunications Networks. Proceedings of the first international conference on Autonomous agents, Marina del Rey, CA, 1997

    Google Scholar 

  17. M. Reimann, K. Doerner, R.F. Hartl, D-ants: savings based ants divide and conquer the vehicle routing problems. Computer Operation Research 31, 563–591, 2004

    Article  MATH  Google Scholar 

  18. ML. den Besten, T. Stutzle, and M. Dorigo. Design of iterated local search algorithms: An example application to the single machine total weighted tardiness problem. Proceedings of EvoStim01, Lecture Notes in Computer Science, Springer Berlin, pp. 441–452, 2001

    Google Scholar 

  19. T. Stutzle. An ant approach to the flow shop problem. Proceedings of the 6th European Congress on Intelligent Techniques & Soft Computing, Aachen, Germany 1998

    Google Scholar 

  20. C. Blum, and M. Sampels. Ant colony optimization for fop shop scheduling: A case study on different pheromone representations. Proceedings of the 2002 Congress on Evolutionary Computing, Honolulu, H1 pp. 1558–1563, 2002

    Google Scholar 

  21. S. Fidanova and M. Durchova. Ant Algorithm for grid scheduling problem. LNCS 3743, Sozopol, Bulgaria pp. 405–412, 2006

    Google Scholar 

  22. H. Yan, X.-Q. Shen, X. Li, and M.-H. Wu. An Improved Ant Algorithm for Job Scheduling in Grid Computing. Proceedings of the Fourth International Conference on Machine Learning and Cybernetics, Guangzhou 2005

    Google Scholar 

  23. M. Bandieramonte, A. Di Stefano, and G. Morana. An ACO inspired strategy to improve jobs scheduling in a grid environment. Proceedings of ICA3PP 2008, Agianapa, Cyprus pp. 30–41, 2008

    Google Scholar 

  24. Y. Gao, H. Rong, and J.Z. Huang: Adaptive Grid job scheduling with genetic algorithms. Future Generation Computer Systems 21, 151–161, 2005

    Article  Google Scholar 

  25. J. Cao, D.P. Spooner, S.A. Jarvis, and G.R. Nudd. Grid load balancing using intelligent agents. Future Generation Computer Systems 21, 135–149, 2005

    Article  Google Scholar 

  26. D.P. Spooner, S.A. Jarvis, J. Cao, S., Saini, and G.R. Nudd. Local Grid scheduling techniques using performance prediction. IEE Proceedings Explore, 150, 87–96, 2003

    Google Scholar 

  27. L. Yang, J.M. Schopf, and I. Foster, Conservative scheduling: Using predicted variance to improve scheduling decisions in dynamic environments. Proceedings of the 2003 ACM/IEEE conference on Supercomputing, Phoenix, AZ pp. 31–47, 2003

    Google Scholar 

  28. T.L. Casavant and J.G. Kuhl. A taxonomy of scheduling in general-purpose distributed computing systems. IEEE Transactions on Software Engineering, 14, (2), 141–154, February 1988

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information and Telecommunication Engineering, Catania Univerisity, Catania, Italy

    Antonella Di Stefano & Giovanni Morana

Authors
  1. Antonella Di Stefano
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Giovanni Morana
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Giovanni Morana .

Editor information

Editors and Affiliations

  1. DIST, University of Genoa, Via Opera Pia 13, Genova, 16145, Italy

    Franco Davoli

  2. Networking Center, Poznan Supercomputing &, ul. Noskowskiego 10, Poznan, 61-704, Poland

    Norbert Meyer

  3. Sincrotrone Trieste S.C.p.A, Strada Statale 14, Basovizza, Trieste, 34012, Italy

    Roberto Pugliese

  4. DIST, University of Genoa, Via Opera Pia 13, Genova, 16145, Italy

    Sandro Zappatore

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Di Stefano, A., Morana, G. (2011). A Bio-Inspired Scheduling Algorithm for Grid Environments. In: Davoli, F., Meyer, N., Pugliese, R., Zappatore, S. (eds) Remote Instrumentation Services on the e-Infrastructure. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-5574-6_9

Download citation

  • DOI: https://doi.org/10.1007/978-1-4419-5574-6_9

  • Published:

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4419-5573-9

  • Online ISBN: 978-1-4419-5574-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation