Abstract
We are interested with design and development of concurrent programs: these programs are constituted by a set of sequential processes which communicate information during their computation generally in an asynchronous way. Thus we obtain a maximal independence between these processes. Such a philosophy is applicable to numerical or non-numerical algorithms.
We present in section 1 a method for analysing problems and designing a set of cooperating processes by three steps:
-
-design of a statement constituted by a set of madules
-
-definition of a data-dependency graph
-
-specification of communications between modules.
Section 2 proposes a numerical example to illustrate previous concepts. In section 3 we show how to express such algorithms by a concurrent program. In particular we define:
-
-process structures
-
-communication types which realize specified exchanges of data between processes.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
G. BAUDET Asynchronous iterative methods for multiprocessors. Rapport Carnegie Mellon University — PITTSBURGH 1976.
P. BRINCH HANSEN The programming language concurrent Pascal. IEEE Software Engineering — 1975.
CHAZAN, MIRANKER W. Chaotic relaxation. Linear Algebra and its applications 2, 1969.
CHARNAY, MUSY, ROBERT Iterations chaotiques série parallèle pour des équa tions non linéaires de point fixe. Aplikace Matematiky — 1975.
J.A. FELDMANN High Level programming for distributed computing. Com. ACM — 1979.
J.V. GUTTAG, HORNING The algebraic specification of abstract data types. Acta informatica 10, 27–52 — 1978.
C.A.C. HOARE Communicating Sequential Processes. Com. ACM — 1978.
J.D. ICHBIAH Reference manual for the Geen Programming Language. Publication CII — HC — 1979.
J. JULLIAND Communications asynchrones entre processus. Ecole d'été d'informatique de l'AFCET, AIX-EN-PROVENCE — 1980.
J. JULLIAND Les communications entre processus d'un programme parallèle. Publication CRIN 80-R-026 — 1980.
J.C. MIELLOU Algorithmes de relaxation chaotique à retards. RAIRO — analyse numérique — R-1 — 1975.
G.R. PERRIN Le cadencement par les données: une méthode de conception de programmes. Congrès AFCET informatique, NANCY 1980.
G.R. PERRIN Conception, écriture et vérification de programmes parallèles. RAIRO Informatique — à paraître 1981.
G. ROUCAIROL Contribution à L'étude des équivalences syntaxiques et transformation de programmes parallèles. Thèse. Université de PARIS VI — 1978.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Julliand, J., Perrin, G.R. (1981). Design and development of concurrent programs. In: Brauer, W., et al. Conpar 81. CONPAR 1981. Lecture Notes in Computer Science, vol 111. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0105138
Download citation
DOI: https://doi.org/10.1007/BFb0105138
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10827-6
Online ISBN: 978-3-540-38715-2
eBook Packages: Springer Book Archive