Early experiences on accelerating dijkstra's algorithm using transactional memory

IPDPS 2009 - Proceedings of the 2009 IEEE International Parallel and Distributed Processing Symposium

Volumn , Issue , 2009, Pages

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

^a NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

CONCURRENT ACCESS; DIJKSTRA'S ALGORITHMS; HELPER THREADING; MULTICORE ARCHITECTURES; PARALLEL VERSION; PARALLELIZATIONS; PERFORMANCE IMPROVEMENTS; SHARED DATA; SIMULATION RESULT; SYNCHRONIZATION PRIMITIVE; TRANSACTIONAL MEMORY;

DISTRIBUTED PARAMETER NETWORKS; SOFTWARE ARCHITECTURE; STORAGE ALLOCATION (COMPUTER);

PARALLEL ALGORITHMS;

EID: 70449792769     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2009.5161103     Document Type: Conference Paper

References (21)

1. Wisconsin multifacet gems simulator. http://www.cs.wisc.edu/gems/.
2. A.-R. Adl-Tabatabai, C. Kozyrakis, and B.E. Saha. Unlocking concurrency: Multicore programming with transactional memory. ACM Queue, 4(10):24-33, 2006.
3. D.A. Bader and K. Madduri. Design and implementation of the hpcs graph analysis benchmark on symmetric multiprocessors. In HiPC, 2005.
4. D.A. Bader and K. Madduri. Gtgraph: A suite of synthetic graph generators. 2006. http://www.cc.gatech.edu/̃kamesh/GTgraph/.
5. G.S. Brodal, J.L. Traff, C.D. Zaroliagis, and I. Stadtwald. A parallel priority queue with constant time operations. Journal of Parallel and Distributed Computing, 49:4-21, 1998.
6. C. CaoMinh, J. Chung, C. Kozyrakis, and K. Olukotun STAMP: Stanford Transactional Applications for Multi-Processing. In IISWC 2008.
7. D. Chakrabarti, Y. Zhan, and C. Faloutsos. R-mat: A recursive model for graph mining. In ICDM, 2004.
8. J. D. Collins, H. Wang, D. M. Tullsen, C. Hughes, Y. Lee, D. Lavery, and J. P. Shen. Speculative precomputation: Longrange prefetching of delinquent loads. In ISCA, 2001.
9. T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein. Introduction to Algorithms. The MIT Press, 2001.
10. R. Dial. Algorithm 360: Shortest path forest with topological ordering. Communications of the ACM, 12:632-633, 1969.
11. N. Edmonds, A. Breuer, D. Gregor, and A. Lumsdaine. Singlesource shortest paths with the parallel boost graph library. In 9th DIMACS Implementation Challenge, 2006.
12. M. Herlihy and E. Moss. Transactional memory: Architectural support for lock-free data structures. In ISCA, 1993.
13. G.C. Hunt, M.M. Michael, S. Parthasarathy, and M.L. Scott. An efficient algorithm for concurrent priority queue heaps. Inf. Proc. Letters, 60:151-157, 1996.
14. K. Madduri, D.A. Bader, J.W. Berry, and J.R. Crobak. Parallel shortest path algorithms for solving large-scale instances. In 9th DIMACS Implementation Challenge, 2006.
15. P.S. 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, 35(2):50-58, 2002.
16. 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. SIGARCH Comput. Archit. News, 2005.
17. U. Meyer and P. Sanders. Delta-stepping: A parallel single source shortest path algorithm. In ESA, 1998.
18. M. L. Scott, M. F. Spear, L. Daless, and V. J.Marathe. Delaunay triangulation with transactions and barriers. In IISWC, 2007.
19. I.Watson, C. Kirkham, andM. Lujan. A study of a transactional parallel routing algorithm. In PACT, 2007.
20. L. Yen, J. Bobba, M.R.Marty, K.E. Moore, H. Volos, M.D. Hill, M.M. Swift, and D.A.Wood. LogTM-SE: Decoupling hardware transactional memory from caches. In HPCA, 2007.
21. W. Zhang, B. Calder, and D.M. Tullsen. An event-driven multithreaded dynamic optimization framework. In PACT, 2005.