| Alternate document: Details Synchronisation-efficient parallel graph colouring (Extended Abstract) (04) Alexander Tiskin |
Alexander Tiskin  Home/Search
Context
Related
| dcs.warwick.ac.uk/~tiskin/pub...apsp.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: dcs.warwick.ac.uk/~tiskin/pub/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The model of bulk-synchronous parallel (BSP) computation is an emerging paradigm of general-purpose parallel computing. We propose a new p-processor BSP algorithm for the all-pairs shortest paths problem in a weighted directed dense graph. In contrast with the general algebraic path algorithm, which performs O(p^½) to O(p^2/3) global synchronisation steps, our new algorithm only requires O(log p) synchronisation steps. (Update)
Similar documents based on text: More All
0.5: Communication Lower Bounds for Distributed-Memory Matrix.. - Irony, Toledo (2004) (Correct)
0.4: Synchronisation-efficient parallel graph colouring (Extended.. - Tiskin (2004) (Correct)
0.4: Communication-Efficient Parallel Gaussian Elimination - Tiskin (2003) (Correct)
BibTeX entry: (Update)
@misc{ tiskin-synchronisationefficient,
author = "Alexander Tiskin",
title = "Synchronisation-Efficient Parallel All-Pairs Shortest Paths Computation",
url = "citeseer.ist.psu.edu/tiskin04synchronisationefficient.html" }
Citations (may not include all citations):735 A bridging model for parallel computation (context) - Valiant - 1990
310 A note on two problems in connection with graphs (context) - Dijkstra - 1959
308 Matrix multiplication via arithmetic progressions (context) - Coppersmith, Winograd - 1990
175 Designing and Building Parallel Programs (context) - Foster - 1995
79 Communication complexity of PRAMs (context) - Aggarwal, Chandra et al. - 1990
64 Scalable computing - McColl - 1995
50 The MIT Electrical Engineering and Computer Science Series (context) - Cormen, Leiserson et al. - 2001
48 the exponent of the all pairs shortest path problem (context) - Alon, Galil et al. - 1997
31 The Algorithm Design Manual (context) - Skiena - 1997
22 Linear and Combinatorial Optimization in Ordered Algebraic S.. (context) - Zimmermann - 1981
18 Path problems in graphs - Rote - 1990
14 Linear algebra in dioids: A survey of recent results (context) - Gondran, Minoux - 1984
13 Subcubic cost algorithms for the all pairs shortest path pro.. - Takaoka - 1998
9 Ecient algorithms for shortest paths in sparse networks (context) - Johnson - 1977
8 A BSP realisation of Strassen's algorithm - McColl - 1996
[Article contains additional citations not shown here]
Documents on the same site (http://www.dcs.warwick.ac.uk/~tiskin/pub/): More
Communication-Efficient Parallel Gaussian Elimination - Tiskin (2003) (Correct)
Packing Tripods: Narrowing the Density Gap - Tiskin (2004) (Correct)
Synchronisation-efficient parallel graph colouring (Extended.. - Tiskin (2004) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC