Amorphous parallel algorithms for shortest paths

• Κύριος συγγραφέας: Παπαδόπουλος, Αναστάσιος
• Άλλοι συγγραφείς: Ζαρολιάγκης, Χρήστος
• Μορφή: Thesis
• Γλώσσα: English
• Έκδοση: 2019
• Θέματα: Amorphous parallelism; Delta-stepping; Time-dependent networks; Oracle; Άμορφοι παραλληλισμοί; Χρονοεξαρτώμενα δίκτυα; 006.31

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...