A Parallel Maximal Matching Algorithm for Large Graphs Using Pregel
スポンサーリンク
概要
- 論文の詳細を見る
Graph matching is to find an independent edge set in a graph. It can be used for various purposes such as finding a cover in a graph, chemical structural computations, multi-level graph partitioning and so on. When a graph is too large to be handled by a single machine, we should use multiple machines. In this paper, we use Pregel, a cloud graph processing architecture which is able to process massive scale graph data in scalable and fault-tolerant ways. We propose a parallel maximal matching algorithm described in the Pregels vertex-centric BSP model. We test our algorithm on an 8 node cluster and the results show that our algorithm can realize high quality matching for a large graph in a short time. Also, our algorithm is linearly scalable with the number of machines.
- The Institute of Electronics, Information and Communication Engineersの論文
The Institute of Electronics, Information and Communication Engineers | 論文
- Compensation Effect of Quasi-Inverse Filter (QIF) on Frequency Characteristic Distortion in Wideband Systems
- Subblock Processing for Frequency-Domain Turbo Equalization under Fast Fading Environments
- Measurement-Based Performance Evaluation of Coded MIMO-OFDM Spatial Multiplexing with MMSE Spatial Filtering in an Indoor Line-of-Sight Environment
- Design of a Multiple-Input SC DC-DC Converter Realizing Long Battery Runtime
- The Influence of a Low-Level Color or Figure Adaptation on a High-Level Face Perception