Designing a multicore graph library

P. Samer, A.H. Sampaio Oliveira, A. Milaneés, S. Urrutia

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Abstract

Graph Theory provides a set of powerful tools (both theorems and algorithms) for problem modeling and solving in numerous domains. Though there are several libraries implementing graph algorithms and targeting different platforms and users, few of those offer parallel implementations. To the best of our knowledge, there is a particular need for an easier to use and extend library, specifically designed to exploit the multicore architecture trend for high performance parallelism. In this paper we describe Magical, a new OpenMP-based C++ multicore graph library. Our focus is to provide an implementation of graph algorithms which is designed for multicore architectures, by means of an easy to use application programming interface. We describe the library design and evaluate its performance by means of a case study concerning a shortest-paths problem.
Original languageEnglish
Title of host publicationThe 10th IEEE International Symposium on Parallel and Distributed Processing with Applications
Place of PublicationPiscataway
PublisherInstitute of Electrical and Electronics Engineers
Pages721-728
Number of pages8
ISBN (Print)978-1-4673-1631-6
DOIs
Publication statusPublished - 2012
Externally publishedYes
Event10th International Symposium on Parallel and Distributed Processing with Applications (ISPA 2012) - Leganes, Spain
Duration: 10 Jul 201213 Jul 2012
Conference number: 10
http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6280412

Conference

Conference10th International Symposium on Parallel and Distributed Processing with Applications (ISPA 2012)
Abbreviated titleISPA 2012
CountrySpain
CityLeganes
Period10/07/1213/07/12
Internet address

Fingerprint

Dive into the research topics of 'Designing a multicore graph library'. Together they form a unique fingerprint.

Cite this