Early experiences on accelerating dijkstra's algorithm using transactional memory

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

dc.contributor.author	Anastopoulos, N	en
dc.contributor.author	Nikas, K	en
dc.contributor.author	Goumas, G	en
dc.contributor.author	Koziris, N	en
dc.date.accessioned	2014-03-01T02:46:07Z
dc.date.available	2014-03-01T02:46:07Z
dc.date.issued	2009	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/32556
dc.subject	dijkstra's algorithm	en
dc.subject	Early Experience	en
dc.subject	Perforation	en
dc.subject	Performance Improvement	en
dc.subject	Transactional Memory	en
dc.subject.other	Concurrent access	en
dc.subject.other	Dijkstra's algorithms	en
dc.subject.other	Helper threading	en
dc.subject.other	Multicore architectures	en
dc.subject.other	Parallel version	en
dc.subject.other	Parallelizations	en
dc.subject.other	Performance improvements	en
dc.subject.other	Shared data	en
dc.subject.other	Simulation result	en
dc.subject.other	Synchronization primitive	en
dc.subject.other	Transactional memory	en
dc.subject.other	Distributed parameter networks	en
dc.subject.other	Software architecture	en
dc.subject.other	Storage allocation (computer)	en
dc.subject.other	Parallel algorithms	en
dc.title	Early experiences on accelerating dijkstra's algorithm using transactional memory	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1109/IPDPS.2009.5161103	en
heal.identifier.secondary	http://dx.doi.org/10.1109/IPDPS.2009.5161103	en
heal.identifier.secondary	5161103	en
heal.publicationDate	2009	en
heal.abstract	In this paper we use Dijkstra's algorithm as a challenging, hard to parallelize paradigm to test the efficacy of several parallelization techniques in a multicore architecture. We consider the application of Transactional Memory (TM) as a means of concurrent accesses to shared data and compare its performance with straightforward parallel versions of the algorithm based on traditional synchronization primitives. To increase the granularity of parallelism and avoid excessive synchronization, we combine TM with Helper Threading (HT). Our simulation results demonstrate that the straightforward parallelization of Dijkstra's algorithm with traditional locks and barriers has, as expected, disappointing performance. On the other hand, TM by itself is able to provide some performance improvement in several cases, while the version based on TM and HT exhibits a significant performance improvement that can reach up to a speedup of 1.46. © 2009 IEEE.	en
heal.journalName	IPDPS 2009 - Proceedings of the 2009 IEEE International Parallel and Distributed Processing Symposium	en
dc.identifier.doi	10.1109/IPDPS.2009.5161103	en