A Parallel Algorithm for Transitive Closure
by
E. N. Caceres
,
Mato Grosso Sul
,
Campo Grande-ms-brazil
,
S. W. Song
,
J. L. Szwarcfiter
BibTeX
@MISC{Caceres_aparallel,
author = {E. N. Caceres and Mato Grosso Sul and Campo Grande-ms-brazil and S. W. Song and J. L. Szwarcfiter},
title = {A Parallel Algorithm for Transitive Closure},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present a parallel algorithm for the problem of computing the transitive closure for an acyclic digraph D with n vertices and m edges. We use the BSP/CGM model of parallel computing. Our algorithm uses O(log p) rounds of communications with p processors, where p n, and each processor has O( mn ) local memory. The local computation of each processor is equal to the product of the number of edges and vertices of D that are stored in p.
