Linguistic primitives for replica-aware coordination offer suitable solutions to the challenging problems of data distribution and locality in large-scale high-performance computing. The data replication mechanisms that had previously been designed to extend Klaim with replicated tuples are now used to experiment with X10, a parallel programming language primarily targeting clusters of multi-core processors linked in a large-scale system via high-performance networks. Our approach aims at allowing the programmer to specify and coordinate the replication of shared data items by taking into account the desired consistency properties. The programmer can hence exploit such flexible mechanisms to adapt data distribution and locality to the needs of the application, in order to improve performance in terms of concurrency and data access. We investigate issues related to replica consistency and provide a performance analysis, which includes scenarios where replica based specifications and relaxed consistency provide significant performance gains.
|Title of host publication||Semantics, Logics, and Calculi : Essays Dedicated to Hanne Riis Nielson and Flemming Nielson on the Occasion of Their 60th Birthdays|
|Editors||Christian W. Probst, René Rydhof Hansen, Chris Hankin|
|Publication status||Published - 2015|
|Series||Lecture Notes in Computer Science|
Andrić, M., De Nicola, R., & Lluch Lafuente, A. (2015). Replicating Data for Better Performances in X10. In C. W. Probst, R. R. Hansen, & C. Hankin (Eds.), Semantics, Logics, and Calculi: Essays Dedicated to Hanne Riis Nielson and Flemming Nielson on the Occasion of Their 60th Birthdays (pp. 236-251). Springer. Lecture Notes in Computer Science, Vol.. 9560 https://doi.org/10.1007/978-3-319-27810-0_12