https://github.com/aggstam/mpi_d_step_sssp
This program implements D-Stepping algorithm introduced by U.Mayers and P.Sanders, using SSSP algorith for faster execution.
https://github.com/aggstam/mpi_d_step_sssp
algorithm c mpi parallel
Last synced: 7 months ago
JSON representation
This program implements D-Stepping algorithm introduced by U.Mayers and P.Sanders, using SSSP algorith for faster execution.
- Host: GitHub
- URL: https://github.com/aggstam/mpi_d_step_sssp
- Owner: aggstam
- License: apache-2.0
- Created: 2021-11-03T14:10:08.000Z (almost 4 years ago)
- Default Branch: main
- Last Pushed: 2023-05-16T15:26:56.000Z (over 2 years ago)
- Last Synced: 2025-01-12T20:33:33.666Z (9 months ago)
- Topics: algorithm, c, mpi, parallel
- Language: C
- Homepage:
- Size: 57.6 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# mpi_d_step_sssp
This program implements D-Stepping algorithm introduced by U.Mayers and P.Sanders [1], using SSSP algorith for faster execution [2].
A graphical presentation of the algorith can be found in link:
https://cs.iupui.edu/~fgsong/LearnHPC/sssp/deltaStep.html
Graph is read from an input file created by RandomGraph generator by S.Pettie and V.Ramachandran [3].
Two implementations are included, one executing the algorithm in serial, and one using the MPI Standard.
MPI implementation requires *openmpi* package to be installed.
## Usage
Both version can be invocted via the Makefile, or by directly compiling and executing.
### Make usage
#### Normal code
```
% make
```
To configure D step value:
```
% make DSTEP={d_step}
```
To include a different input file:
```
% make FILE={file_path}
```
To configure a different output file:
```
% make OUTPUT={file_path}
```
#### MPI code
```
% make mpi
```
To configure different how many processes to use:
```
% make mpi PROCESSES={processes}
```
To configure D step value:
```
% make mpi DSTEP={d_step}
```
To include a different input file:
```
% make mpi FILE={file_path}
```
To configure a different output file:
```
% make mpi OUTPUT={file_path}
```
### Direct usage
#### Normal code
Compilation:
```
% gcc -o d_step_sssp d_step_sssp.c
```
Execution:
```
% ./d_step_sssp {d_step} {input_file} {output_file}
```
#### MPI code
Compilation:
```
% mpicc -lm -o mpi_d_step_sssp mpi_d_step_sssp.c
```
Execution:
```
% mpiexec -np {processes} ./mpi_d_step_sssp {d_step} {input_file} {output_file}
```
## Execution examples
### Normal code
```
❯ make
Executing normal code...
gcc -o d_step_sssp d_step_sssp.c
./d_step_sssp 0.25 grph_1000 output
Finding shortest path distances for each node of a Graph using D-Stepping algorithm.
D-Stepping value: 0.250000
Graph will be retrieved from input file: grph_1000
Distances matrix will be written in output file: output
Nodes count: 1000
Algorithm started, please wait...
Algorithm finished!
Time spend: 15.210633 secs
Writing distances to output file.
Program terminates.
```
### MPI code
```
❯ make mpi
Executing MPI code...
mpicc -lm -o mpi_d_step_sssp mpi_d_step_sssp.c
mpiexec -np 4 ./mpi_d_step_sssp 0.25 grph_1000 output
Finding shortest path distances for each node of a Graph using D-Stepping algorithm.
D-Stepping value: 0.250000
Graph will be retrieved from input file: grph_1000
Distances matrix will be written in output file: output
Nodes count: 1000
Algorithm started, please wait...
Algorithm finished!
Time spend: 3.957982 secs
Writing distances to output file.
```
## References
[1] Ulrich Meyer and Peter Sanders. Δ-stepping: a parallelizable shortest path algorithm. Journal of
Algorithms 49.1 (2003): 114-152.
[2] Chakaravarthy, V.T.; Checconi, F.; Petrini, F.; Sabharwal, Y. Scalable Single Source Shortest Path
Algorithms for Massively Parallel Systems, 28th IEEE International Parallel and Distributed Processing
Symposium , pp.889-901, 201
[3] http://www.dis.uniroma1.it/challenge9/code/Randgraph.tar.gz