Parallel graph-partitioning using the mob heuristic

被引：0
|
作者：
Soch, M [1 ]
Tvrdík, P [1 ]
Volf, M [1 ]
机构：
[1] Czech Tech Univ, Dept Comp Sci & Engn, Prague 12135, Czech Republic
来源：
RECENT ADVANCES IN PARALLEL VIRTUAL MACHINE AND MESSAGE PASSING INTERFACE | 1997年 / 1332卷
关键词：
D O I：
暂无
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
In this paper we study graph partitioning which is an important NP-complete problem. We have implemented two mob heuristics and analysed their performance. Our main result is that for randomly generated graphs the mob heuristics with an exponential schedule is more efficient than that with the Linear schedule, proposed earlier. With the other parameters of the heuristic being identical the exponential schedule doubles the speedup.
引用
收藏
页码：383 / 389
页数：7
相关论文
共 50 条
  • [41] A PARALLEL GRAPH-COLORING HEURISTIC
    JONES, MT
    PLASSMANN, PE
    SIAM JOURNAL ON SCIENTIFIC COMPUTING, 1993, 14 (03): : 654 - 669
  • [42] PARALLEL TASK ASSIGNMENT BY GRAPH PARTITIONING
    LIU, SF
    SOFFA, ML
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 605 : 965 - 966
  • [43] Graph partitioning models for parallel computing
    Hendrickson, B
    Kolda, TG
    PARALLEL COMPUTING, 2000, 26 (12) : 1519 - 1534
  • [44] A parallel multilevel metaheuristic for graph partitioning
    Baños, R
    Gil, C
    Ortega, J
    Montoya, FG
    JOURNAL OF HEURISTICS, 2004, 10 (03) : 315 - 336
  • [45] A Parallel Multilevel Metaheuristic for Graph Partitioning
    R. Baños
    C. Gil
    J. Ortega
    F.G. Montoya
    Journal of Heuristics, 2004, 10 : 315 - 336
  • [46] Current challenges in parallel graph partitioning
    Pellegrini, Francois
    COMPTES RENDUS MECANIQUE, 2011, 339 (2-3): : 90 - 95
  • [47] Parallel Graph Partitioning on Multicore Architectures
    Sui, Xin
    Donald Nguyen
    Burtscher, Martin
    Pingali, Keshav
    LANGUAGES AND COMPILERS FOR PARALLEL COMPUTING, 2011, 6548 : 246 - +
  • [48] PARTITIONING A GRAPH WITH A PARALLEL GENETIC ALGORITHM
    VONLASZEWSKI, G
    MUHLENBEIN, H
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 496 : 165 - 169
  • [49] Parallel Graph Partitioning for Complex Networks
    Meyerhenke, Henning
    Sanders, Peter
    Schulz, Christian
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2017, 28 (09) : 2625 - 2638
  • [50] Parallel Graph Partitioning for Complex Networks
    Meyerhenke, Henning
    Sanders, Peter
    Schulz, Christian
    2015 IEEE 29TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM (IPDPS), 2015, : 1055 - 1064
12345