TY  - CHAP
SP  - 3
N2  - 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.
T3  - Lecture Notes in Computer Science
SN  - 0302-9743
PB  - Springer
A1  - Andri?, Marina
A1  - De Nicola, Rocco
A1  - Lafuente, Alberto Lluch
UR  - http://doi.org/10.1007/978-3-319-19282-6_1
Y1  - 2015///
TI  - Replica-Based High-Performance Tuple Space Computing
AV  - none
T2  - Coordination Models and Languages.17th IFIP WG 6.1 International Conference, COORDINATION 2015, Held as Part of the 10th International Federated Conference on Distributed Computing Techniques, DisCoTec 2015, Grenoble, France, June 2-4, 2015, Proceedings
EP  - 18
N1  - SCOPUS ID: 2-s2.0-84942518786; WOS Accession Number: WOS:000363241900001
ID  - eprints3569
ER  -