eprintid: 3506
rev_number: 11
eprint_status: archive
userid: 67
dir: disk0/00/00/35/06
datestamp: 2016-06-28 09:56:20
lastmod: 2016-06-28 09:56:20
status_changed: 2016-06-28 09:56:20
type: book_section
metadata_visibility: show
creators_name: Buravlev, Vitaly
creators_name: De Nicola, Rocco
creators_name: Mezzina, Claudio Antares
creators_id: 
creators_id: r.denicola@imtlucca.it
creators_id: claudio.mezzina@imtlucca.it
title: Tuple Spaces Implementations and Their Efficiency
ispublished: pub
subjects: QA76
divisions: CSA
full_text_status: public
pres_type: paper
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.
date: 2016
date_type: published
series: Lecture Notes in Computer Science
number: 9686
publisher: Springer
pagerange: 51-66
pages: 15
event_title: Coordination Models and Languages - 18th IFIP WG 6.1 International Conference, COORDINATION 2016, Held as Part of the 11th International Federated Conference on Distributed Computing Techniques, DisCoTec 2016, Heraklion, Crete, Greece, June 6-9, 2016, Pro
event_type: conference
refereed: TRUE
isbn: 978-3-319-39518-0
book_title: Tuple Spaces Implementations and Their Efficiency : Coordination Models and Languages 18th IFIP WG 6.1 International Conference, COORDINATION 2016, Held as Part of the 11th International Federated Conference on Distributed Computing Techniques, DisCoTec 2
official_url: http://dx.doi.org/10.1007/978-3-319-39519-7_4
citation:   Buravlev, Vitaly and De Nicola, Rocco and Mezzina, Claudio Antares  Tuple Spaces Implementations and Their Efficiency.   In:  Tuple Spaces Implementations and Their Efficiency : Coordination Models and Languages 18th IFIP WG 6.1 International Conference, COORDINATION 2016, Held as Part of the 11th International Federated Conference on Distributed Computing Techniques, DisCoTec 2.   Lecture Notes in Computer Science  (9686).  Springer, pp. 51-66.  ISBN 978-3-319-39518-0      (2016)  
document_url: http://eprints.imtlucca.it/3506/1/main.pdf