Abstract
We extend the classic parallel tree-contraction technique of Miller and Reif to handle the evaluation of a class of expression trees that does not fit their original framework. We discuss applications to the following problems: (1) Register allocation, i.e., computing the number of registers needed to evaluate a given expression if all intermediate results must be kept in registers; and (2) Broadcasting in a tree, i.e., computing the number of steps needed to transmit a message from the root to all other nodes in a given tree if each node is a processor that can communicate with a single neighbor in each step. We show that on inputs of size n, both problems can be solved with optimal speedup in O((log n)2) time on an EREW PRAM, in O(log n log log n) time on a CREW PRAM, and in O(log n) time on a CRCW PRAM.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
K. Abrahamson, N. Dadoun, D. G. Kirkpatrick, and T. Przytycka, A simple parallel tree contraction algorithm, J. Algorithms 10 (1989), pp. 287–302.
A. V. Aho, R. Sethi, and J. D. Ullman, Compilers: Principles, Techniques, and Tools, Addison-Wesley, Reading, MA, 1986.
M. Ajtai, J. Komlós, and E. Szemerédi, An O(n log n) sorting network, In Proc. 15th Annual ACM Symposium on Theory of Computing (STOC 1983), pp. 1–9.
O. Berkman and U. Vishkin, On parallel integer merging, Inform. and Comput. 106 (1993), pp. 266–285.
S. Chaudhuri and T. Hagerup, Prefix graphs and their applications, In Proc. 20th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 1994), Springer Lecture Notes in Computer Science, Vol. 903, pp. 206–218.
R. Cole, Parallel merge sort, SIAM J. Comput. 17 (1988), pp. 770–785.
R. Cole and U. Vishkin, Deterministic coin tossing with applications to optimal parallel list ranking, Inform. and Control 70 (1986), pp. 32–53.
F. E. Fich, P. Ragde, and A. Wigderson, Relations between concurrent-write models of parallel computation, SIAM J. Comput. 17 (1988), pp. 606–627.
H. Gazit, G. L. Miller, and S.-H. Teng, Optimal tree contraction in the EREW model, In Concurrent Computations: Algorithms, Architecture, and Technology, S. K. Tewksbury, B. W. Dickinson, and S. C. Schwartz (eds.), Chap. 9, pp. 139–156, Plenum Press, New York, 1988.
S. R. Kosaraju and A. L. Delcher, Optimal parallel evaluation of tree-structured computations by raking, In Proc. 3rd Aegean Workshop on Computing (AWOC 1988), Springer Lecture Notes in Computer Science, Vol. 319, pp. 101–110.
G. L. Miller and J. H. Reif, Parallel tree contraction and its application, In Proc. 26th Annual Symposium on Foundations of Computer Science (FOCS 1985), pp. 478–489.
G. L. Miller and J. H. Reif, Parallel tree contraction, Part 1: Fundamentals, preprint, 1987. The final version (not available to us) appeared in Randomness and Computation, Advances in Computing Research, Vol. 5, S. Micali (ed.), pp. 47–72, JAI Press, Greenwich, CT, 1989.
G. L. Miller and J. H. Reif, Parallel tree contraction, Part 2: Further applications, SIAM J. Comput. 20 (1991), pp. 1128–1147.
G. L. Miller and S.-H. Teng, Tree-based parallel algorithm design, manuscript. A preliminary version appeared in Proc. 2nd International Conference on Supercomputing (1987), pp. 392–403.
M. Reid-Miller, G. L. Miller, and F. Modugno, List ranking and parallel tree contraction, In Synthesis of Parallel Algorithms, J.H. Reif (ed.), Chap. 3, pp. 115–194, Morgan Kaufmann Publ., San Mateo, CA, 1993.
R. Sethi, Complete register allocation problems, SIAM J. Comput. 4 (1975), pp. 226–248.
P. J. Slater, E. J. Cockayne, and S. T. Hedetniemi, Information dissemination in trees, SIAM J. Comput. 10 (1981), pp. 692–701.
R. E. Tarjan and U. Vishkin, An efficient parallel biconnectivity algorithm, SIAM J. Comput. 14 (1985), pp. 862–874.
R. A. Wagner and Y. Han, Parallel algorithms for bucket sorting and the data dependent prefix problem, In Proc. International Conference on Parallel Processing (ICPP 1986), pp. 924–930.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Diks, K., Torben, H. (1997). More general parallel tree contraction: Register allocation and broadcasting in a tree. In: d'Amore, F., Franciosa, P.G., Marchetti-Spaccamela, A. (eds) Graph-Theoretic Concepts in Computer Science. WG 1996. Lecture Notes in Computer Science, vol 1197. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62559-3_12
Download citation
DOI: https://doi.org/10.1007/3-540-62559-3_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62559-9
Online ISBN: 978-3-540-68072-7
eBook Packages: Springer Book Archive