Skip to main content

Advertisement

SpringerLink
Log in

Grid job scheduling using Route with Genetic Algorithm support

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

In 2006 the Route load balancing algorithm was proposed and compared to other techniques aiming at optimizing the process allocation in grid environments. This algorithm schedules tasks of parallel applications considering computer neighborhoods (where the distance is defined by the network latency). Route presents good results for large environments, although there are cases where neighbors do not have an enough computational capacity nor communication system capable of serving the application. In those situations the Route migrates tasks until they stabilize in a grid area with enough resources. This migration may take long time what reduces the overall performance. In order to improve such stabilization time, this paper proposes RouteGA (Route with Genetic Algorithm support) which considers historical information on parallel application behavior and also the computer capacities and load to optimize the scheduling. This information is extracted by using monitors and summarized in a knowledge base used to quantify the occupation of tasks. Afterwards, such information is used to parameterize a genetic algorithm responsible for optimizing the task allocation. Results confirm that RouteGA outperforms the load balancing carried out by the original Route, which had previously outperformed others scheduling algorithms from literature.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. The APST Project. http://www.grail.sdsc.edu/projects/apst.

  2. Aha, D. W., Kibler, D., & Albert, M. K. (1991). Instance-based learning algorithms. Machine Learning, 6, 37–66.

    Google Scholar 

  3. Back, T., Fogel, D. B., & Michalewicz, Z. (Eds.) (1999). Advanced algorithms and operators. Bristol: IOP Publishing Ltd.

    Google Scholar 

  4. Back, T., Fogel, D. B., & Michalewicz, Z. (Eds.) (1999). Basic algorithms and operators. Bristol: IOP Publishing Ltd.

    Google Scholar 

  5. Brecht, T., & Guha, K. (1996). Using parallel program characteristics in dynamic processor allocation policies. Performance Evaluation, 27/28(4), 519–539.

    Google Scholar 

  6. Buyya, R. (1999). High performance cluster computing—architecture and systems, (Vol. 1). New York: Prentice Hall.

    Google Scholar 

  7. Buyya, R., & Murshed, M. (2002). 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(13–15), 46.

    Google Scholar 

  8. Casanova, H., & Berman, F. (2003). Parameter sweeps on the grid with apst. In Grid computing: making the global infrastructure a reality (pp. 773–787). New York: Wiley. Chap. 33.

    Google Scholar 

  9. Casanova, H., Legrand, A., Zagorodnov, D., & Berman, F. (2000). Heuristics for scheduling parameter sweep applications in grid environments. In Proc. 9th heterogeneous computing workshop (HCW), Cancun, Mexico, May 2000 (pp. 349–363).

  10. Choe, T., & Park, C. (2002). A task duplication based scheduling algorithm with optimality condition in heterogeneous systems. In International conference on parallel processing workshops (ICPPW’02) (pp. 531–536). Los Alamitos: IEEE Computer Society.

    Chapter  Google Scholar 

  11. de Mello, R. F., Andrade Filho, J. A., Senger, L. J., & Yang, L. T. (2007). RouteGA: A grid load balancing algorithm with genetic support. In 21st international conference on advanced networking and applications, August 2007 (pp. 885–892).

  12. de Mello, R. F., & Senger, L. J. (2004). A new migration model based on the evaluation of processes load and lifetime on heterogeneous computing environments. In International symposium on computer architecture and high performance computing—SBAC-PAD (p. 6).

  13. de Mello, R. F., & Senger, L. J. (2006). Model for simulation of heterogeneous high-performance computing environments. In 7th international conference on high performance computing in computational sciences—VECPAR 2006 (p. 11).

  14. de Mello, R. F., Senger, L. J., & Yang, L. T. (2006). A routing load balancing policy for grid computing environments. In The IEEE 20th international conference on advanced information networking and applications (AINA 2006) (pp. 1–6). Los Alamitos: IEEE Computer Society Press.

    Google Scholar 

  15. Dodonov, E., Sousa, J. Q., & Guardia, H. C. (2004). Gridbox: securing hosts from malicious and greedy applications. In Proceedings of the 2nd workshop on Middleware for grid computing (pp. 17–22). New York: ACM Press.

    Chapter  Google Scholar 

  16. Downey, A. B. (1997). Predicting queue times on space-sharing parallel computers. In 11th international parallel processing symposium, April 1997. Also available as (Technical Report No. CSD-96-906). University of California.

  17. Feitelson, D. G., & Jette, M. A. (1997). Improved utilization and responsiveness with gang scheduling. In D. G. Feitelson & L. Rudolph (Eds.), Lecture notes computer science : Vol. 1291. Job scheduling strategies for parallel processing (pp. 238–261). Berlin: Springer.

    Google Scholar 

  18. Gao, Y., Rong, H., & Huang, J. Z. (2005). Adaptive grid job scheduling with genetic algorithms. Future Generation Computer Systems, 21(1), 151–161.

    Article  Google Scholar 

  19. Gibbons, R. (1997). A historical application profiler for use by parallel schedulers. In Job scheduling strategies for parallel processing (pp. 58–77). Berlin: Springer.

    Google Scholar 

  20. Harchol-Balter, M., & Downey, A. B. (1997). Exploiting process lifetimes distributions for dynamic load balancing. ACM Transactions on Computer Systems, 15(3), 253–285.

    Article  Google Scholar 

  21. Hinterding, R. (2000). Representation, mutation and crossover issues in evolutionary computation. In Proc. of the 2000 congress on evolutionary computation (pp. 916–923). Piscataway: IEEE Service Center.

    Chapter  Google Scholar 

  22. Hockney, R. W. (1996). The science of computer benchmarking. Soc for Industrial Applied Math.

  23. Ishii, R. P., de Mello, R. F., Senger, L. J., Santana, M. J., & Santana, R. H. C. (2005). Scheduling based on the impact over process communication of parallel applications. In Proceedings of the 19th international symposium on high performance computing systems and applications (p. 7). Los Alamitos: IEEE Computer Society.

    Google Scholar 

  24. Iverson, M. A., Özgüner, F., & Potter, L. (1999). Statistical prediction of task execution times through analytic benchmarking for scheduling in a heterogeneous environment. IEEE Transactions on Computers, 48(12), 1374–1379.

    Article  Google Scholar 

  25. Marchal, L., Yang, Y., Casanova, H., & Robert, Y. (2005). A realistic network/application model for scheduling divisible loads on large-scale platforms. In Proceedings of IPDPS’05 (p. 10).

  26. Mello, R. F., Trevelin, L. C., Paiva, M. S., & Yang, L. T. (2004). Comparative study of the server-initiated lowest algorithm using a load balancing index based on the process behavior for heterogeneous environment. In Networks, software tools and application. Dordrecht: Kluwer Academic.

    Google Scholar 

  27. Mitchell, T. M. (1997). Machine learning. New York: McGraw-Hill.

    Google Scholar 

  28. Naik, V. K., Setia, S. K., & Squillante, M. S. (1997). Processor allocation in multiprogrammed distributed-memory parallel computer systems. Journal of Parallel and Distributed Computing, 47(1), 28–47.

    Article  Google Scholar 

  29. Radulescu, A., van Gemund, A., & Lin, H. (1999). LLB: A fast and effective scheduling algorithm for distributed-memory systems. In 13th international and 10th symposium on parallel and distributed processing—IPPS/SPDP (pp. 525–530).

  30. Ranaweera, S., & Agrawal, D. P. (2000). A task duplication based scheduling algorithm for heterogeneous systems. In Parallel and distributed processing symposium—IPDPS 2000 (pp. 445–450).

  31. Reis, V. Q., Santana, M. J., de Mello, R. F., & Santana, R. H. C. (2006). Uma política de escalonamento orientada à reducão do tempo de resposta de aplicacoes paralelas. In VI workshop em sistemas computacionais de Alto Desempenho, Rio de Janeiro, Sociedade Brasileira de Computação.

  32. Senger, L. J., de Mello, R. F., Santana, M. J., & Santana, R. H. C. (2006). Aprendizado baseado em instâncias aplicado à predição de características de execução de aplicações paralelas. Revista de Informática Téorica e Aplicada, 13(1), 87–108.

    Google Scholar 

  33. Sevcik, K. C. (1989). Characterizations of parallelism in applications and their use in scheduling. Performance Evaluation Review, 17(1), 171–180.

    Article  Google Scholar 

  34. Shivaratri, N. G., Krueger, P., & Singhal, M. (1992). Load distributing for locally distributed systems. IEEE Computer, 25(12), 33–44.

    Google Scholar 

  35. Siever, E., Figgins, S., & Weber, A. (2003). Linux in a nutshell. Sebastopol: O’Reilly & Associates Inc.

    Google Scholar 

  36. Smith, W., Taylor, V., & Foster, I. (1999). Using run-time predictions to estimate queue wait times and improve scheduler performance. In D. G. Feitelson & L. Rudolph (Eds.), Lecture notes computer science : Vol. 1659. Job scheduling strategies for parallel processing (pp. 202–219). Berlin: Springer.

    Chapter  Google Scholar 

  37. Sterling, T. (2001). Cluster computing white paper.

  38. Takefusa, A. (2001). Bricks: A performance evaluation system for scheduling algorithms on the grids. In JSPS workshop on applied information technology for science.

  39. Takefusa, A. H. Matsuoka, S., & Berman, F. (2001). A study of deadline scheduling for client-server systems on the computational grid. In Proceedings of 10th IEEE international symposium on high performance distributed computing (pp. 406–415).

  40. van der Raadt, K., Yang, Y., & Casanova, H. (2005). Practical divisible load scheduling on grid platforms with apst-dv. In Proceedings of IPDPS’05 (p. 10).

  41. Wilson, D. R., & Martinez, T. R. (1997). Improved heterogeneous distance functions. Journal of Artificial Intelligence Research, 6, 1–34.

    Google Scholar 

  42. Zhou, S., & Ferrari, D. (1987). An experimental study of load balancing performance. (Technical Report UCB/CSD 87/336, PROGRES Report No. 86.8). Universidade da California, Computer Science Division (EECS), Berkeley, California 94720.

Download references

Author information

Authors and Affiliations

  1. Departamento de Ciências de Computação, Universidade de São Paulo, Instituto de Ciências Matematicas e de Computação, São Carlos, SP, Brazil

    Rodrigo F. de Mello & José A. Andrade Filho

  2. Departamento de Informática, Universidade Estadual de Ponta Grossa, Ponta Grossa, PR, Brazil

    Luciano J. Senger

  3. St. Francis Xavier University, Antigonish, NS, Canada

    Laurence T. Yang

Authors
  1. Rodrigo F. de Mello
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. José A. Andrade Filho
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Luciano J. Senger
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Laurence T. Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Rodrigo F. de Mello.

Rights and permissions

Reprints and permissions

About this article

Cite this article

de Mello, R.F., Andrade Filho, J.A., Senger, L.J. et al. Grid job scheduling using Route with Genetic Algorithm support. Telecommun Syst 38, 147–160 (2008). https://doi.org/10.1007/s11235-008-9101-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11235-008-9101-5

Keywords

Search

Navigation