Distributed Linda tuplespace algorithms and implementations

Feng, Ming-Dong; Gao, Yao Qing; Yuen, C. K.

doi:10.1007/3-540-58430-7_51

Cited by 8 publications

(4 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Several approaches to implementing physically distributed tuple spaces exist. For instance, one can maintain the entire tuple space at one of the n locations (e.g., Feng et al [51], Wyckoff et al [52]), but although simple to implement, this does not scale well in the number of processes [53]. The centralized approach in this paper actually has a similar scalability problem, as all parallelism is sequentialized.…”

Section: Distributed Coordinationmentioning

confidence: 97%

“…For instance, Russello et al developed an adaptive distributed tuple space middleware that monitors processes and, based on their monitored behavior, selects a distribution/replication policy for tuples that meets predefined performance/availability requirements best [54]. Other works on implementing distributed tuple spaces include the work by Bjornson [55], Feng et al [53], Rowstron and Wood [56], Menezes and Tolksdorf [57], and Atkinson [58]. Although both distributed tuple spaces and the hybrid approach in this paper facilitate a form of distributed coordination, they differ in one fundamental aspect: whereas distributed tuple spaces distribute data (i.e., tuples), the hybrid approach distributes control (i.e., medium cas).…”

Section: Distributed Coordinationmentioning

confidence: 99%

See 1 more Smart Citation

Centralized coordination vs. partially-distributed coordination with Reo and constraint automata

Jongmans

Arbab

2018

Science of Computer Programming

View full text Add to dashboard Cite

High-level concurrency notations and abstractions have several well-known software engineering advantages when it comes to programming concurrency protocols among threads. To also explore their complementary performance advantages, in ongoing work, we are developing compilation technology for a high-level coordination language, Reo, based on this language's formal automaton semantics. By now, as shown in our previous work, our tools are capable of generating code that can compete with carefully handcrafted code, at least for some protocols. An important prerequisite to further advance this promising technology, now, is to gain a better understanding of how the significantly different compilation approaches that we developed so far, which vary in the amount of parallelism in their generated code, compare against each other. For instance, to better and more reliably tune our compilers, we must learn under which circumstances parallel protocol code, with high throughput but also high latency, outperforms sequential protocol code, with low latency but also low throughput. In this paper, we report on an extensive performance comparison between these approaches for a substantial number of protocols, expressed in Reo. Because we have always formulated our compilation technology in terms of a general kind of communicating automaton (i.e., constraint automata), our findings apply not only to Reo but, in principle, to any language whose semantics can be defined in terms of such automata.

show abstract

Section: Distributed Coordinationmentioning

confidence: 97%

Section: Distributed Coordinationmentioning

confidence: 99%

Centralized coordination vs. partially-distributed coordination with Reo and constraint automata

Jongmans

Arbab

2018

Science of Computer Programming

View full text Add to dashboard Cite

show abstract

“…However, a core characteristic of Lindabased systems is that they do not make any guaranties about which, when, or if at all clients are notified about matching data. While this allows for several optimizations of distributed implementations [5], in industrial applications, guaranteed subscriber notification is often a core requirement.…”

Section: Related Workmentioning

confidence: 99%

Knowledge-based coordination with a reliable semantic subscription mechanism

Murth

Kühn

2009

Proceedings of the 2009 ACM Symposium on Applied Computing

View full text Add to dashboard Cite

Semantic technologies promise to solve challenging problems of current enterprise information systems, e.g., the integration of heterogeneous information clients and the evaluation of complex data dependencies. As many of these problems also apply to coordination applications, recent research initiatives have proposed to integrate coordination models with semantic technology. In this paper, we present such an integrated coordination model which combines logic-based reasoning with a reliable semantic subscription mechanism. We present a formal definition of the model's behavioral semantics and investigate the added value of using semantic technologies. Finally, we draw first conclusions about the practical applicability of the proposed approach based on performance benchmarks of a prototype implementation.

show abstract

“…Furthermore, since programmers usually adhere to specific communication and coordination patterns, often used protocols should be optimised. There are a number of different approaches in implementing Linda ( [35,72]). Piranha ( [41]) for example is an execution model for Linda, particularly suited to networks of workstations.…”

Section: Lindamentioning

confidence: 99%