Generative communication in Linda. Generative communication is the basis of a new distributed programming language that is intended for systems programming in distributed settings generally and on integrated network computers in particular. It differs from previous interprocess communication models in specifying that messages be added in tuple-structured form to the computation environment, where they exist as named, independent entities until some process chooses to receive them. Generative communication results in a number of distinguishing properties of the new language, Linda, that is built around it. Linda is fully distributed in space and distributed in time; it allows distributed sharing, continuation passing, and structured naming. We discuss these properties and their implications, then give a series of examples. Linda presents novel implementation problems that we discuss in Part II. We are particularly concerned with implementation of the dynamic global name space that the generative communication model requires.

References in zbMATH (referenced in 103 articles )

Showing results 81 to 100 of 103.
Sorted by year (citations)
  1. Ferrari, G.; Moggi, E.; Pugliese, R.: Higher-order types and meta-programming for global computing (2002) ioport
  2. Olsson, Ronald A.; Benson, Gregory D.; Ge, Tingjian; Keen, Aaron W.: Fairness in shared invocation servicing (2002)
  3. Jacquet, Jean-Marie; De Bosschere, Koen: Blackboard relations in the (\mu\textLog) coordination model (2001)
  4. Landauer, Christopher; Bellman, Kirstie L.: New architectures for constructed complex systems (2001)
  5. Omicini, Andrea; Denti, Enrico: Formal \textsfReSpecT (2001)
  6. Bellman, Kirstie L.; Landauer, Christopher: Towards an integration science. The influence of Richard Bellman on our research. (2000)
  7. Bonsangue, M. M.; Arbab, F.; de Bakker, J. W.; Rutten, J. J. M. M.; Scutellà, A.: A transition system semantics for the control-driven coordination language MANIFOLD (2000)
  8. Busi, Nadia; Gorrieri, Roberto; Zavattaro, Gianluigi: On the expressiveness of Linda coordination primitives. (2000)
  9. Busi, N.; Gorrieri, R.; Zavattaro, G.: Comparing three semantics for Linda-like languages (2000)
  10. Nicola, R. D.; Pugliese, R.: Linda-based applicative and imperative process algebras (2000)
  11. Nicola, R.; Ferrari, G.-L.; Pugliese, R.; Venneri, B.: Types for access control (2000)
  12. Busi, Nadia; Gorrieri, Roberto; Zavattaro, Gianluigi: A process algebraic view of Linda coordination primitives (1998)
  13. Hankin, Chris; Le Métayer, Daniel; Sands, David: Refining multiset transformers (1998)
  14. Monteiro, Luís; Porto, António: Entailment-based actions for coordination (1998)
  15. Andreoli, Jean-Marc: Pareschi, Remo; Castagnetti, Tiziana: Static analysis of linear logic programming. (1997) ioport
  16. Andreoli, Jean-Marc: Pareschi, Remo; Castagnetti, Tiziana: Static analysis of linear logic programming. (1997) ioport
  17. Hsieh, S. H.; Sotelino, E. D.: A message-passing class library C++ for portable parallel programming. (1997) ioport
  18. Critchlow, Carol; Taylor, Kim: The inhibition spectrum and the achievement of causal consistency (1996)
  19. Kobayashi, Naoki; Yonezawa, Akinori: Asynchronous communication model based on linear logic (1995)
  20. Carriero, Nicholas; Gelernter, David: Case studies in asynchronous data parallelism (1994)