%0 Conference Proceedings
%T Block Placement Strategies for Fault-Resilient Distributed Tuple Spaces: An Experimental Study
%+ Université de Neuchâtel = University of Neuchatel (UNINE)
%+ School for Advanced Studies Lucca (IMT)
%A Barbi, Roberta
%A Buravlev, Vitaly
%A Mezzina, Claudio, Antares
%A Schiavoni, Valerio
%Z Part 2: Storing Data Smartly (Data storage)
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 17th IFIP International Conference on Distributed Applications and Interoperable Systems (DAIS)
%C Neuchâtel, Switzerland
%Y Lydia Y. Chen
%Y Hans Reiser
%I Springer International Publishing
%3 Distributed Applications and Interoperable Systems
%V LNCS-10320
%P 67-82
%8 2017-06-19
%D 2017
%R 10.1007/978-3-319-59665-5_5
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X The tuple space abstraction provides an easy-to-use programming paradigm for distributed applications. Intuitively, it behaves like a distributed shared memory, where applications write and read entries (tuples). When deployed over a wide area network, the tuple space needs to efficiently cope with faults of links and nodes. Erasure coding techniques are increasingly popular to deal with such catastrophic events, in particular due to their storage efficiency with respect to replication. When a client writes a tuple into the system, this is first striped into k blocks and encoded into $$n > k$$ blocks, in a fault-redundant manner. Then, any k out of the n blocks are sufficient to reconstruct and read the tuple. This paper presents several strategies to place those blocks across the set of nodes of a wide area network, that all together form the tuple space. We present the performance trade-offs of different placement strategies by means of simulations and a Python implementation of a distributed tuple space. Our results reveal important differences in the efficiency of the different strategies, for example in terms of block fetching latency, and that having some knowledge of the underlying network graph topology is highly beneficial.
%G English
%Z TC 6
%Z WG 6.1
%2 https://inria.hal.science/hal-01800123/document
%2 https://inria.hal.science/hal-01800123/file/450046_1_En_5_Chapter.pdf
%L hal-01800123
%U https://inria.hal.science/hal-01800123
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC6
%~ IFIP-WG6-1
%~ IFIP-DAIS
%~ IFIP-DISCOTEC
%~ IFIP-LNCS-10320