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

Full description

Bibliographic Details

Published in:	SC24-W: Workshops of the International Conference for High Performance Computing, Networking, Storage and Analysis pp. 697 - 702
Main Authors:	Rao, Ritvik, Chandrasekar, Kavitha, Kale, Laxmikant
Format:	Conference Proceeding
Language:	English
Published:	IEEE 17.11.2024
Subjects:	Conferences Costs graphs High performance computing Libraries Monitoring Optimization Parallel algorithms Scalability Shortest path problem sssp Synchronization
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!