Employing Transactional Memory and Helper Threads to Speedup Dijkstra's Algorithm

In this paper we work on the parallelization of the inherently serial Dijkstra's algorithm on modern multicore platforms. Dijkstra's algorithm is a greedy algorithm that computes single source shortest paths for graphs with non-negative edges and is based on the iterative extraction of nod...

Full description

Saved in:
Bibliographic Details
Main Authors: Nikas, K., Anastopoulos, N., Goumas, G., Koziris, N.
Format: Conference Proceeding
Language:English
Subjects:
Concurrent computing
Data mining
Graph Algorithms
Greedy algorithms
Helper Threading
Iterative algorithms
Laboratories
Multicore processing
Parallel processing
Programming profession
Speculative Multithreading
SSSP algorithms
Systems engineering and theory
Transactional Memory
Yarn
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper we work on the parallelization of the inherently serial Dijkstra's algorithm on modern multicore platforms. Dijkstra's algorithm is a greedy algorithm that computes single source shortest paths for graphs with non-negative edges and is based on the iterative extraction of nodes from a priority queue. This property limits the explicit parallelism of the algorithm and any attempt to utilize the remaining parallelism results in significant slowdowns due to synchronization overheads. To deal with these problems, we employ the concept of helper threads (HT) to extract parallelism on a non-traditional fashion and transactional memory (TM) to efficiently orchestrate the concurrent threads' accesses to shared data structures. Results demonstrate that the proposed implementation is able to achieve performance speedups (reaching up to 1.84 for 14 threads), indicating that the two paradigms could be efficiently combined.
ISSN:0190-3918
2332-5690
DOI:10.1109/ICPP.2009.60