Skip to main content
SpringerLink
Log in
Book cover

International Conference on Parallel Processing and Applied Mathematics

PPAM 2001: Parallel Processing and Applied Mathematics pp 228–235Cite as

On Parallel Generation of t—Ary Trees in an Associative Model

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2328))

Abstract

In this paper a new parallel algorithm is presented for generation of t—ary trees. Computations run in an associative processor model. Tree sequences are generated in lexicographic order, with O(1) time per object, in a new representation, as combinations with repetitions with restricted growth. The corresponding full t—ary trees (x—sequences) appear in antilexicographic order.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Akl, S.G.: Parallel computation: models and methods. Prentice Hall (1997) 475–509

    Google Scholar 

  2. Akl, S.G., Stojmenović, I.: Generating t-ary trees in parallel. Nordic J. of Computing3 (1996) 63–71

    Google Scholar 

  3. Akl, S.G., Stojmenović, I.: Generating combinatorial objects on a linear array of processors. [in:] Zomaya, A.Y. (editor): Parallel computing; paradigms and applications. Int. Thompson Press (1996) 639–670

    Google Scholar 

  4. Atkinson, M.D., Sack, J.-R.: Generating binary trees at random. Technical Report SCR-TR-184, Carleton University, Ottawa, Canada (1990) 1–5

    Google Scholar 

  5. Er, M. Lexicographic listing and ranking t-ary trees. The Computer Journal 30 (1987) 559–572

    MathSciNet  Google Scholar 

  6. Er, M. Efficient generation of k-ary trees in natural order. The Computer Journal 35 (1992) 306–308

    Article  MATH  Google Scholar 

  7. Kapralski, A.: New methods for the generation of permutations, combinations and other combinatorial objects in parallel. Journal of Parallel and Distributed Computing 17 (1993) 315–326

    Article  MathSciNet  MATH  Google Scholar 

  8. Kapralski, A.: Sequential and parallel processing in depth search machines. World Scientific (1994)

    Google Scholar 

  9. Kokosiński, Z.: On generation of permutations through decomposition of symmetric groups into cosets. BIT 30 (1990) 583–591

    Article  MathSciNet  MATH  Google Scholar 

  10. Kokosiński, Z.: On parallel generation of combinations in associative processor architectures. Proc. Int. Conference ”Parallel and Distributed Systems” Euro-PDS’97, Barcelona, Spain (1997) 283–289

    Google Scholar 

  11. Kokosiński, Z.: On parallel generation of set partitions in associative processor architectures. Proc. 5th Int. Conference ”Parallel and Distributed Processing Techniques and Applications” PDPTA’99, Las Vegas, USA, Vol. III (1999) 1257–1262

    Google Scholar 

  12. Knott, G.D.: A numbering system for binary trees. Comm. ACM 20 (1977) 113–115

    Article  MATH  Google Scholar 

  13. Knuth, D.E.: The art of computer programming. Fundamental algorithms. Addison-Wesley, 3rd edition (1997)

    Google Scholar 

  14. Korsch, J.F.: Loopless generation of k-ary tree sequences. Information Processing Letters 52 (1994) 243–247

    Article  MathSciNet  Google Scholar 

  15. Kumar, V., Grama, A., Gupta, A., Karypis, G.: Introduction to parallel computing. Design and analysis of algorithms. The Benjamin/Cummings Publishing Company (1994)

    Google Scholar 

  16. Krikelis, A., Weems, C.C. (eds): Associative processing and processors. IEEE Computer Society Press (1997)

    Google Scholar 

  17. Makinen, E.: Left distance binary tree representation. BIT 27 (1987) 163–169

    Article  MathSciNet  Google Scholar 

  18. Makinen, E.: Constructing a binary tree from its traversals. BIT 29 (1989) 572–575

    Article  MathSciNet  Google Scholar 

  19. Makinen, E.: A survey of binary tree codings. The Computer Journal 34 (1991) 438–443

    Article  MathSciNet  Google Scholar 

  20. Mirsky, L.: Transversal theory. Academic Press (1971)

    Google Scholar 

  21. Martin, H.W., Orr, B.J.: A random binary tree generator. [in:] Computing trends in the 1990s. ACM 17th Computer Science Conf., Louisville, USA, (1989) 33–38

    Google Scholar 

  22. Pan, Y., Li, K.: Linear array with a reconfigurable pipelined bus system-concepts and applications. Journal of Information Sciences 106 (1998)237–258

    Article  Google Scholar 

  23. Roelants van Baronaigien, D.: A loopless algorithm for generating binary tree sequences. Information Processing Letters 39 (1991) 189–194

    Article  MathSciNet  MATH  Google Scholar 

  24. Roelants van Baronaigien, D., Ruskey, F.: Generating t-ary trees in a-order. Information Processing Letters 27 (1988) 205–213

    Article  MathSciNet  MATH  Google Scholar 

  25. Ruskey, F.: Generating t-ary trees lexicographically, SIAM Journal of Computing 7 (1978) 424–439

    Article  MathSciNet  MATH  Google Scholar 

  26. Sedgewick, R.: Permutation generation methods. Computing Survey 9 (1977) 137–164

    Article  MathSciNet  MATH  Google Scholar 

  27. Skarbek, W.: Generating ordered trees. Theoretical Computer Science 57 (1988) 153–159

    Article  MathSciNet  MATH  Google Scholar 

  28. Stanton, D., White, D.: Constructive combinatorics. Wiley-Interscience (1996)

    Google Scholar 

  29. Stojmenović, I.: On random and adaptive parallel generation of combinatorial objects. Int. Journal of Computer Mathematics 42 (1992) 125–135

    Article  MATH  Google Scholar 

  30. Trojanowski, A.E.: Ranking and listing algorithms for k-ary trees. SIAM Journal of Computing 7 (1978) 492–509

    Article  MathSciNet  MATH  Google Scholar 

  31. Zaks, S.: Lexicographic generation of ordered trees. Theoretical Computer Science 10 (1980) 63–82

    Article  MathSciNet  MATH  Google Scholar 

  32. Zaks, S.: Generating and ranking t-ary trees. Information Processing Letters 14 (1982) 44–48

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Electrical & Computer Eng., Cracow University of Technology, ul. Warszawska 24, 31-155, Kraków, Poland

    Zbigniew Kokosiński

Authors
  1. Zbigniew Kokosiński
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Mathematics and Computer Science, Technical University of Czestochowa, Dabrowskiego 73, 42-200, Czestochowa, Poland

    Roman Wyrzykowski

  2. Computer Science Department, University of Tennessee, 122 Volunteer Blvd, Knoxville, TN, 37996-3450, USA

    Jack Dongarra

  3. Computer Science Department, Oklahoma State University, 700 N. Greenwood Ave., Tulsa, OK, 74106, USA

    Marcin Paprzycki

  4. DTU, UNI-C, Danish Computing Centre for Research and Education, Bldg. 304, 2800, Lyngby, Denmark

    Jerzy Waśniewski

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kokosiński, Z. (2002). On Parallel Generation of t—Ary Trees in an Associative Model. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2001. Lecture Notes in Computer Science, vol 2328. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48086-2_25

Download citation

  • DOI: https://doi.org/10.1007/3-540-48086-2_25

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43792-5

  • Online ISBN: 978-3-540-48086-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation