Designing a Multicore Graph Library

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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2012 IEEE 10th International Symposium on Parallel and Distributed Processing with Applications s. 721 - 728
Hlavní autoři: Samer, P., Sampaio, A. H., Milanes, A., Urrutia, S.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.07.2012
Témata:
Algorithm design and analysis
Data structures
graph
Libraries
library
magical
multicore
Multicore processing
parallel
Programming
Vectors
ISBN:1467316318, 9781467316316
ISSN:2158-9178
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
ISBN:1467316318
9781467316316
ISSN:2158-9178
DOI:10.1109/ISPA.2012.106