Grid job scheduling using Route with Genetic Algorithm support

Telecommunication Systems

Volumn 38, Issue 3-4, 2008, Pages 147-160

  De Mello, Rodrigo F ^a   Andrade Filho, José A ^a   Senger, Luciano J ^b   Yang, Laurence T ^c  

^a UNIVERSITY OF SÃO PAULO   (Brazil)

^b STATE UNIVERSITY OF PONTA GROSSA   (Brazil)

^c ST FRANCIS XAVIER UNIVERSITY   (Canada)

Author keywords

Genetic algorithm; Grid computing; High performance computing; Load balancing

Indexed keywords

GENETIC ALGORITHMS; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; RESOURCE ALLOCATION; SCHEDULING ALGORITHMS; TELECOMMUNICATION SYSTEMS;

HIGH PERFORMANCE COMPUTING; HISTORICAL INFORMATION; PARALLEL APPLICATIONS;

GRID COMPUTING;

EID: 46549084748     PISSN: 10184864     EISSN: 15729451     Source Type: Journal    
DOI: 10.1007/s11235-008-9101-5     Document Type: Article

References (42)

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.
3. Back, T., Fogel, D. B., & Michalewicz, Z. (Eds.) (1999). Advanced algorithms and operators. Bristol: IOP Publishing Ltd.
4. Back, T., Fogel, D. B., & Michalewicz, Z. (Eds.) (1999). Basic algorithms and operators. Bristol: IOP Publishing Ltd.
5. Brecht, T., & Guha, K. (1996). Using parallel program characteristics in dynamic processor allocation policies. Performance Evaluation, 27/28(4), 519-539.
6. Buyya, R. (1999). High performance cluster computing-architecture and systems, (Vol. 1). New York: Prentice Hall.
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.
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.
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.
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.
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.
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.
18. Gao, Y., Rong, H., & Huang, J. Z. (2005). Adaptive grid job scheduling with genetic algorithms. Future Generation Computer Systems, 21(1), 151-161.
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.
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.
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.
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.
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.
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.
27. Mitchell, T. M. (1997). Machine learning. New York: McGraw-Hill.
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.
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.
33. Sevcik, K. C. (1989). Characterizations of parallelism in applications and their use in scheduling. Performance Evaluation Review, 17(1), 171-180.
34. Shivaratri, N. G., Krueger, P., & Singhal, M. (1992). Load distributing for locally distributed systems. IEEE Computer, 25(12), 33-44.
35. Siever, E., Figgins, S., & Weber, A. (2003). Linux in a nutshell. Sebastopol: O'Reilly & Associates Inc.
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.
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.
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.