Temporary Data in Shared Dataspace Coordination Languages

  • Nadia Busi
  • Roberto Gorrieri
  • Gianluigi Zavattaro
Conference paper

DOI: 10.1007/3-540-45315-6_8

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2030)
Cite this paper as:
Busi N., Gorrieri R., Zavattaro G. (2001) Temporary Data in Shared Dataspace Coordination Languages. In: Honsell F., Miculan M. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 2001. Lecture Notes in Computer Science, vol 2030. Springer, Berlin, Heidelberg

Abstract

The shared dataspace metaphor is historically the most prominent representative of the family of coordination models. According to this approach, concurrent processes interact via the production, consumption, and test for presence/absence of data in a common repository. Recently, the problem of the accumulation of outdated and unwanted information in the shared repository has been addressed and it has been solved by introducing non-permanent data, obtained by associating an expiration time to data. In this paper we investigate the impact of the adoption of different notions of non-permanent data on the expressiveness of a Linda based process calculus.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Nadia Busi
    • 1
  • Roberto Gorrieri
    • 1
  • Gianluigi Zavattaro
    • 1
  1. 1.Dipartimento di Scienze dell’InformazioneUniversità di BolognaBolognaItaly

Personalised recommendations