LoboVault Home

An Experimental Comparison of Parallel Algorithms for Ear Decomposition of Graphs using Two Leading Paradigms

LoboVault

Please use this identifier to cite or link to this item: http://hdl.handle.net/1928/54

An Experimental Comparison of Parallel Algorithms for Ear Decomposition of Graphs using Two Leading Paradigms

Show full item record

Title: An Experimental Comparison of Parallel Algorithms for Ear Decomposition of Graphs using Two Leading Paradigms
Author: Bader, D.A.; Illendula, A.K.
Subject: Parallel Algorithms
Symmetric Multiprocessors (SMP)
Shared Memory
Message Passing Interface (MPI)
Experimental Parallel Algorithmics
Abstract: Graph decomposition is an important and necessary operation when solving graph-theoretic problems on parallel computers, for instance, from computational fluid dynamics, mechanics, and astrophysics. In this paper, we design and analyze message-passing and shared-memory parallel algorithms that efficiently decompose a planar graph into a number of ears, known as the Ear Decomposition. This decomposition provides a general framework for solving graph problems efficiently in parallel. Our study includes both theoretical analysis and confirmation of the complexity cost using two leading parallel programming paradigms, namely, message-passing (MPI) and shared-memory (SMP) implementations. A catalog of both regular and irregular input graphs are provided to benchmark these algorithms in our empirical study.
Date: 2000-05-01
Series: EECE-Technical Report-00-002
Description: Technical Reports
URI: http://hdl.handle.net/1928/54


Files in this item

Files Size Format View
EECE-TR-00-002.pdf 342.1Kb PDF View/Open

This item appears in the following Collection(s)

Show full item record

UNM Libraries

Search LoboVault


Browse

My Account