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
关键词
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 条
  • [21] A combined evolutionary search and multilevel optimisation approach to graph-partitioning
    Soper, AJ
    Walshaw, C
    Cross, M
    JOURNAL OF GLOBAL OPTIMIZATION, 2004, 29 (02) : 225 - 241
  • [22] Modeling, analysis, and experimental comparison of streaming graph-partitioning policies
    Guo, Yong
    Hong, Sungpack
    Chafi, Hassan
    Iosup, Alexandru
    Epema, Dick
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2017, 108 : 106 - 121
  • [23] Cost-Effective Social Network Data Placement and Replication using Graph-Partitioning
    Khalajzadeh, Hourieh
    Yuan, Dong
    Grundy, John
    Yang, Yun
    2017 IEEE 1ST INTERNATIONAL CONFERENCE ON COGNITIVE COMPUTING (ICCC 2017), 2017, : 64 - 71
  • [24] HEURISTIC ALGORITHM FOR PARTITIONING OF A GRAPH
    MILGRAM, M
    DUBUISSON, B
    RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH, 1977, 11 (02): : 175 - 199
  • [25] Multi-level parallel scheduling of dependent-tasks using graph-partitioning and hybrid approaches over edge-cloud
    Kaur, Mandeep
    Kadam, Sanjay
    Hannoon, Naeem
    SOFT COMPUTING, 2022, 26 (11) : 5347 - 5362
  • [26] On combining graph-partitioning with non-parametric clustering for image segmentation
    Martínez, AM
    Mittrapiyanuruk, P
    Kak, AC
    COMPUTER VISION AND IMAGE UNDERSTANDING, 2004, 95 (01) : 72 - 85
  • [27] A two-way graph partitioning using a heuristic procedure
    Mani, N
    ANZIIS 96 - 1996 AUSTRALIAN NEW ZEALAND CONFERENCE ON INTELLIGENT INFORMATION SYSTEMS, PROCEEDINGS, 1996, : 342 - 345
  • [28] A Parallel Task Assignment Using Heuristic Graph Matching
    Mohan, R.
    Gupta, Amitava
    ADVANCES IN PARALLEL, DISTRIBUTED COMPUTING, 2011, 203 : 334 - +
  • [29] Multilevel heuristic algorithm for graph partitioning
    Baños, R
    Gil, C
    Ortega, J
    Montoya, FG
    APPLICATIONS OF EVOLUTIONARY COMPUTING, 2003, 2611 : 143 - 153
  • [30] An application of XML and XLink using a graph-partitioning method and a density map for information retrieval and knowledge discovery
    Guillaume, D
    Murtagh, F
    ASTRONOMICAL DATA ANALYSIS SOFTWARE AND SYSTEMS VIII, 1999, 172 : 278 - 282