A Parallelization of State-of-the-Art Graph Bisection Algorithms on the Grid(HPC-1 : Grid Application (1))

スポンサーリンク

概要

• 論文の詳細を見る

• We have parallelized Reactive Randomized Tabu Search (RRTS) graph partition algorithm and adapted it to the grid environment. Speedup is achieved by parallelizing scoring phase of RRTS. We also introduced two techniques: multilevel scoring and parallel initialization. By using multilevel scoring, tabu lengths are highly tuned to adapt large graphs. And by parallel initialization, dispersed computing efforts are centralized to output more consistent graph partitions. Experiments show that our approach significantly outperformed state-of-the-art heuristics by partitioning large graphs with higher quality and efficiency.

• 一般社団法人情報処理学会の論文
• 2006-07-31

著者

• Yonezawa Akinori

  Graduate School Of Information Science And Technology The University Of Tokyo

• DUN NAN

  The University of Tokyo

• TAURA KENJIRO

  The University of Tokyo

• YONEZAWA AKINORI

  The University of Tokyo

• Dun Nan

  Graduate School Of Information Science And Technology The University Of Tokyo

関連論文

• GMount: building ad-hoc distributed file systems by GXP and SSHFS-MUX (ハイパフォーマンスコンピューテイング 2008年並列/分散/協調処理に関する『佐賀』サマー・ワークショップ(SWoPP佐賀2008)--研究会・連続同時開催)
• A Parallelization of State-of-the-Art Graph Bisection Algorithms on the Grid(HPC-1 : Grid Application (1))
• Performance Evaluation of a Distributed File System with Locality-Aware Metadata Lookups (コンピューティングシステム Vol.4 No.4)
• Performance Evaluation of a Distributed File System with Locality-Aware Metadata Lookups

スポンサーリンク