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

Nikas, K; Anastopoulos, N; Goumas, G; Koziris, N

dc.contributor.author	Nikas, K	en
dc.contributor.author	Anastopoulos, N	en
dc.contributor.author	Goumas, G	en
dc.contributor.author	Koziris, N	en
dc.date.accessioned	2014-03-01T02:51:52Z
dc.date.available	2014-03-01T02:51:52Z
dc.date.issued	2009	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/35712
dc.subject	Data Structure	en
dc.subject	dijkstra's algorithm	en
dc.subject	Graph Algorithm	en
dc.subject	Greedy Algorithm	en
dc.subject	Priority Queue	en
dc.subject	Transactional Memory	en
dc.subject	Single Source Shortest Path	en
dc.title	Employing Transactional Memory and Helper Threads to Speedup Dijkstra's Algorithm	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1109/ICPP.2009.60	en
heal.identifier.secondary	http://dx.doi.org/10.1109/ICPP.2009.60	en
heal.publicationDate	2009	en
heal.abstract	Abstract—In this paper we work on the parallelization of the inherently serial Dijkstra’s algorithm on modern multicore plat- forms. 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 algo- rithm and	en
heal.journalName	International Conference on Parallel Processing	en
dc.identifier.doi	10.1109/ICPP.2009.60	en