A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
We compare the expressive power of three classes of coordination models based on shared dataspaces. ... A number of di erent coordination models for specifying inter-process communication and synchronisation rely on a notion of shared dataspace. ... Acknowledgements We would like to thank the anonymous referees for their valuable comments and suggestions on a previous version of this article. ...doi:10.1016/s0167-6423(02)00087-4 fatcat:si664orgmzgrvpt7pnzddwrv4i
This paper builds upon previous work to study the expressive power of two families of timed coordination models based on shared dataspaces. ... Since Linda, many differents coordination models using shared dataspaces have been developped. However, a few only have incorporated the notion of time. ... Finally,  investigates the impact of various mechanisms for expired data collection on the expressiveness of coordination systems. ...doi:10.1016/j.entcs.2006.10.047 fatcat:2m3u2wjlgjfotlrlirvsj77v74
Process algebras have been successfully exploited for the formal definition of the semantics of these languages and as a framework for the comparison of different coordination models. ... Coordination languages have been introduced since the early 80s as programming notations to manage the interaction among concurrent collaborating software entities. ... Linda  is the most prominent representative of the family of coordination languages based on the shared dataspace model: a sender communicates with a receiver through a shared data space (called ...doi:10.1016/j.entcs.2006.08.001 fatcat:tghqhv27ibau5fnwgkuc7vjzwq
Acknowledgements We thank the anonymous reviewers who helped us in the selection: their help was invaluable in putting together this special issue. ... "On the expressiveness of coordination via shared dataspaces", by Brogi and Jacquet, is another study on the expressiveness of coordination primitives based on three different avors of shared dataspaces ... On the one hand, such a separation facilitates the architectural reuse of code; on the other hand, the same interaction patterns occur in many di erent problems -so it becomes possible to reuse the coordination ...doi:10.1016/s0167-6423(02)00084-9 fatcat:x52nkophkfgtraxhuvtpqfvldu
Syndicate is a new coordinated, concurrent programming language. It occupies a novel point on the spectrum between the shared-everything paradigm of threads and the shared-nothing approach of actors. ... This approach clearly simplifies coordination of concurrent activities. Experience in programming with Syndicate, however, suggests a need to raise the level of linguistic abstraction. ... In addition, many thanks to Matthias Felleisen, Sam Caldwell, and the participants of NU PLTs coffee round. ...doi:10.4204/eptcs.211.5 fatcat:mn27etkv5zgtlpm5lvx7a5za64
Proceedings of the 2002 ACM symposium on Applied computing - SAC '02
This paper focuses on coordination middleware for distributed applications based on active documents and XML technologies. ... It introduces the main concepts underlying active documents and XML Then, the paper goes into details about the problem of defining a suitable middleware architecture to effectively support coordination ... ) to coordinate their activities via Linda-like access to shared spaces of XML documents. ...doi:10.1145/508848.508857 fatcat:xuv55douf5gbxjhzug5esnqrve
This paper focuses on coordination middleware for distributed applications based on active documents and XML technologies. ... It introduces the main concepts underlying active documents and XML Then, the paper goes into details about the problem of defining a suitable middleware architecture to effectively support coordination ... ) to coordinate their activities via Linda-like access to shared spaces of XML documents. ...doi:10.1145/508791.508857 dblp:conf/sac/CiancariniTZ02 fatcat:h3bmrytqpbbvvjr2lx54xsklkm
Lecture Notes in Computer Science
The space calculus is introduced as a language to model distributed dataspace systems, i.e. distributed applications that use a shared (but possibly distributed) dataspace to coordinate. ... The publish-subscribe and the global dataspace are particular instances of our model. ... We concentrate on shared dataspace architectures and define a "library" of carefully chosen set of primitives that are both handy and expressive. ...doi:10.1007/978-3-540-39866-0_21 fatcat:xphl4oia3vahniclfwgs44ywee
“We compare the expressive power of three classes of coordi- nation models based on shared dataspaces. ... , or through a synchronous broadcast.” 2004a:68105 68Q85 68M14 68N15 68N30 68Q60 Brogi, Antonio (I-PISA-IF; Pisa) ; Jacquet, Jean-Marie (B-NDP-C; Namur) On the expressiveness of coordination via shared ...
This paper focuses on coordination middleware for distributed applications based on active documents and XML technologies. ... A simple taxonomy is introduced to characterise coordination middleware architectures depending on the way they exploit XML documents in supporting coordination. ... specifically, mobile Java agents) to coordinate their activities via Linda-like access to shared spaces of XML documents. ...doi:10.1017/s0269888903000547 fatcat:672rlzvqpvev5biagjdlz62b2e
of the shared dataspace model. ... Nevertheless, despite the multiplicity of forms, much of the work on concurrency is aligned with one of two basic paradigms: • communication via shared variables (e.g., Concurrent Pascal , UNITY [10 ... We also thank the referees and Jayadev Misra for their helpful comments and the Department of Computer and Information Science at The University of Mississippi for enabling the second author to continue ...doi:10.1109/32.62445 fatcat:ny2xmfznp5evlldigu5tmag3u4
persistence - Direct access to simula/on data structures - Shared memory access via hand--off / copy - Shared memory access via non--vola/le near node storage (NVRAM) - Data transfer to dedicated ... Graphical view of the shared space model (derived from Tuple space) for coordination/ interaction DataSpaces Abstraction: Indexing + DHT • Dynamically constructed structured overlay using hybrid ...doi:10.1145/2608020.2612731 dblp:conf/hpdc/Parashar14 fatcat:f4a4iueobjgfdhsq7mfytlhs3i
This suits very well the characteristics of the Internet environment: on the one hand, it offers all the advantages of XML in terms of interoperability and standard representation of information; on the ... In addition, coordination in XMARS is made more flexible and secure by the capability of programming the behaviour of the coordination media in reaction to the agents' accesses. ... When mobile entities meet in the same physical place, their ITSs automatically merged, thus allowing Linda-like coordination between mobile entities via temporarily shared tuple spaces. ...doi:10.1145/335603.335738 dblp:conf/sac/CabriLZ00 fatcat:rq3q3s4sxnexlbpccnlvzrbafi
We provide an incremental and uniform presentation of a collection of process calculi featuring coordination primitives for the shared dataspace coordination model (inspired by Linda, JavaSpaces, TSpaces ... On the one hand, the incremental presentation of the various calculi permits to reason about specific linguistic constructs of coordination languages. ... , which are both based on the shared dataspace coordination model. ...doi:10.1016/j.jlap.2007.06.003 fatcat:cbyulhs34fhdhpysdzxdqlnbcm
In this paper, we investigate the impact of different mechanisms for expired data collection on the expressiveness of shared dataspace coordination systems with temporary data.” 2004d:68100 68Q85 68Q60 ... Summary: “The shared dataspace metaphor is historically the most prominent representative of the family of coordination models. ...
« Previous Showing results 1 — 15 out of 373 results