Tuple Spaces Implementations and Their Efficiency

Abstract : Among the paradigms for parallel and distributed computing, the one popularized with Linda and based on tuple spaces is the least used one, despite the fact of being intuitive, easy to understand and to use. A tuple space is a repository of tuples, where process can add, withdraw or read tuples by means of atomic operations. Tuples may contain different values, and processes can inspect the content of a tuple via pattern matching. The lack of a reference implementations for this paradigm has prevented its widespread. In this paper, first we do an extensive analysis on what are the state of the art implementations and summarise their characteristics. Then we select three implementations of the tuple space paradigm and compare their performances on three different case studies that aim at stressing different aspects of computing such as communication, data manipulation, and cpu usage. After reasoning on strengths and weaknesses of the three implementations, we conclude with some recommendations for future work towards building an effective implementation of the tuple space paradigm.
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download

https://hal.inria.fr/hal-01631715
Contributor : Hal Ifip <>
Submitted on : Thursday, November 9, 2017 - 4:13:44 PM
Last modification on : Thursday, November 9, 2017 - 4:15:56 PM
Long-term archiving on : Saturday, February 10, 2018 - 2:28:03 PM

File

416253_1_En_4_Chapter.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Vitaly Buravlev, Rocco Nicola, Claudio Mezzina. Tuple Spaces Implementations and Their Efficiency. 18th International Conference on Coordination Languages and Models (COORDINATION), Jun 2016, Heraklion, Greece. pp.51-66, ⟨10.1007/978-3-319-39519-7_4⟩. ⟨hal-01631715⟩

Share

Metrics

Record views

69

Files downloads

72