An Improved Hypergraph Partitioning Model for Parallel Scientific Computing
K-way hypergraph partitioning has an increasing use in parallel scientific computing because it can accurately model communication volume and has more expressions. However, the main shortcoming of hypergraph partitioning is that minimizing the so-called hyperedge cut is not entirely the same as minimizing the communication overhead; this is because it does not include the effects of communication latency and the distribution of communication overhead. We thus propose an improved hypergraph partitioning model that can take into account all these factors. Moreover, freely adjustable weighting parameters in the model also promote a flexible treatment of different optimization objectives. We also give a small scale hypergraph to verify the validity of the proposed model.
Hypergraph partitioning Parallel scientific computing Communication overhead
Ma Yonggang Tan Guozhen Wang Wei Tong Yangchun
School of Computer Science and Technology, Dalian University of Technology, Dalian, 116024, China Department of Embedded System Engineering, Neusoft Institute of Information, Dalian, 116023, China
国际会议
三亚
英文
635-638
2012-01-06(万方平台首次上网日期,不代表论文的发表时间)