Skip to main content

Sorting with One-Dimensional Cellular Automata Using Odd-Even Transposition

  • Conference paper
New Contributions in Information Systems and Technologies

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 353))

  • 4124 Accesses

Abstract

Cellular automata are both discrete complex and fully distributed computational systems, with arbitrarily simple local processing. One of the computations that can be performed using cellular automata is the sorting of numerical sequences. Sorting is a relevant topic and occurs widely as a fundamental computing problem. This paper presents the development of improved sorting algorithms based upon one-dimensional cellular automata. Two new versions with radii of 1 and 3 are proposed, inspired by the characteristics of the existing methods. These algorithms are presented and their advantages and performance with respect to the existing approaches are discussed.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 369.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. Gordillo, J.L., Luna, J.V.: Parallel sort on a linear array of cellular automata. In: IEEE International Conference on Systems, Man, and Cybernetics, pp. 1903–1907. IEEE Press, New York (1994)

    Chapter  Google Scholar 

  2. Hegselmann, R., Flache, A.: Understanding complex social dynamics: A plea for cellular automata based modelling. Journal of Artificial Societies and Social Simulation 1, 1 (1998)

    Google Scholar 

  3. Mitchell, M., Grams, T., Bornholt, T., Gros, M., Pellizzari, T.: Computation in cellular automata: A selected review. In: Non-Standard Computation, pp. 95–140. Wiley-VCH, Weinheim (1998)

    Google Scholar 

  4. Shakeri, M., Deldari, H., Foroughi, H., Rezvanian, A.: Parallel sorting on linear cellular automata. In: Arabnia, H.R., Youngson, M. (eds.) Parallel and Distributed Processing Techniques and Applications, pp. 377–383. CSREA Press, Athens (2008)

    Google Scholar 

  5. Wolfram, S.: A new kind of science. Wolfram Media Inc., Champaign (2002)

    MATH  Google Scholar 

  6. Worsch, T., Nishio, H.: Real-time sorting of binary numbers on one-dimensional CA. In: Kari, J. (ed.) Journées Automates Cellulaires, pp. 214–225 (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Carlos E. P. de Carvalho .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

de Carvalho, C.E.P., de Oliveira, P.P.B. (2015). Sorting with One-Dimensional Cellular Automata Using Odd-Even Transposition. In: Rocha, A., Correia, A., Costanzo, S., Reis, L. (eds) New Contributions in Information Systems and Technologies. Advances in Intelligent Systems and Computing, vol 353. Springer, Cham. https://doi.org/10.1007/978-3-319-16486-1_51

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-16486-1_51

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-16485-4

  • Online ISBN: 978-3-319-16486-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics