Escalonamento de Tarefas Visando Balanceamento de Carga em Ambientes de Computação em Grade
Resumo
O escalonamento de recursos é um dos componentes mais importantes de um sistema de computação em grade. Seu objetivo é escalonar um conjunto de aplicações que pertencem a diferentes usuários em um conjunto de recursos heterogêneos e não dedicados, visando maximizar a utilização dos recursos, oferecendo alto throughput. O presente artigo descreve o projeto de uma estratégia de balanceamento de carga para escalonamento de tarefas em grades computacionais. Os resultados preliminares obtidos em um protótipo utilizando o SunGridEngine (SGE) mostram que, para o escalonamento integrado de 13 tarefas em 4 máquinas, a estratégia proposta é capaz de reduzir o comprimento de escalonamento (makespan) em até 22%, quando comparada ao algoritmo default do SGE.Referências
Buyya, R., Abramson, D., and Giddy, J. (2000) “Nimrod/G: An Architecture for Resource Management and Scheduling System in a Global Computational Grid”, Technical Report, Monash University, Australia.
Bailey, D. Borwein, P. and Plouffe, S., (1995) “On the Rapid Computation of Various Polylogarithmic Constants.”.
Berman, F. and Wolsky, R. (2000) “The AppLeS Project: A Status Report”, Technical Report, Dep. of Computer Science and Engineering, Univ. of California at San Diego.
Cattlet, C. and Smarr, L. (1992) “Metacomputing”, Communications of the ACM, 35(6), p. 44-62.
Foster, I., Kesselman, C., (eds.), (1999) “The Grid: Blueprint of a Future Computing Infrastructure“, Morgan Kaufmann.
Foster, I., Kesselman, C., Nick, J. and Tuecke, S., (2002) “Grid Services for Distributed Systems Integration“, IEEE Computer, 35(6), p. 37-46.
Gong, L, Sun, X. and Watson, E. (2002) “Performance Modeling and Prediction of Non-Dedicated Network”, IEEE Transactions on Computers , September, 2002.
Grimshaw, A., Wulf, W. (1997) “The Legion Vision of a Worldwide Computer”, Communications of the ACM, January, v.40, n.1.
He, X. Sun, X, Laszewski, G. (2002) “A QoS Guided Scheduling Algorithm for Grid Computing”, Int. Workshop on Grid and Cooperative Computing, Hainan, China, 2003.
Kwok, Y. and Ahmad, I., “Static Scheduling Algorithms for Allocating Directed Task Graphs to Multiprocessors”, ACM Computing Surveys, v.31, n.4, December, 1999.
Maheswaran, M. (1999) “Dynamic Mapping of a Class of Independent Tasks onto Heterogeneous Computing Systems”, 8th IEEE Heterogeneous Computing Workshop, Porto Rico, p. 30-44.
My Grid Web Page, [link], consultada em Maio/2004.
Nabrzyski, J., Schopf, J. and Weglarz (eds.), (2003) “Grid Resource Management: State of the Art and Future Trends”, Kluwer Academic Publishers, (draft).
Papadimitriou, G. and Steiglitz, K. (1998) “Combinatorial Optimization: Algorithms and Complexity”, Dover Publications Inc., New York, USA.
Sun Microsystems (2002a), “Sun Cluster Grid Architecture - A technical white paper describing the foundation of Sun Grid Computing”, White Paper.
Sun Microsystems (2002b), “Sun Grid Engine 5.3 Administration and User’s Guide”, White Paper.
T. F. Smith, M. S. Waterman, Identification of common molecular sub-sequences – Journal of Molecular Biology, 147 (1) 195-197 – 1981.
Bailey, D. Borwein, P. and Plouffe, S., (1995) “On the Rapid Computation of Various Polylogarithmic Constants.”.
Berman, F. and Wolsky, R. (2000) “The AppLeS Project: A Status Report”, Technical Report, Dep. of Computer Science and Engineering, Univ. of California at San Diego.
Cattlet, C. and Smarr, L. (1992) “Metacomputing”, Communications of the ACM, 35(6), p. 44-62.
Foster, I., Kesselman, C., (eds.), (1999) “The Grid: Blueprint of a Future Computing Infrastructure“, Morgan Kaufmann.
Foster, I., Kesselman, C., Nick, J. and Tuecke, S., (2002) “Grid Services for Distributed Systems Integration“, IEEE Computer, 35(6), p. 37-46.
Gong, L, Sun, X. and Watson, E. (2002) “Performance Modeling and Prediction of Non-Dedicated Network”, IEEE Transactions on Computers , September, 2002.
Grimshaw, A., Wulf, W. (1997) “The Legion Vision of a Worldwide Computer”, Communications of the ACM, January, v.40, n.1.
He, X. Sun, X, Laszewski, G. (2002) “A QoS Guided Scheduling Algorithm for Grid Computing”, Int. Workshop on Grid and Cooperative Computing, Hainan, China, 2003.
Kwok, Y. and Ahmad, I., “Static Scheduling Algorithms for Allocating Directed Task Graphs to Multiprocessors”, ACM Computing Surveys, v.31, n.4, December, 1999.
Maheswaran, M. (1999) “Dynamic Mapping of a Class of Independent Tasks onto Heterogeneous Computing Systems”, 8th IEEE Heterogeneous Computing Workshop, Porto Rico, p. 30-44.
My Grid Web Page, [link], consultada em Maio/2004.
Nabrzyski, J., Schopf, J. and Weglarz (eds.), (2003) “Grid Resource Management: State of the Art and Future Trends”, Kluwer Academic Publishers, (draft).
Papadimitriou, G. and Steiglitz, K. (1998) “Combinatorial Optimization: Algorithms and Complexity”, Dover Publications Inc., New York, USA.
Sun Microsystems (2002a), “Sun Cluster Grid Architecture - A technical white paper describing the foundation of Sun Grid Computing”, White Paper.
Sun Microsystems (2002b), “Sun Grid Engine 5.3 Administration and User’s Guide”, White Paper.
T. F. Smith, M. S. Waterman, Identification of common molecular sub-sequences – Journal of Molecular Biology, 147 (1) 195-197 – 1981.
Publicado
31/07/2004
Como Citar
PORTELLA, Gustavo Jardim; MELO, Alba Cristina Magalhães Alves de.
Escalonamento de Tarefas Visando Balanceamento de Carga em Ambientes de Computação em Grade. In: SEMINÁRIO INTEGRADO DE SOFTWARE E HARDWARE (SEMISH), 31. , 2004, Salvador/BA.
Anais [...].
Porto Alegre: Sociedade Brasileira de Computação,
2004
.
p. 72-81.
ISSN 2595-6205.
