Abstract
The traditional Linda programming style, based on the introduction and consumption of data from a common repository, seems not adequate for highly dynamic applications in which it is important to observe modi.cation of the environment which occur quickly. On the other hand, reactive programming seems more appropriate for this kind of applications. In this paper we consider some approaches recently presented in the literature for embedding reactive programming in shared dataspaces, we present a possible classification for these approaches, and we perform a rigorous investigation of their relative advantages and disadvantages.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
N. Busi and G. Zavattaro. On the Expressivenes of Event Notification in Data-Driven Coordination Languages. In Proc. of ESOP 2000, volume 1782 of Lecture Notes in Computer Science, pages 41–55. Springer-Verlag, Berlin, 2000.
F.S. de Boer and C. Palamidessi. Embedding as a Tool for Language Comparison: On the CSP Hierarchy. In Proc. of CONCUR’91, volume 527, pages 127–141. Springer-Verlag, Berlin, 1991.
D. Gelernter. Generative Communication in Linda. ACM Transactions on Programming Languages and Systems, 7(1):80–112, 1985.
R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
A. Rowstron. WCL: A web co-ordination language. World Wide Web Journal, 1(3):167–179, 1998.
A. Rowstron and A. Wood. Solving the Linda multiple rd problem using the copy-collect primitive. Science of Computer Programming, 31(2–3):335–358, 1998.
J. Waldo et al. Javaspace speci.cation-1.0. Technical report, Sun Microsystems, March 1998.
P. Wyckoff, S. McLaughry, T. Lehman, and D. Ford. T spaces. IBM Systems Journal, 37(3):454–474, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Busi, N., Rowstron, A., Zavattaro, G. (2002). State—and Event-Based Reactive Programming in Shared Dataspaces. In: Arbab, F., Talcott, C. (eds) Coordination Models and Languages. COORDINATION 2002. Lecture Notes in Computer Science, vol 2315. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46000-4_12
Download citation
DOI: https://doi.org/10.1007/3-540-46000-4_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43410-8
Online ISBN: 978-3-540-46000-8
eBook Packages: Springer Book Archive