Skip to main content
Springer Nature Link
Log in

Generic Parallel Algorithms

  • Conference paper
Language, Life, Limits (CiE 2014)

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

Included in the following conference series:

  • 751 Accesses

Abstract

We develop a nature-inspired generic programming language for parallel algorithms, one that works for all data structures and control structures. Any parallel algorithm satisfying intuitively-appealing postulates can be modeled by a collection of cells, each of which is an abstract state machine, augmented with the ability to spawn new cells. All cells run the same algorithm and communicate via a shared global memory.

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

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. Blass, A., Gurevich, Y.: Abstract state machines capture parallel algorithms. ACM Trans. on Computation Logic 4, 578–651 (2003)

    Article  MathSciNet  Google Scholar 

  2. Blass, A., Gurevich, Y.: Ordinary interactive small-step algorithms (Parts I–III). ACM Trans. on Computational Logic 7, 363–419; 8: art. 15–16 (2006-2007)

    Google Scholar 

  3. Blass, A., Gurevich, Y.: Abstract state machines capture parallel algorithms: Correction and extension. ACM Trans. on Computation Logic 9, Art. 19 (2008)

    Google Scholar 

  4. Blass, A., Gurevich, Y., Rosenzweig, D., Rossman, B.: Interactive small-step algorithms (Parts I–II). LMCS 3: ppr. 3; 4: ppr. 43 (2007)

    Google Scholar 

  5. Boker, U., Dershowitz, N.: Three paths to effectiveness. In: Blass, A., Dershowitz, N., Reisig, W. (eds.) Fields of Logic and Computation. LNCS, vol. 6300, pp. 135–146. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  6. Bournez, O., Dershowitz, N., Falkovich, E.: Towards an axiomatization of simple analog algorithms. In: Agrawal, M., Cooper, S.B., Li, A. (eds.) TAMC 2012. LNCS, vol. 7287, pp. 525–536. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  7. Chandra, A.K., Harel, D.: Computable queries for relational data bases. Journal of Computer and System Sciences 21, 156–178 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  8. Dershowitz, N.: The generic model of computation. In: Proc. DCM, pp. 59–71 (2012)

    Google Scholar 

  9. Dershowitz, N.: Res Publica: The universal model of computation. In: Computer Science Logic 2013, Turin, Italy. Leibniz International Proceedings in Informatics, vol. 23, pp. 5–10 (2013)

    Google Scholar 

  10. Dershowitz, N., Falkovich, E.: A formalization and proof of the Extended Church-Turing Thesis. In: Proc. 7th International Workshop on Developments in Computational Models. EPTCS, vol. 88, pp. 72–78 (2011)

    Google Scholar 

  11. Dershowitz, N., Gurevich, Y.: A natural axiomatization of computability and proof of Church’s Thesis. Bulletin of Symbolic Logic 14, 299–350 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  12. Dowek, G.: Around the physical Church-Turing thesis: Cellular automata, formal languages, and the principles of quantum theory. In: Dediu, A.-H., Martín-Vide, C. (eds.) LATA 2012. LNCS, vol. 7183, pp. 21–37. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  13. Gandy, R.: Church’s thesis and principles for mechanisms. In: The Kleene Symposium, vol. 101, pp. 123–148. North-Holland (1980)

    Google Scholar 

  14. Gurevich, Y.: Evolving algebras 1993: Lipari guide. In: Börger, E. (ed.) Specification and Validation Methods, pp. 9–36. Oxford University Press, Oxford (1995)

    Google Scholar 

  15. Gurevich, Y.: Sequential abstract state machines capture sequential algorithms. ACM Trans. on Computational Logic 1, 77–111 (2000)

    Article  MathSciNet  Google Scholar 

  16. Post, E.L.: Absolutely unsolvable problems and relatively undecidable propositions. In: Davis, M. (ed.) Solvability, Provability, Definability: The Collected Works of Emil L. Post, pp. 375–441. Birkhaüser, Boston (1994)

    Google Scholar 

  17. Reisig, W.: On Gurevich’s theorem on sequential algorithms. Acta Informatica 39, 273–305 (2003)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, Tel Aviv University, Tel Aviv, Israel

    Nachum Dershowitz & Evgenia Falkovich

Authors
  1. Nachum Dershowitz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Evgenia Falkovich
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. College of Science, Department of Computer Science, Swansea University, SA2 8PP, Swansea, UK

    Arnold Beckmann

  2. Department of Algorithms and Their Applications, Eötvös Loránd University, Pázmány Péter sétány 1/c,, 1117, Budapest, Hungary

    Erzsébet Csuhaj-Varjú

  3. Computer Science Institute, Brandenburg University of Technology Cottbus-Senftenberg, Cottbus, Germany

    Klaus Meer

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Dershowitz, N., Falkovich, E. (2014). Generic Parallel Algorithms. In: Beckmann, A., Csuhaj-Varjú, E., Meer, K. (eds) Language, Life, Limits. CiE 2014. Lecture Notes in Computer Science, vol 8493. Springer, Cham. https://doi.org/10.1007/978-3-319-08019-2_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-08019-2_14

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-08018-5

  • Online ISBN: 978-3-319-08019-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics