Aris Pagourtzis, Igor Potapov, Wojciech Rytter  Home/Search
Context
Related
| csc.liv.ac.uk/~igor/pape...PPR_pvm01.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: csc.liv.ac.uk/~igo...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We investigate experimentally a dependency graph approach to the distributed parallel computation of the generic transitive closure problem. A parallel coarse-grained algorithm is derived from a negrained algorithm. Its advantage is that approximately half of the work is organised as totally independent computation sequences of several processes. (Update)
Active bibliography (related documents): More All
0.7: On The PVM Computations of Transitive Closure - Chan, Gibbons, Pias, Rytter (Correct)
0.5: A Self-Stabilized Distributed Algorithm for the Range.. - Huiban, Verhoeven (Correct)
0.1: P-hardness of Equivalence Testing on Finite-State Processes - Sawa, Jancar (2001) (Correct)
Similar documents based on text: More All
0.3: Almost optimal fully LZW-compressed pattern matching - Gasieniec, Rytter (1999) (Correct)
0.2: A Simple Randomized Parallel Algorithm for Maximal.. - Garrido, Jarominek.. (Correct)
0.2: Observations On Log(n) Time Parallel Recognition Of.. - Rossmanith, Rytter (Correct)
BibTeX entry: (Update)
@article{ pagourtzis01pvm,
author = "Aris Pagourtzis and Igor Potapov and Wojciech Rytter",
title = "{PVM} Computation of the Transitive Closure: The Dependency Graph Approach",
journal = "Lecture Notes in Computer Science",
volume = "2131",
pages = "249--??",
year = "2001",
url = "citeseer.ist.psu.edu/730728.html" }
Citations (may not include all citations):1450 The design and analysis of computer algorithms (context) - Aho, Hopcroft et al. - 1974
981 Introduction to Parallel Algorithms and Architectures : Arra.. (context) - Leighton - 1991
81 A bridging model for parallel computation (context) - Valiant - 1990
13 A systolic array algorithm for the algebraic path problem (context) - Rote - 1985
6 A new approach for automatic parallelization of blocked line.. - Kung, Subhlok - 1992
6 Ecient parallel algorithms (context) - Gibbons, Rytter - 1988
2 Minimum cost spanning trees as a path nding problem (context) - Maggs, Plotkin - 1987
2 Transitive Closure on the Instrucion Systolic Array (context) - Lang - 1991
1 The PVM Computations of Transitive Closure and Algebraic Pat.. (context) - Chan, Gibbons et al. - 1998
1 All-pairs shortest paths computation in the BSP model (context) - Tiskin - 2001
Documents on the same site (http://www.csc.liv.ac.uk/~igor/publications.htm): More
Time/Space Efficient Compressed Pattern Matching - Gasieniec, Potapov (2001) (Correct)
From Post Systems to the Reachability Problems for Matrix.. - Potapov (2004) (Correct)
Time Efficient Gossiping in Known Radio Networks - Gasieniec, Potapov, Xin (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