Abstract
We define a formal framework to model executions and dynamic placement of programs on networks of processors. It provides an equational characterization of programs with respect to their expansion.
Preview
Unable to display preview. Download preview PDF.
References
G. Boudol, I. Castellani, Concurrency and Atomicity, Theoretical Computer Science 59 (1988), pp. 25–84
P. Degano,R. De Nicola,U. Montanari, CCS is an augmented contact-free C/E system.,LNCS 280,1987,pp 144–165.
R. van Glabeek,F. Vaandrager,Petri nets models for algebraic theories of concurrency, LNCS 259 (1987) 224–242.
R. Milner, Lectures on a Calculus for Communicating Systems, in: Proc. Seminar on Concurrency, LNCS 197, 1985, pp. 197–220
D. Millot, J. Vautherin, True Parallelism on an Unknown Topology, RR. 502, LRI Univ. Paris-Sud, july 89
L. Pomello, Some equivalence notions for concurrent systems, LNCS 222 (1986) 381–400.
V. Pratt, Modeling Concurrency with Partial Orders, International Journal of Parallel Programming, vol 15 (1), 1986, pp. 36–91
C.C. Prince, M.A. Salama, Scheduling of precedence-constrained task on multiprocessors The Computer Journal Vol 33 (3) 1990, pp 219–229.
G. Winskel, Event structures,LNCS 255 (1987) 325–392.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag
About this paper
Cite this paper
Fanchon, J., Millot, D. (1991). Models for dynamically placed concurrent processes. In: Aarts, E.H.L., van Leeuwen, J., Rem, M. (eds) PARLE '91 Parallel Architectures and Languages Europe. PARLE 1991. Lecture Notes in Computer Science, vol 506. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54152-7_60
Download citation
DOI: https://doi.org/10.1007/3-540-54152-7_60
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54152-3
Online ISBN: 978-3-540-47472-2
eBook Packages: Springer Book Archive