Abstract
In this paper an O(n) parallel algorithm is presented for fast unranking t–ary trees with n internal nodes in Zaks’ representation. A sequential O(nt) algorithm is derived on the basis of dynamic programming paradigm. In the parallel version of the algorithm processing is performed in a dedicated parallel architecture containing certain systolic and associative features. At first a coefficient table is created by systolic computations. Then, n subsequent elements of a tree codeword is computed in O(1) time through associative search operations.
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
Akl, S.G.: Parallel computation: models and methods, pp. 475–509. Prentice Hall, Englewood Cliffs (1997)
Akl, S.G., Stojmenović, I.: Generating t–ary trees in parallel. Nordic J. of Computing 3, 63–71 (1996)
Er, M.C.: Lexicographic listing and ranking t–ary trees. The Computer Journal 30, 559–572 (1987)
Er, M.C.: Efficient generation of k–ary trees in natural order. The Computer Journal 35, 306–308 (1992)
Kapralski, A.: New methods for the generation of permutations, combinations and other combinatorial objects in parallel. Journal of Parallel and Distributed Computing 17, 315–326 (1993)
Kapralski, A.: Modelling arbitrary sets of combinatorial objects and their sequential and parallel generation. Studia Informatica 21 (2000)
Knott, G.D.: A numbering system for binary trees. Comm. ACM 20, 113–115 (1977)
Kokosiński, Z.: Circuits generating combinatorial objects for sequential and parallel computer systems. Monografia, vol. 160. Politechnika Krakowska, Kraków (1993) [in Polish]
Kokosiński, Z.: Algorithms for unranking combinations and their applications. In: Proc. Int. Conf. PDCS 1995, Washington D.C., USA, pp. 216–224 (1995)
Kokosiński, Z.: Unranking combinations in parallel. In: Proc. Int. Conf. PDPTA 1996, Sunnyvale, CA, USA, vol. I, pp. 79–82 (1996)
Kokosiński, Z.: On parallel generation of t–ary trees in an associative model. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds.) PPAM 2001. LNCS, vol. 2328, pp. 228–235. Springer, Heidelberg (2002)
Makinen, E.: A survey of binary tree codings. The Computer Journal 34, 438–443 (1991)
Mirsky, L.: Transversal theory. Academic Press, London (1971)
Roelants van Baronaigien, D., Ruskey, F.: Generating t–ary trees in a–order. Information Processing Letters 27, 205–213 (1988)
Ruskey, F.: Generating t–ary trees lexicographically. SIAM Journal of Computing 7, 424–439 (1978)
Stojmenović, I.: On random and adaptive parallel generation of combinatorial objects. Int. Journal of Computer Mathematics 42, 125–135 (1992)
Trojanowski, A.E.: Ranking and listing algorithms for k–ary trees. SIAM Journal of Computing 7, 492–509 (1978)
Üçoluk, G.: A method for chromosome handling of r–permutations of n–element set in genetic algorithms. In: Proc. ICEC 1997, Indianapolis, USA, pp. 55–58 (1997)
Zaks, S.: Lexicographic generation of ordered trees. Theoretical Computer Science 10, 63–82 (1980)
Zaks, S.: Generating and ranking t–ary trees. Information Processing Letters 14, 44–48 (1982)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kokosiński, Z. (2004). A Parallel Dynamic Programming Algorithm for Unranking t–ary Trees. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2003. Lecture Notes in Computer Science, vol 3019. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24669-5_33
Download citation
DOI: https://doi.org/10.1007/978-3-540-24669-5_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21946-0
Online ISBN: 978-3-540-24669-5
eBook Packages: Springer Book Archive