Skip to main content
SpringerLink
Log in

Simulating the Bitonic Sort Using P Systems

  • Conference paper
Membrane Computing (WMC 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4860))

Included in the following conference series:

Abstract

This paper gives a version of the parallel bitonic sorting algorithm of Batcher, which can sort N elements in time O(log2 N). We apply it to the 2D mesh architecture, using the shuffled row-major indexing function. A correctness proof of the proposed algorithm is given. Two simulations with P systems are introduced and discussed. The first one uses dynamic communication graphs and follows the guidelines of the mesh version of the algorithm. The second simulation requires only symbol rewriting rules in one membrane.

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

Access this chapter

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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.

References

  1. Alhazov, A., Sburlan, D.: Static Sorting P Systems, ch. 8 in [10]

    Google Scholar 

  2. Arulanandham, J.J.: Implementing Bead – Sort with P Systems. In: Calude, C.S., Dinneen, M.J., Peper, F. (eds.) UMC 2002. LNCS, vol. 2509, pp. 115–125. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  3. Batcher, K.: Sorting Networks and Their Applications. In: Proc. of the AFIPS Spring Joint Computing Conf. 32(2968), pp. 307–314

    Google Scholar 

  4. Ceterchi, R., Martín-Vide, C.: Dynamic P Systems. In: Păun, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) Membrane Computing. LNCS, vol. 2597, pp. 146–186. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  5. Ceterchi, R., Martín-Vide, C.: P Systems with Communication for Static Sorting. In: Cavaliere, M., Martín-Vide, C., Păun, G. (eds.) GRLMC Report 26, Rovira i Virgili University, Tarragona (2003)

    Google Scholar 

  6. Ceterchi, R., Pérez Jiménez, M.J.: On Two-Dimensional Mesh Networks and Their Simulation with P Systems. In: Mauri, G., Păun, G., Pérez-Jiménez, M.J., Rozenberg, G., Salomaa, A. (eds.) WMC 2004. LNCS, vol. 3365, pp. 259–277. Springer, Heidelberg (2005)

    Google Scholar 

  7. Ceterchi, R., Pérez Jiménez, M.J.: On Simulating a Class of Parallel Architectures. International Journal of Foundations of Computer Science 17, 91–110 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  8. Ceterchi, R., Pérez Jiménez, M.J.: Simulating Shuffle – Exchange Networks with P Systems. In: Păun, G., Riscos, A., Sancho, F., Romero, A. (eds.) Proceedings of the Second Brainstorming Week on Membrane Computing. Report RGNC 01/04, pp. 117–129 (2004)

    Google Scholar 

  9. Ceterchi, R., Pérez Jiménez, M.J.: A Perfect Shuffle Algorithm for Reduction Processes and its Simulation with P Systems. In: Dzitac, I., Maghiar, T., Popescu, C. (eds.) Proceedings of the International Conference on Computers and Communications ICCC 2004, Editura Univ. Oradea, pp. 92–97 (2004)

    Google Scholar 

  10. Ciobanu, G., Păun, G., Pérez Jiménez, M.J. (eds.): Applications of Membrane Computing. Springer, Heidelberg (2006)

    Google Scholar 

  11. Corbett, P.F., Scherson, I.D.: Sorting in Mesh Connected Multiprocessors. IEEE Transactions on Parallel and Distributed Systems 3, 626–632 (1992)

    Article  Google Scholar 

  12. Dowd, M., Perl, Y., Rudolph, L., Saks, M.: The Periodic Balanced Sorting Network. Journal ACM 36, 738–757 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  13. Han, Y., Igarashi, Y., Truszczynski, M.: Indexing Functions and Time Lower Bounds for Sorting on a Mesh-connected Computer. Discrete Applied Mathematics 36, 141–152 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  14. Knuth, D.E.: The Art of Computer Programming. Sorting and Searching, vol. 3. Addison-Wesley, Reading, Mass (1973)

    Google Scholar 

  15. Layer, C., Pfleiderer, H.-J.: A Reconfigurable Recurrent Bitonic Sorting Network for Concurrently Accessible Data. In: Becker, J., Platzner, M., Vernalde, S. (eds.) FPL 2004. LNCS, vol. 3203, pp. 648–657. Springer, Heidelberg (2004)

    Google Scholar 

  16. Nassimi, D., Sahni, S.: Bitonic Sort on a Mesh Connected Parallel Computer. IEEE Transactions on Computers C28(1), 2–7 (1979)

    Article  Google Scholar 

  17. Nassimi, D., Sahni, S.: An Optimal Routing Algorithm for Mesh-Connected Parallel Computers. Journal ACM 27, 6–29 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  18. Orcutt, S.E.: Computer Organization and Algorithms for Very High Speed Computations. Ph.D. Th., Stanford U., Stanford, Calif., ch. 2, pp. 20–23 (1974)

    Google Scholar 

  19. Păun, G.: Computing with Membranes. Journal of Computer and System Sciences 61, 108–143 (2000)

    Article  MathSciNet  Google Scholar 

  20. Păun, G.: Membrane Computing. An Introduction. Springer, Heidelberg (2002)

    Google Scholar 

  21. Quinn, M.J.: Parallel Computing. Theory and Practice. McGraw – Hill Series in Computer Science (1994)

    Google Scholar 

  22. Sado, K., Igarashi, Y.: Some Parallel Sorts on a Mesh-connected Processor Array and Their Time Efficiency. Journal of Parallel and Distributed Computing 3, 398–410 (1986)

    Article  Google Scholar 

  23. Siegel, H.J.: The Universality of Various Types of SIMD Machine Interconnection Networks. In: Proceedings of the 4th Annual Symposium on Computer Architecture, pp. 23–25 (1977)

    Google Scholar 

  24. Stone, H.S.: Parallel Processing with the Perfect Shuffle. IEEE Transactions on Computers C-20, 153–161 (1971)

    Article  Google Scholar 

  25. Thompson, C.D., Kung, H.T.: Sorting on a Mesh-connected Parallel Computer. Communications of the ACM 20, 263–271 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  26. The membrane computing web page: http://psystems.disco.unimib.it

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Computer Science, University of Bucharest, Str. Academiei 14, RO-010014, Bucharest, Romania

    Rodica Ceterchi & Alexandru Ioan Tomescu

  2. Research Group on Natural Computing, Department of Computer Science and Artificial Intelligence, University of Sevilla, Avda. Reina Mercedes s/n, 41012 Sevilla, Spain

    Mario J. Pérez-Jiménez

Authors
  1. Rodica Ceterchi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mario J. Pérez-Jiménez
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Alexandru Ioan Tomescu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

George Eleftherakis Petros Kefalas Gheorghe Păun Grzegorz Rozenberg Arto Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ceterchi, R., Pérez-Jiménez, M.J., Tomescu, A.I. (2007). Simulating the Bitonic Sort Using P Systems. In: Eleftherakis, G., Kefalas, P., Păun, G., Rozenberg, G., Salomaa, A. (eds) Membrane Computing. WMC 2007. Lecture Notes in Computer Science, vol 4860. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77312-2_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-77312-2_11

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-77312-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation