Abstract
A deterministic parallel algorithm for parallel tree contraction is presented in this paper. The algorithm takes T = O(n/P) time and uses P (P ≤ n/log n) processors, where n = the number of vertices in a tree using an Exclusive Read and Exclusive Write (EREW) Parallel Random Access Machine (PRAM). This algorithm improves the results of Miller and Reif [MR85,MR87], who use the CRCW randomized PRAM model to get the same complexity and processor count. The algorithm is optimal in the sense that the product P · T is equal to the input size and gives an O(log n) time algorithm when P = n/log n. Since the algorithm requires O(n) space, which is the input size, it is optimal in space as well. Techniques for prudent parallel tree contraction are also discussed, as well as implementation techniques for fixed-connection machines.
This work was supported in part by National Science Foundation grant DCR-8514961.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Richard Anderson and Gary L. Miller. Optimal Parallel Algorithms for List Ranking. Technical Report, USC, Los Angeles, 1987.
I. Bar-On and U. Vishkin. Optimal parallel generation of a computation tree form. ACM Transactions on Programming Languages and Systems, 7 (2): 348–357, April 1985.
R. Cole and U. Vishkin. Approximate and exact parallel scheduling with applications to list, tree, and graph problems. In 27th Annual Symposium on Foundations of Computer Science, pages 478–491, IEEE, Toronto, Oct 1986.
Richard Cole and Uzi Vishkin. Deterministic coin tossing with applications to optimal list ranking. Information and Control, 70 (1): 32–53, 1986.
Eliezer Dekel, Simeon Ntafos, and Shie-Tung Peng. Parallel Tree Techniques and Code Opimization, pages 205–216. Volume 227 of Lecture Notes in Computer Science, Springer-Verlag, 1986.
Anna Karlin and Eli Upfal. Parallel hashing—an efficient implementation of shared memory. In Proceedings of the 18th Annual ACM Symposium on Theory of Computing, pages 160–168, ACM, Berkeley, May 1986.
Gary L. Miller and John H. Reif. Parallel tree contraction part 2: further applications. SIAM J. Comput. submitted.
Gary L. Miller and John H. Reif. Parallel tree contraction and its applications. In 26th Symposium on Foundations of Computer Science, pages 478–489, IEEE, Portland, Oregon, 1985.
Gary L. Miller and John H. Reif. Parallel Tree Contraction Part 1: Fundamentals. Volume 5, JAI Press, 1987. to appear.
Gary L. Miller and Shang-Hua Teng. Systematic methods for tree based parallel algorithm development. In Second International Conference on Supercomputing, pages 392–403, Santa Clara, May 1987.
A. Ranade. How to emulate shared memory. In 28th Annual Symposium on Foundations of Computer Science, pages 185–194, IEEE, Los Angeles, Oct 1987.
R. E. Tarjan and U. Vishkin. An efficient parallel biconnectivity algorithm. SIAM J. Comput., 14 (4): 862–874, November 1985.
J. C. Wyllie. The Complexity of Parallel Computation. Technical Report TR 79–387, Department of Computer Science, Cornell University, Ithaca, New York, 1979.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1988 Plenum Press, New York
About this chapter
Cite this chapter
Gazit, H., Miller, G.L., Teng, SH. (1988). Optimal Tree Contraction in the EREW Model. In: Tewksbury, S.K., Dickinson, B.W., Schwartz, S.C. (eds) Concurrent Computations. Springer, Boston, MA. https://doi.org/10.1007/978-1-4684-5511-3_9
Download citation
DOI: https://doi.org/10.1007/978-1-4684-5511-3_9
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4684-5513-7
Online ISBN: 978-1-4684-5511-3
eBook Packages: Springer Book Archive