Employing transactional memory and helper threads to speedup Dijkstra'S algorithm

Proceedings of the International Conference on Parallel Processing

Volumn , Issue , 2009, Pages 388-395

  Nikas, Konstantinos ^a   Anastopoulos, Nikos ^a   Goumas, Georgios ^a   Koziris, Nectarios ^a  

^a Division of Computer Science   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

CONCURRENT THREADS; DIJKSTRA'S ALGORITHMS; GREEDY ALGORITHMS; HELPER THREAD; ITERATIVE EXTRACTION; MULTI CORE; NON-TRADITIONAL; PARALLELIZATIONS; PRIORITY QUEUES; SHARED DATA STRUCTURE; SHORTEST PATH; SINGLE SOURCE; TRANSACTIONAL MEMORY;

CONCURRENCY CONTROL; DATA STRUCTURES; STORAGE ALLOCATION (COMPUTER);

ALGORITHMS;

EID: 77951441976     PISSN: 01903918     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPP.2009.60     Document Type: Conference Paper

References (23)

1. T. Cormen, C. Leiserson, R. Rivest, and C. Stein, Introduction to Algorithms. The MIT Press, 2001.
2. G. Brodal, J. Traff, C. Zaroliagis, and I. Stadtwald, "A parallel priority queue with constant time operations,": J. Parallel and Distributed Computing, vol. 49, pp. 4-21, 1998.
3. U. Meyer and P. Sanders, "Delta-stepping: A parallel single source shortest path algorithm,": In Proc. 6th Ann. European Symp. on Algorithms (ESA'98), 1998.
4. N. Anastopoulos, K. Nikas, G. Goumas, and N. Koziris, "Early experiences on accelerating dijkstra's algorithm using transactional memory,": In Proc. 3rd Workshop on Multithreaded Architectures and Applications (MTAAP'09), 2009.
5. R. Dial, "Algorithm 360: Shortest path forest with topological ordering,": Communications of the ACM, vol. 12, pp. 632-633, 1969.
6. N. Edmonds, A. Breuer, D. Gregor, and A. Lumsdaine, "Single-source shortest paths with the parallel boost graph library,": In 9th DIMACS Implementation Challenge- The Shortest Path Problem, 2006.
7. K. Madduri, D. Bader, J. Berry, and J. Crobak, "Parallel shortest path algorithms for solving large-scale instances,": In 9th DIMACS Implementation Challenge- The Shortest Path Problem, 2006.
8. J. D. Collins, H. Wang, D. M. Tullsen, C. Hughes, Y. Lee, D. Lavery, and J. P. Shen, "Speculative precomputation: Long-range prefetching of delinquent loads,": In Proc. 28th Ann. Int'l Symp. on Computer Architecture (ISCA'01), 2001.
9. W. Zhang, B. Calder, and D. Tullsen, "An event-driven multithreaded dynamic optimization framework,": In Proc. 14th Int'l Conf. on Parallel Architectures and Compilation Techniques (PACT'05), 2005.
10. M. Herlihy and E. Moss, "Transactional memory: Architectural support for lock-free data structures,": In Proc. 20th Ann. Int'l Symp. on Computer Architecture (ISCA'93).
11. A. Adl-Tabatabai, C. Kozyrakis, and B. Saha, "Unlocking concurrency: Multicore programming with transactional memory,": ACM Queue, vol. 4, no. 10, pp. 24-33, 2006.
12. M. Tremblay and S. Chaudhry, "A third-generation 65nm 16-core 32-thread plus 32-scout-thread CMT SPARC processor,": In Proc. Int'l Solid State Circuits Conf. (ISSCC '08), 2008.
13. B. Saha, A.-R. Adl-Tabatabai, R. L. Hudson, C. C. Minh, and B. Hertzberg, "Mcrt-stm: A high performance software transactional memory system for a multi-core runtime,": In Proc. 11th Symp. on Principles and Practice of Parallel Programming (PPoPP'06), 2006.
14. I. Watson, C. Kirkham, and M. Lujan, "A study of a transactional parallel routing algorithm,": In Proc. 16th Int'l Conf. on Parallel Architecture and Compilation Techniques (PACT'07), 2007.
15. M. L. Scott, M. F. Spear, L. Daless, and V. J. Marathe, "Delaunay triangulation with transactions and barriers,": In IEEE Intl. Symp. on Workload Characterization (IISW'07), 2007.
16. S. Kang and D. A. Bader, "An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs,": In Proc. 14th Symp. on Principles and Practice of Parallel Programming (PPoPP'09), 2009.
17. M. Martin, D. Sorin, B. Beckmann, M. Marty, M. Xu, A. Alameldeen, K. Moore, M. Hill, and D. Wood, "Multifacet's general execution-driven multiprocessor simulator (gems) toolset,": Comput. Archit. News, vol. 33, no. 4, pp. 92-99, 2005.
18. "Wisconsin multifacet gems simulator,": Http://www.cs.wisc.edu/ gems
19. P. Magnusson, M. Christensson, J. Eskilson, D. Forsgren, G. Hallberg, J. Hogberg, F. Larsson, A. Moestedt, and B. Werner, "Simics: A full system simulation platform,": Computer, vol. 35, no. 2, pp. 50-58, 2002.
20. L. Yen, J. Bobba, M. Marty, K. Moore, H. Volos, M. Hill, M. Swift, and D. Wood, "Logtm-se: Decoupling hardware transactional memory from caches,": Proc. 13th Int'l Symp. on High Performance Computer Architecture (HPCA'07), 2007.
21. D. Bader and K. Madduri, "Gtgraph: A suite of synthetic graph generators,": 2006, http://www.cc.gatech.edu/kamesh/GTgraph
22. G. Hunt, M. Michael, S. Parthasarathy, and M. Scott, "An efficient algorithm for concurrent priority queue heaps,": Inf. Proc. Letters, vol. 60, pp. 151-157, 1996.
23. L. Porter, B. Choi, and D. Tullsen, "Mapping out a path from hardware transactional memory to speculative multithreading,": In Proc. 18th Int'l Conf. on Parallel Architectures and Compilation Techniques (PACT'09), 2009- in press.