Skip to main content
SpringerLink
Log in

Models for dynamically placed concurrent processes

  • Conference paper
Parle ’91 Parallel Architectures and Languages Europe

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 505))

  • 707 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Reference

  1. G. Boudol, I. Castellani, Concurrency and Atomicity, Theoretical Computer Science 59 (1988), pp. 25–84

    Article  MathSciNet  Google Scholar 

  2. P.Degano,R.De Nicola,U.Montanari, CCS is an augmented contact free CIE system.,LNCS 280, 1987,pp 144–165.

    Google Scholar 

  3. R.van Glabeek,F.Vaandrager,Petri nets models for algebraic theories of concurrency,LNCS 259 (1987) 224–242.

    Google Scholar 

  4. R. Milner, Lectures on a Calculus for Communicating Systems, in: Proc. Seminar on Concurrency, LNCS 197, 1985, pp. 197–220

    Google Scholar 

  5. D. Millot, J. Vautherin, True Parallelism on an Unknown Topology,RR. 502, LRI Univ. Paris-Sud, july 89

    Google Scholar 

  6. L.Pomello,Some equivalence notions for concurrent systems,LNCS 222 (1986) 381–400.

    Google Scholar 

  7. V. Pratt, Modeling Concurrency with Partial Orders, International Journal of Parallel Programming, vol 15 (1), 1986, pp. 36–91

    MathSciNet  Google Scholar 

  8. C.C.Prince, M.A.Salama, Scheduling of precedence-constrained task on multiprocessors The Computer Journal Vol 33 (3) 1990, pp 219–229.

    Google Scholar 

  9. G.Winskel, Event structures,LNCS 255 (1987) 325–392.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire de Recherche en Informatique, CNRS UA 410, .Bat 490, Université Paris-Sud, 91405, Orsay Cedex, France

    J. Fanchon & D. Millot

  2. 9 rue Charles Fourier, Institut National des Télécommunications, 91011, Evry, France

    D. Millot

Authors
  1. J. Fanchon
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. Millot
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Philips Research Laboratories, P.O. Box 80.000, 5600 JA, Eindhoven, The Netherlands

    Emile H. L. Aarts

  2. Department of Computer Science, University of Utrecht, Padualaan 14, 3584 CH, Utrecht, The Netherlands

    Jan van Leeuwen

  3. Eindhoven University of Technology, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands

    Martin Rem

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

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. Lecture Notes in Computer Science, vol 505. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-25209-3_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-25209-3_33

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-23206-4

  • Online ISBN: 978-3-662-25209-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation