메뉴 건너뛰기




Volumn , Issue , 2007, Pages 885-892

RouteGA: A grid load balancing algorithm with genetic support

Author keywords

[No Author keywords available]

Indexed keywords

GENETIC ALGORITHMS; GRID COMPUTING; OPTIMIZATION; SCHEDULING;

EID: 34548795844     PISSN: 1550445X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/AINA.2007.125     Document Type: Conference Paper
Times cited : (9)

References (23)
  • 1
    • 34548784934 scopus 로고    scopus 로고
    • The apst project. Available at
    • The apst project. Available at http://www.grail.sdsc.edu/projects/apst.
  • 2
    • 0025725905 scopus 로고
    • Instance-based learning algorithms
    • D. W. Aha, D. Kibler, and M. K. Albert. Instance-based learning algorithms. In Machine Learning, number 6, pages 37-66. 1991.
    • (1991) Machine Learning , Issue.6 , pp. 37-66
    • Aha, D.W.1    Kibler, D.2    Albert, M.K.3
  • 3
    • 34548754445 scopus 로고    scopus 로고
    • T. Back, D. B. Fogel, and Z. Michalewicz, editors, IOP Publishing Ltd, Bristol, UK, UK
    • T. Back, D. B. Fogel, and Z. Michalewicz, editors. Basic Algorithms and Operators. IOP Publishing Ltd., Bristol, UK, UK, 1999.
    • (1999) Basic Algorithms and Operators
  • 9
    • 0004916276 scopus 로고    scopus 로고
    • Job scheduling in multiprogrammed parallel systems
    • 19790 87657, aug 1997
    • D. G. Feitelson. Job scheduling in multiprogrammed parallel systems. IBM Research Report RC 19790 (87657), aug 1997.
    • IBM Research Report RC
    • Feitelson, D.G.1
  • 10
    • 84957008669 scopus 로고    scopus 로고
    • D. G. Feitelson and M. A. Jette. Improved utilization and responsiveness with gang scheduling. In D. G. Feitelson and L. Rudolph, editors, Job Scheduling Strategies for Parallel Processing, pages 238-261. Springer, 1997. Lect. Notes Comput. Sci. 1291.
    • D. G. Feitelson and M. A. Jette. Improved utilization and responsiveness with gang scheduling. In D. G. Feitelson and L. Rudolph, editors, Job Scheduling Strategies for Parallel Processing, pages 238-261. Springer, 1997. Lect. Notes Comput. Sci. vol. 1291.
  • 11
    • 0031199613 scopus 로고    scopus 로고
    • Exploiting Process Lifetimes Distributions for Dynamic Load Balancing
    • August
    • M. Harchol-Balter and A. B. Downey. Exploiting Process Lifetimes Distributions for Dynamic Load Balancing. ACM Transactions on Computer Systems, 15(3):253-285, August 1997.
    • (1997) ACM Transactions on Computer Systems , vol.15 , Issue.3 , pp. 253-285
    • Harchol-Balter, M.1    Downey, A.B.2
  • 12
    • 0033675453 scopus 로고    scopus 로고
    • Representation, mutation and crossover issues in evolutionary computation
    • Piscataway, NJ, IEEE Service Center
    • R. Hinterding. Representation, mutation and crossover issues in evolutionary computation. In Proc. of the 2000 Congress on Evolutionary Computation, pages 916-923, Piscataway, NJ, 2000. IEEE Service Center.
    • (2000) Proc. of the 2000 Congress on Evolutionary Computation , pp. 916-923
    • Hinterding, R.1
  • 15
    • 33746322559 scopus 로고    scopus 로고
    • A realistic network/application model for scheduling divisible loads on large-scale platforms
    • L. Marchai, Y. Yang, H. Casanova, and Y. Robert. A realistic network/application model for scheduling divisible loads on large-scale platforms. In Proceedings of IPDPS'05, page 10, 2005.
    • (2005) Proceedings of IPDPS'05 , pp. 10
    • Marchai, L.1    Yang, Y.2    Casanova, H.3    Robert, Y.4
  • 19
    • 34548734159 scopus 로고    scopus 로고
    • Aprendizado baseado em instâncias aplicado à predição de características de execução de aplicações paralelas
    • to be published
    • L. J. Senger, R. F. de Mello, M. J. Santana, and R. H. C. Santana. Aprendizado baseado em instâncias aplicado à predição de características de execução de aplicações paralelas. Revista de Informática Teórica e Aplicada, to be published: 1-26, 2006.
    • (2006) Revista de Informática Teórica e Aplicada , pp. 1-26
    • Senger, L.J.1    de Mello, R.F.2    Santana, M.J.3    Santana, R.H.C.4
  • 20
    • 84944984108 scopus 로고
    • Load distributing for locally distributed systems
    • N. G. Shivaratri, P. Krueger, and M. Singhal. Load distributing for locally distributed systems. IEEE Computer, 25(12):33-44, 1992.
    • (1992) IEEE Computer , vol.25 , Issue.12 , pp. 33-44
    • Shivaratri, N.G.1    Krueger, P.2    Singhal, M.3
  • 21
    • 84947936619 scopus 로고    scopus 로고
    • W. Smith, V. Taylor, and I. Foster. Using run-time predictions to estimate queue wait times and improve scheduler performance. In D. G. Feitelson and L. Rudolph, editors, Job Scheduling Strategies for Parallel Processing, pages 202-219. Springer, 1999. Lect. Notes Comput. Sci. 1659.
    • W. Smith, V. Taylor, and I. Foster. Using run-time predictions to estimate queue wait times and improve scheduler performance. In D. G. Feitelson and L. Rudolph, editors, Job Scheduling Strategies for Parallel Processing, pages 202-219. Springer, 1999. Lect. Notes Comput. Sci. vol. 1659.
  • 22
    • 33746322159 scopus 로고    scopus 로고
    • Practical divisible load scheduling on grid platforms with apst-dv
    • K. van der Raadt, Y Yang, and H. Casanova. Practical divisible load scheduling on grid platforms with apst-dv. In Proceedings of IPDPS'05, page 10, 2005.
    • (2005) Proceedings of IPDPS'05 , pp. 10
    • van der Raadt, K.1    Yang, Y.2    Casanova, H.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.