Skip to main content
SpringerLink
Log in

Emerge-Sort: Swarm Intelligence Sorting

  • Conference paper
Artificial Intelligence: Theories and Applications (SETN 2012)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 7297))

Included in the following conference series:

  • 1657 Accesses

Abstract

We examine sorting on the assumption we do not know in advance which way to sort. We use simple local comparison and swap operators and demonstrate that their repeated application ends up in sorted sequences. These are the basic elements of Emerge-Sort, an approach to self-organizing sorting, which we experimentally validate and observe a run-time behavior of O(n 2).

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. Flocchini, P., Kranakis, E., Krizanc, D., Luccio, F.L., Santoro, N.: Sorting and election in anonymous asynchronous rings. Journal of Parallel and Distributed Computing 64, 254–265 (2004)

    Article  MATH  Google Scholar 

  2. Prasath, R.: Algorithms for Distributed Sorting and Prefix Computation in Static Ad Hoc Mobile Networks. In: 2010 International Conference on Electronics and Information Engineering, vol. 2, pp. 144–148 (2010)

    Google Scholar 

  3. Israeli, A., Jalfon, M.: Uniform Self-Stabilizing Ring Orientation. Information and Computation 104(2-3), 175–196 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  4. Casadei, M., Gardelli, L., Viroli, M.: Collective Sorting Tuple Spaces. In: 11th International Workshop on Cooperative Information Agents, Delft, The Netherlands, pp. 255–269 (2006)

    Google Scholar 

  5. Casadei, M., Menezes, R., Viroli, M., Tolksdorf, R.: Using Ant’s Brood Sorting to Increase Fault Tolerance in Linda’s Tuple Distribution Mechanism. In: Klusch, M., Hindriks, K.V., Papazoglou, M.P., Sterling, L. (eds.) CIA 2007. LNCS (LNAI), vol. 4676, pp. 255–269. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  6. Bénézit, F., Thiran, P., Vetterli, M.: The Distributed Multiple Voting Problem. IEEE Journal of Selected Topics in Signal Processing 5(4), 791–804 (2011)

    Article  Google Scholar 

  7. Bonabeau, E., Theraulaz, G., Deneubourg, J.-L.: Fixed Response Thresholds and the Regulation of Division of Labour in Insect Societies. Bulletin of Mathematical Biology 60, 753–807 (1998)

    Article  MATH  Google Scholar 

  8. Bonabeau, E., Dorigo, M., Theraulaz, G.: Swarm Intelligence: From Natural to Artificial Systems. Oxford University Press, New York (1999)

    MATH  Google Scholar 

  9. Handl, J., Meyer, B.: Ant-based and swarm-based clustering. Swarm Intelligence 1(2), 95–113 (2008)

    Article  Google Scholar 

  10. Babaoglu, O., Canright, G., Deutsch, A., Di Caro, G., Ducatelle, F., Gambardella, L., Ganguly, N., Jelasity, M., Montemanni, R., Montresor, A., Urnes, T.: Design patterns from biology to distributed computing. ACM Transactions on Autonomous and Adaptive Systems 1(1), 26–66 (2006)

    Article  Google Scholar 

  11. Koutsoupias, E., Papadimitriou, C.: Worst case equilibria. In: Annual Symposium on Theoretical Aspects of Computer, pp. 404–413. Springer (1999)

    Google Scholar 

  12. Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Communications of the ACM 17(11), 643–644 (1974)

    Article  MATH  Google Scholar 

  13. Loui, M.C.: The complexity of sorting on distributed systems. Information and Control 60, 70–85 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  14. Gonzaga de Sa, P., Maes, C.: The Gacs-Kurdyumov-Levin automaton revisited. Journal of Statistical Physics 67(3-4), 507–522 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  15. Gordillo, J.L., Luna, J.V.: Parallel sort on a linear array of cellular automata. In: International Conference on Systems, Man and Cybernetics, vol. 2, pp. 1903–1907 (1994)

    Google Scholar 

  16. Mitchell, M., Hraber, P.T., Crutchfield, J.P.: Revisiting the edge of chaos: Evolving cellular automata to perform computations. Complex Systems 7, 89–130 (1993)

    MATH  Google Scholar 

  17. Andre, D., Bennett III, F.H., Koza, J.R.: Discovery by genetic programming of a cellular automata rule that is better than any known rule for the majority classification problem. In: First Annual Conference on Genetic Programming, Stanford, CA, pp. 3–11 (1996)

    Google Scholar 

  18. Boyd, S., Ghosh, A., Prabhakar, B., Shah, D.: Gossip algorithms: Design, analysis and applications. In: 24th Annual Joint Conference of the IEEE and Communication Societies, pp. 1653–1664 (2005)

    Google Scholar 

  19. Kempe, D., Dobra, A., Gehrke, J.: Gossip-based computation of aggregate information. In: IEEE Conference on Foundations of Computer Science, pp. 482–491 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Hellenic Open University, Patras, Greece

    Dimitris Kalles & Vassiliki Mperoukli

  2. Open University of Cyprus, Nicosia, Cyprus

    Dimitris Kalles & Andreas Papandreadis

Authors
  1. Dimitris Kalles
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vassiliki Mperoukli
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Andreas Papandreadis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Biomedical Informatics, University of Central Greece, 2-4 Passiopoulou Street, 35100, Lamia, Greece

    Ilias Maglogiannis

  2. Department of Computer Science and Biomedical Informatics, University of Central Greece, 2-4 Papassiopoulou Street, 35100, Lamia, Greece

    Vassilis Plagianakos

  3. Department of Informatics, Aristotle University of Thessaloniki, 54124, Thessaloniki, Greece

    Ioannis Vlahavas

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kalles, D., Mperoukli, V., Papandreadis, A. (2012). Emerge-Sort: Swarm Intelligence Sorting. In: Maglogiannis, I., Plagianakos, V., Vlahavas, I. (eds) Artificial Intelligence: Theories and Applications. SETN 2012. Lecture Notes in Computer Science(), vol 7297. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30448-4_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-30448-4_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-30447-7

  • Online ISBN: 978-3-642-30448-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation