메뉴 건너뛰기




Volumn , Issue , 2003, Pages

An accurate and efficient parallel genetic algorithm to schedule tasks on a cluster

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DISTRIBUTED PARAMETER NETWORKS; GENETIC ALGORITHMS; PARAMETER ESTIMATION; SCHEDULING ALGORITHMS;

EID: 84947279694     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2003.1213276     Document Type: Conference Paper
Times cited : (16)

References (13)
  • 3
    • 12444285776 scopus 로고
    • Using genetic algorithms to schedule distributed tasks on a bus-based system
    • In: Forrest, S. (Ed.), San Mateo, CA: Morgan Kaufmann
    • Kidwell (Moore), M., Using Genetic Algorithms to Schedule Distributed Tasks on a Bus-Based System, In: Forrest, S. (Ed.), Genetic Algorithms: Proceedings of the Fifth International Conference, San Mateo, CA: Morgan Kaufmann, 1993.
    • (1993) Genetic Algorithms: Proceedings of the Fifth International Conference
    • Kidwell, M.1
  • 5
    • 0016943203 scopus 로고
    • Exact and approximate algorithms for scheduling nonidentical processors
    • Horowitz, E. and Sahni, S., Exact and Approximate Algorithms for Scheduling Nonidentical Processors, Journal of the ACM, vol. 23, no. 2, 1976, 317-327.
    • (1976) Journal of the ACM , vol.23 , Issue.2 , pp. 317-327
    • Horowitz, E.1    Sahni, S.2
  • 13
    • 0141746410 scopus 로고    scopus 로고
    • Parallel genetic algorithms to find near optimal schedules for tasks on multiprocessor architectures
    • IOS Press
    • Moore, M., Parallel Genetic Algorithms to Find Near Optimal Schedules for Tasks on Multiprocessor Architectures, Communicating Process Architectures, IOS Press, 2001, pgs, 27-36.
    • (2001) Communicating Process Architectures , pp. 27-36
    • Moore, M.1


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