Exploiting Amorphous Data Parallelism to Speed-Up Massive Time-Dependent Shortest-Path Computations.
Spyros C. KontogiannisAnastasios PapadopoulosAndreas ParaskevopoulosChristos D. ZaroliagisPublished in: ATMOS (2019)
Keyphrases
- shortest path
- data parallelism
- travel time
- combinatorial search
- parallel processing
- shortest path problem
- road network
- parallel programming
- shortest path algorithm
- distributed memory
- distributed computing
- shared memory
- routing algorithm
- parallel computation
- routing problem
- optimal path
- weighted graph
- response time
- parallel algorithm
- branch and bound algorithm