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
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Blass, A., Gurevich, Y.: Abstract state machines capture parallel algorithms. ACM Trans. on Computation Logic 4, 578–651 (2003)
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)
Blass, A., Gurevich, Y.: Abstract state machines capture parallel algorithms: Correction and extension. ACM Trans. on Computation Logic 9, Art. 19 (2008)
Blass, A., Gurevich, Y., Rosenzweig, D., Rossman, B.: Interactive small-step algorithms (Parts I–II). LMCS 3: ppr. 3; 4: ppr. 43 (2007)
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)
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)
Chandra, A.K., Harel, D.: Computable queries for relational data bases. Journal of Computer and System Sciences 21, 156–178 (1980)
Dershowitz, N.: The generic model of computation. In: Proc. DCM, pp. 59–71 (2012)
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)
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)
Dershowitz, N., Gurevich, Y.: A natural axiomatization of computability and proof of Church’s Thesis. Bulletin of Symbolic Logic 14, 299–350 (2008)
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)
Gandy, R.: Church’s thesis and principles for mechanisms. In: The Kleene Symposium, vol. 101, pp. 123–148. North-Holland (1980)
Gurevich, Y.: Evolving algebras 1993: Lipari guide. In: Börger, E. (ed.) Specification and Validation Methods, pp. 9–36. Oxford University Press, Oxford (1995)
Gurevich, Y.: Sequential abstract state machines capture sequential algorithms. ACM Trans. on Computational Logic 1, 77–111 (2000)
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)
Reisig, W.: On Gurevich’s theorem on sequential algorithms. Acta Informatica 39, 273–305 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)