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...
| Κύριος συγγραφέας: | |
|---|---|
| Άλλοι συγγραφείς: | |
| Μορφή: | Thesis |
| Γλώσσα: | English |
| Έκδοση: |
2019
|
| Θέματα: | |
| Διαθέσιμο Online: | http://hdl.handle.net/10889/12620 |
