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 条
  • [1] PARALLELISM IN GRAPH-PARTITIONING
    SAVAGE, JE
    WLOKA, MG
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1991, 13 (03) : 257 - 272
  • [2] A Parallel Shortest Path Algorithm Based on Graph-Partitioning and Iterative Correcting
    Tang, Yuxin
    Zhang, Yunquan
    Chen, Hu
    HPCC 2008: 10TH IEEE INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING AND COMMUNICATIONS, PROCEEDINGS, 2008, : 155 - 161
  • [3] ON PARALLELIZING GRAPH-PARTITIONING HEURISTICS
    SAVAGE, JE
    WLOKA, MG
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 443 : 476 - 489
  • [4] A parallel shortest path algorithm based on graph-partitioning and iterative correcting
    Tang, Yuxin
    Zhang, Yunquan
    Chen, Hu
    COMPUTER SYSTEMS SCIENCE AND ENGINEERING, 2009, 24 (05): : 351 - 360
  • [5] Parallel heuristic search in multilevel graph partitioning
    Baños, R
    Gil, C
    Ortega, J
    Montoya, FG
    12TH EUROMICRO CONFERENCE ON PARALLEL, DISTRIBUTED AND NETWORK-BASED PROCESSING, PROCEEDINGS, 2004, : 88 - 95
  • [6] Geometry, Flows, and Graph-Partitioning Algorithms
    Arora, Sanjeev
    Rao, Satish
    Vazirani, Umesh
    COMMUNICATIONS OF THE ACM, 2008, 51 (10) : 96 - 105
  • [7] ALGORITHM FOR THE GRAPH-PARTITIONING PROBLEM USING A PROBLEM TRANSFORMATION METHOD
    MEKNASSI, M
    ABOULHAMID, EM
    CERNY, E
    COMPUTER-AIDED DESIGN, 1992, 24 (07) : 397 - 398
  • [8] EFFICIENT ALGORITHM FOR GRAPH-PARTITIONING PROBLEM USING A PROBLEM TRANSFORMATION METHOD
    LEE, CH
    PARK, CI
    KIM, M
    COMPUTER-AIDED DESIGN, 1989, 21 (10) : 611 - 618
  • [9] An incremental graph-partitioning algorithm for entity resolution
    Tauer, Gregory
    Date, Ketan
    Nagi, Rakesh
    Sudit, Moises
    INFORMATION FUSION, 2019, 46 : 171 - 183
  • [10] A New Graph-Partitioning Algorithm for Large-Scale Knowledge Graph
    Zhong, Jiang
    Wang, Chen
    Li, Qi
    Li, Qing
    ADVANCED DATA MINING AND APPLICATIONS, ADMA 2018, 2018, 11323 : 434 - 444
12345