Abstract
Two adaptive, level-order tree traversal algorithms are proposed for an exclusive-read and exclusive-write (EREW), parallel random access machine (PRAM) model of computation. Our breadth-first traversal algorithm for a general tree with n nodes achieves O((n/p)*log n/log(n/p)) time complexity using p processors on the EREW model, and hence it attains optimal speedup for p ≤ n1−e, where 0
Author supplied keywords
Cite
CITATION STYLE
Chen, C. C. Y., & Das, S. K. (1990). Parallel breadth-first and breadth-depth traversals of general trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 468 LNCS, pp. 395–404). Springer Verlag. https://doi.org/10.1007/3-540-53504-7_97
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
