Abstract
Besides the Church-Rosser property (here called full), three other commutativity properties of transformations (the mutual, inner and strong Church-Rosser property) are also defined, which are less restrictive than the first. These properties are used to decide:
-
1)
when and how the rules belonging to the same loop can be applied in parallel
-
2)
when a rule can be eliminated
-
3)
when a rule can be removed from a loop.
The transformations of algorithms our methods yield are particularly significant in that they depend only on the semantics of the original algorithm, i.e., the input-output relations.
To perform the parallelization (point 1), a new model of structured programming language is used, sufficiently general to ensure that every program can be automatically translated into a structured one.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Böhm, C., M. Dezani-Ciancaglini, To what extent can or must a computation be parallelized, to appear in Proc. of the International Summer School on New Concepts and Technologies in Parallel Information Processing, ed.E. Caianiello, NATO ASI SERIES.
Böhm, C., G. Jacopini, Flow Diagrams, Turing Machines and Languages with only two Formation Rules, Comm.of the ACM,9, 5, (1966), 366–371.
Caracciolo di Forino, A., Generalized Markow Algorithms and Automata Theory„ Proc. of the International Summer School on Automata Theory, ed. E.Caianiello, Academic Press, New Yrk, (1966), 115–130.
Germano, G., A. Maggiolo-Schettini, Equivalence of Partial Recursivity and Computability by Algorithms Without Concluding Formulas, Calcolo, 8, (1971), 273–291.
Keller, M., On maximally parallel schemata, IEEE Conf., Santa Monica, (1970), 32–50.
Keller, M., Parallel program schemata and maximal parallelism 1: Fundamental results, Journal of the ACM, 20, 3, (1973), 514–537.
Keller, M., Parallel program schemata and maximal parallelism 11: Construction of Closures, Journal of the ACM, 20, 4, (1973), 696–710.
Knuth, D.E., P.E.Bendix, Simple Word Problem in Universal Algebra, Computational Problems in Abstract Algebra, ed. J.Leech, Pergamon Press, Braunschweig, (1970), 263–297.
Knuth, D.E., The Art of Computer Programming, Addison-Wesley, 1, (1968), 7–8.
Manna, Z., S. Ness, J. Vuillemin, Inductive Methods for Proving Properties of Programs, Proc. of ACM Conference on Proving Assertion About Programs, Las Cruces, (1972), 27–50.
Rosen, B.K., Tree Manipulating Systems and Church-Rosser Theorems, ACM Journal, 20, (1973), 160–187.
Roucairol, G., Une transformation de programmes sequentiels en programmes paralleles, to appear in Proc. of Colloque sur la programmation, Paris, Springer Verlag ed., (1974).
Roucairol, G., A., Widory, Programmes sequentiels et parallelisme, R.A.I.R.O., B-2, (1973), 5–22.
Wirth, M., Systematiches Programnieren, B.G. Tenbner, Stuttgart, (1972).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1974 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dezani-Ciancaglini, M., Zacchi, M. (1974). Application of Church-Rosser Properties to Increase the Parallelism and Efficiency of Algorithms. In: Loeckx, J. (eds) Automata, Languages and Programming. ICALP 1974. Lecture Notes in Computer Science, vol 14. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-21545-6_12
Download citation
DOI: https://doi.org/10.1007/978-3-662-21545-6_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-06841-9
Online ISBN: 978-3-662-21545-6
eBook Packages: Springer Book Archive