Minimizing Communication in All-Pairs Shortest Paths

We consider distributed memory algorithms for the all-pairs shortest paths (APSP) problem. Scaling the APSP problem to high concurrencies requires both minimizing inter-processor communication as well as maximizing temporal data locality. The 2.5D APSP algorithm, which is based on the divide-and-con...

Full description

Bibliographic Details

Published in:	2013 IEEE 27th International Symposium on Parallel and Distributed Processing pp. 548 - 559
Main Authors:	Solomonik, Edgar, Buluç, Aydın, Demmel, James
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.05.2013
Subjects:	2.5D algorithms Algorithm design and analysis all-pairs shortest paths Bandwidth communication-avoiding algorithms Heuristic algorithms Matrix decomposition Particle separators Partitioning algorithms
ISBN:	146736066X, 9781467360661
ISSN:	1530-2075
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!