A parallel maximal matching algorithm for large graphs using Pregel

Byungnam Lim, Yon Dohn Chung

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

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 Pregel's 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.

Original languageEnglish
Pages (from-to)1910-1913
Number of pages4
JournalIEICE Transactions on Information and Systems
VolumeE97-D
Issue number7
DOIs
Publication statusPublished - 2014 Jan 1

Fingerprint

Processing

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Software
  • Artificial Intelligence
  • Hardware and Architecture
  • Computer Vision and Pattern Recognition

Cite this

A parallel maximal matching algorithm for large graphs using Pregel. / Lim, Byungnam; Chung, Yon Dohn.

In: IEICE Transactions on Information and Systems, Vol. E97-D, No. 7, 01.01.2014, p. 1910-1913.

Research output: Contribution to journalArticle

@article{becca49eec65412c9b02b5cfa48b159a,
title = "A parallel maximal matching algorithm for large graphs using Pregel",
abstract = "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 Pregel's 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.",
keywords = "Matching, Parallel matching, Pregel",
author = "Byungnam Lim and Chung, {Yon Dohn}",
year = "2014",
month = "1",
day = "1",
doi = "10.1587/transinf.E97.D.1910",
language = "English",
volume = "E97-D",
pages = "1910--1913",
journal = "IEICE Transactions on Information and Systems",
issn = "0916-8532",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "7",

}

TY - JOUR

T1 - A parallel maximal matching algorithm for large graphs using Pregel

AU - Lim, Byungnam

AU - Chung, Yon Dohn

PY - 2014/1/1

Y1 - 2014/1/1

N2 - 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 Pregel's 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.

AB - 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 Pregel's 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.

KW - Matching

KW - Parallel matching

KW - Pregel

UR - http://www.scopus.com/inward/record.url?scp=84903733050&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84903733050&partnerID=8YFLogxK

U2 - 10.1587/transinf.E97.D.1910

DO - 10.1587/transinf.E97.D.1910

M3 - Article

VL - E97-D

SP - 1910

EP - 1913

JO - IEICE Transactions on Information and Systems

JF - IEICE Transactions on Information and Systems

SN - 0916-8532

IS - 7

ER -