Amorphous parallel algorithms for shortest paths

A new, efficient and highly engineered variant of the well-known Delta-Stepping(DS) algorithm is presented for computing shortest paths in time-dependent networks using amorphous parallelism. This new variant was experimentally evaluated in two scenarios, using real-world data sets (road networks of...

Full description

Bibliographic Details
Main Author: Παπαδόπουλος, Αναστάσιος
Other Authors: Ζαρολιάγκης, Χρήστος
Format: Thesis
Language:English
Published: 2019
Subjects:
Online Access:http://hdl.handle.net/10889/12620