#### Filter Results:

#### Publication Year

2006

2012

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

We present an experimental study of the single source shortest path problem with non-negative edge weights (NSSP) on large-scale graphs using the ∆-stepping parallel algorithm. We report performance results on the Cray MTA-2, a mul-tithreaded parallel computer. The MTA-2 is a high-end shared memory system offering two unique features that aid the efficient… (More)

We present an experimental study of parallel algorithms for solving the single source shortest path problem with non-negative edge weights (NSSP) on large-scale graphs. We implement Meyer and Sander's ∆-stepping algorithm and report performance results on the Cray MTA-2, a multithreaded parallel architecture. The MTA-2 is a high-end shared memory system… (More)

We present a study of multithreaded implementations of Thorup's algorithm for solving the single source shortest path (SSSP) problem for undirected graphs. Our implementations leverage the fledgling multithreaded graph library (MTGL) to perform operations such as finding connected components and extracting induced subgraphs. To achieve good parallel… (More)

- Dhirendra Pratap Singh, Nilay Khare, J. R. Crobak, J. W. Berry, K. Madduri, D A. Bader +7 others
- 2012

We present a study of parallel implementations of single source shortest path (SSSP) algorithms. In the last three decades number of parallel SSSP algorithms have been developed and implemented on the different type of machines. We have divided some of these implementations into two groups, first are those where parallelization is achieved in the internal… (More)

- Priyanka Ramanuja Kulkarni, Meenakshi Muthuraman, ● Aslesha Pansare, Nikhil Kataria, Marios Papaefthymiou, Joseph Rodrigue +6 others

- ‹
- 1
- ›