Parallel Genetic Algorithms for hypercube machines

被引：0
|
作者：
Baraglia, R [1 ]
Perego, R [1 ]
机构：
[1] CNR, Ist Cnuce, I-56100 Pisa, Italy
来源：
VECTOR AND PARALLEL PROCESSING - VECPAR'98 | 1999年 / 1573卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this paper are investigate the design of highly parallel Genetic Algorithms. The Traveling Salesman Problem is used as a case study to evaluate and compare different implementations. To fix the various parameters of Genetic Algorithms to the case study considered, the Holland sequential Genetic Algorithm, which adopts different population replacement methods and crossover operators, has been implemented and;tested. Both fine - grained and coarse - grained parallel GAs which adopt the selected genetic operators have been designed and implemented on a 128-mode nCUBE 2 multicomputer. The fine - grained algorithm uses an innovative map-ping strategy that makes the number of-solutions managed independent of the number of processing nodes used. Complete performance results showing the behaviour of Parallel Genetic Algorithms for different population sizes, number of processors used, migration strategies are reported.
引用
收藏
页码：691 / 703
页数：13
相关论文
共 50 条
  • [1] On designing genetic algorithms for hypercube machines
    Baraglia, R
    Bucci, M
    Circelli, D
    Perego, R
    [J]. HIGH-PERFORMANCE COMPUTING AND NETWORKING, 1997, 1225 : 980 - 981
  • [2] VISION ALGORITHMS FOR HYPERCUBE MACHINES
    MUDGE, TN
    ABDELRAHMAN, TS
    [J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1987, 4 (01) : 79 - 94
  • [3] EFFICIENT PARALLEL ALGORITHMS FOR IMAGE TEMPLATE MATCHING ON HYPERCUBE SIMD-MACHINES
    KUMAR, VKP
    KRISHNAN, V
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1989, 11 (06) : 665 - 669
  • [4] Genetic algorithms for minimizing Tardiness on parallel machines with setups
    Armentano, VA
    Mazzini, R
    [J]. MANAGEMENT AND CONTROL OF PRODUCTION AND LOGISTICS, VOL 1 AND 2, 1998, : 277 - 282
  • [5] PARALLEL GRAPH ALGORITHMS FOR HYPERCUBE COMPUTERS
    DAS, SK
    DEO, N
    PRASAD, S
    [J]. PARALLEL COMPUTING, 1990, 13 (02) : 143 - 158
  • [6] PARALLEL ALGORITHMS AND SUBCUBE EMBEDDING ON A HYPERCUBE
    CHU, E
    GEORGE, A
    [J]. SIAM JOURNAL ON SCIENTIFIC COMPUTING, 1993, 14 (01): : 81 - 94
  • [7] DESIGN OF PARALLEL ALGORITHMS FOR A DISTRIBUTED MEMORY HYPERCUBE
    ZAPATA, EL
    PLATA, OG
    RIVERA, FF
    [J]. MICROPROCESSORS AND MICROSYSTEMS, 1992, 16 (09) : 463 - 470
  • [8] Parallel matrix multiplication algorithms on hypercube multiprocessors
    Lee, PZ
    [J]. INTERNATIONAL JOURNAL OF HIGH SPEED COMPUTING, 1995, 7 (03): : 391 - 406
  • [9] OPTIMAL PARALLEL HYPERCUBE ALGORITHMS FOR POLYGON PROBLEMS
    ATALLAH, MJ
    CHEN, DZ
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 1995, 44 (07) : 914 - 922
  • [10] An efficient approach of simple and multirecombinated genetic algorithms for parallel machines scheduling
    Ferretti, E
    Esquivel, S
    [J]. 2005 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-3, PROCEEDINGS, 2005, : 1340 - 1347
12345