A methodology for improving parallel programs by adding communications

2Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We propose a programming methodology for improving the efficiency of applicative parallel programs. The basic idea comes from the program transformation approach à la Burstall-Darlington, in which “new and more efficient” versions of the programs are derived from “old” ones. We extend that approach in the following two respects:we consider parallel concurrent programs, andwe provide a calculus for ensuring that the derived versions are more efficient. We consider that the programmer provides a first version of his/her program and then he/she discovers, maybe in an incremental way, some “facts” about it. Facts are then tested by the calculus and, if they are “accepted”, they will be incorporated into the given version of the program via a translation algorithm, and a new version is thereby derived.

Cite

CITATION STYLE

APA

Pettorossi, A., & Skowron, A. (1985). A methodology for improving parallel programs by adding communications. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 208 LNCS, pp. 228–250). Springer Verlag. https://doi.org/10.1007/3-540-16066-3_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free