Skip to main content
Springer Nature Link
Log in

On Generation of Permutations through Suffix/Prefix Reversing in a Cellular Network

  • Conference paper
Parallel Processing and Applied Mathematics (PPAM 2003)

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

  • 612 Accesses

Abstract

In this paper a new permutation generator is proposed. Each subsequent permutation is generated in a cellular permutation network by reversing a suffix/prefix of the preceding permutation. The sequence of suffix/prefix sizes is computed by a complex parallel counter in O(1) time per generated object. Suffix/prefix reversing operations are performed at the same time when the permutation is actually produced.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Akl, S.G.: Design and analysis of parallel algorithms, pp. 148–150. Prentice Hall, Englewood Cliffs (1989)

    MATH  Google Scholar 

  2. Akl, S.G.: Adaptive and optimal parallel algorithms for enumerating permutations and combinations. The Computer Journal 30, 433–436 (1987)

    MATH  MathSciNet  Google Scholar 

  3. Akl, S.G., Meijer, H., Stojmenović, I.: Optimal parallel algorithms for generating permutations. TR 90-270, Dept. of Computing and Information Science, Queen’s University, Kingston, Ontario, Canada (1990)

    Google Scholar 

  4. Kautz, W.H., Levitt, K.N., Waksman, A.: Cellular interconnection arrays. IEEE Transactions on Computers C-17, 443–451 (1968)

    Article  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  6. Kokosiński, Z.: Mask and pattern generation for associative supercomputing. In: Proc. 12th Int. Conference Applied Informatics AI 1994, Annecy, France, pp. 324–326 (1994)

    Google Scholar 

  7. Lin, C.-J.: Parallel algorithm for generating permutations on linear array. Information Processing Letters 35, 167–170 (1990)

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

  9. Oruç, A.Y., Oruç, A.M.: Programming cellular permutation networks through decomposition of symmetric groups. IEEE Trans. Computers C-36, 802–809 (1987)

    Article  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  11. Zaks, S.: A new algorithm for generation of permutations. BIT 24, 196–204 (1984)

    Article  MATH  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 Computational and Information Sciences, Czestochowa University of Technology,  

    Roman Wyrzykowski

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

    Jack Dongarra

  3. Systems Research Institute, Polish Academy of Science, Warsaw, Poland

    Marcin Paprzycki

  4. Informatics & Mathematical Modeling, Technical University of Denmark, DK-2800, Lyngby, Denmark

    Jerzy Waśniewski

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kokosiński, Z. (2004). On Generation of Permutations through Suffix/Prefix Reversing in a Cellular Network. 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_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24669-5_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21946-0

  • Online ISBN: 978-3-540-24669-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics