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

Celý popis

Podrobná bibliografia

Vydané v:	SC24-W: Workshops of the International Conference for High Performance Computing, Networking, Storage and Analysis s. 697 - 702
Hlavní autori:	Rao, Ritvik, Chandrasekar, Kavitha, Kale, Laxmikant
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 17.11.2024
Predmet:	Conferences Costs graphs High performance computing Libraries Monitoring Optimization Parallel algorithms Scalability Shortest path problem sssp Synchronization
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!