An Adaptive Asynchronous Approach for the Single-Source Shortest Paths Problem

Large-scale graphs with billions and trillions of vertices and edges require efficient parallel algorithms for common graph problems, one of which is single-source shortest paths (SSSP). Bulk-synchronous parallel algorithms such as ∆-stepping experience large synchronization costs at the scale of ma...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	SC24-W: Workshops of the International Conference for High Performance Computing, Networking, Storage and Analysis S. 697 - 702
Hauptverfasser:	Rao, Ritvik, Chandrasekar, Kavitha, Kale, Laxmikant
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	IEEE 17.11.2024
Schlagworte:	Conferences Costs graphs High performance computing Libraries Monitoring Optimization Parallel algorithms Scalability Shortest path problem sssp Synchronization
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!