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 language | English |
|---|---|
| Title of host publication | The 10th IEEE International Symposium on Parallel and Distributed Processing with Applications |
| Place of Publication | Piscataway |
| Publisher | Institute of Electrical and Electronics Engineers |
| Pages | 721-728 |
| Number of pages | 8 |
| ISBN (Print) | 978-1-4673-1631-6 |
| DOIs | |
| Publication status | Published - 2012 |
| Externally published | Yes |
| Event | 10th International Symposium on Parallel and Distributed Processing with Applications (ISPA 2012) - Leganes, Spain Duration: 10 Jul 2012 → 13 Jul 2012 Conference number: 10 http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6280412 |
Conference
| Conference | 10th International Symposium on Parallel and Distributed Processing with Applications (ISPA 2012) |
|---|---|
| Abbreviated title | ISPA 2012 |
| Country/Territory | Spain |
| City | Leganes |
| Period | 10/07/12 → 13/07/12 |
| Internet address |