Name
Abstract | ||
|---|---|---|
Strongly consistent systems supporting distributed transactions can be prone to high latency and do not tolerate partitions. The present trend of using weaker forms of consistency, to achieve high availability, poses notable challenges in writing applications due to the lack of linearizability, e.g., to ensure global invariants, or perform mutator operations on a distributed datatype. This paper addresses a specific problem: the exactly-once transfer of a \"quantity\" from one node to another on an unreliable network (coping with message duplication, loss, or reordering) and without any form of global synchronization. This allows preserving a global property (the sum of quantities remains unchanged) without requiring global linearizability and only through using pairwise interactions between nodes, therefore allowing partitions in the system. We present the novel quantity-transfer algorithm while focusing on a specific use-case: a redistribution protocol to keep the quantities in a set of nodes balanced, in particular, averaging a shared real number across nodes. Since this is a work in progress, we briefly discuss the correctness of the protocol, and we leave potential extensions and empirical evaluations for future work. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/SRDSW.2015.10 | SRDS Workshop |
Keywords | DocType | ISSN |
Distributed monoid-like data-types,exactly-once quantity-transfer,idempotence | Conference | 1060-9857 |
Citations | PageRank | References |
1 | 0.38 | 15 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ali Shoker | 1 | 43 | 7.40 |
| Paulo Sérgio Almeida | 2 | 268 | 23.03 |
| Carlos Baquero | 3 | 132 | 14.10 |