Skip to Main content Skip to Navigation
Conference papers

Replica-Based High-Performance Tuple Space Computing

Abstract : We present the tuple-based coordination language RepliKlaim, which enriches Klaim with primitives for replica-aware coordination. Our overall goal is to offer suitable solutions to the challenging problems of data distribution and locality in large-scale high performance computing. In particular, RepliKlaim allows the programmer to specify and coordinate the replication of shared data items and the desired consistency properties. The programmer can hence exploit such flexible mechanisms to adapt data distribution and locality to the needs of the application, so to improve performance in terms of concurrency and data access. We investigate issues related to replica consistency, provide an operational semantics that guides the implementation of the language, and discuss the main synchronization mechanisms of our prototypical run-time framework. Finally, we provide a performance analysis, which includes scenarios where replica-based specifications and relaxed consistency provide significant performance gains.
Complete list of metadata

Cited literature [25 references]  Display  Hide  Download
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Tuesday, April 24, 2018 - 10:53:55 AM
Last modification on : Friday, August 5, 2022 - 12:38:14 PM
Long-term archiving on: : Wednesday, September 19, 2018 - 8:27:10 AM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Marina Andrić, Rocco De Nicola, Alberto Lluch Lafuente. Replica-Based High-Performance Tuple Space Computing. 17th International Conference on Coordination Languages and Models (COORDINATION), Jun 2015, Grenoble, France. pp.3-18, ⟨10.1007/978-3-319-19282-6_1⟩. ⟨hal-01774936⟩



Record views


Files downloads