HASLab - Indexed Articles in Conferences
Permanent URI for this collection
Browse
Browsing HASLab - Indexed Articles in Conferences by Author "5596"
Results Per Page
Sort Options
-
ItemEfficient replication via timestamp stability( 2021) Vítor Manuel Duarte ; Carlos Baquero ; Gotsman,A ; Sutra,P ; 6704 ; 5596Modern web applications replicate their data across the globe and require strong consistency guarantees for their most critical data. These guarantees are usually provided via state-machine replication (SMR). Recent advances in SMR have focused on leaderless protocols, which improve the availability and performance of traditional Paxos-based solutions. We propose Tempo - a leaderless SMR protocol that, in comparison to prior solutions, achieves superior throughput and offers predictable performance even in contended workloads. To achieve these benefits, Tempo timestamps each application command and executes it only after the timestamp becomes stable, i.e., all commands with a lower timestamp are known. Both the timestamping and stability detection mechanisms are fully decentralized, thus obviating the need for a leader replica. Our protocol furthermore generalizes to partial replication settings, enabling scalability in highly parallel workloads. We evaluate the protocol in both real and simulated geo-distributed environments and demonstrate that it outperforms state-of-the-art alternatives. © 2021 ACM.
-
ItemEfficient replication via timestamp stability( 2021) Carlos Baquero ; Vítor Manuel Duarte ; Gotsman,A ; Sutra,P ; 5596 ; 6704
-
ItemEfficient synchronization of state-based CRDTs( 2019) Paulo Sérgio Almeida ; Leitao,J ; Carlos Baquero ; Vítor Manuel Duarte ; 5607 ; 6704 ; 5596To ensure high availability in large scale distributed systems, Conflict-free Replicated Data Types (CRDTs) relax consistency by allowing immediate query and update operations at the local replica, with no need for remote synchronization. State-based CRDTs synchronize replicas by periodically sending their full state to other replicas, which can become extremely costly as the CRDT state grows. Delta-based CRDTs address this problem by producing small incremental states (deltas) to be used in synchronization instead of the full state. However, current synchronization algorithms for delta-based CRDTs induce redundant wasteful delta propagation, performing worse than expected, and surprisingly, no better than state-based. In this paper we: 1) identify two sources of inefficiency in current synchronization algorithms for delta-based CRDTs; 2) bring the concept of join decomposition to state-based CRDTs; 3) exploit join decompositions to obtain optimal deltas and 4) improve the efficiency of synchronization algorithms; and finally, 5) experimentally evaluate the improved algorithms. © 2019 IEEE.
-
ItemEfficient Synchronization of State-based CRDTs( 2019) Paulo Sérgio Almeida ; Leitao,J ; Carlos Baquero ; Vítor Manuel Duarte ; 5607 ; 6704 ; 5596
-
ItemGlobal-Local View: Scalable Consistency for Concurrent Data Types( 2018) Akkoorath,DD ; Brandão,J ; Bieniusa,A ; Carlos Baquero ; 5596Concurrent linearizable access to shared objects can be prohibitively expensive in a high contention workload. Many applications apply ad-hoc techniques to eliminate the need for synchronous atomic updates, which may result in non-linearizable implementations. We propose a new model which leverages such patterns for concurrent access to objects in a shared memory system. In this model, each thread maintains different views on the shared object: a thread-local view and a global view. As the thread-local view is not shared, it can be updated without incurring synchronization costs. These local updates become visible to other threads only after the thread-local view is merged with the global view. This enables better performance at the expense of linearizability. We discuss the design of several datatypes and evaluate their performance and scalability compared to linearizable implementations. © 2018, Springer International Publishing AG, part of Springer Nature.
-
ItemHigher-order patterns in replicated data types( 2019) Paulo Sérgio Almeida ; Leijnse,A ; Carlos Baquero ; 5607 ; 5596The design of Conflict-free Replicated Data Types traditionally requires implementing new designs from scratch to meet a desired behavior. Although there are composition rules that can guide the process, there has not been a lot of work explaining how existing data types relate to each other, nor work that factors out common patterns. To bring clarity to the field we explain underlying patterns that are common to flags, sets, and registers. The identified patterns are succinct and composable, which gives them the power to explain both current designs and open up the space for new ones. © 2019 Copyright held by the owner/author(s). Publication rights licensed to ACM.
-
ItemProbabilistic Causal Contexts for Scalable CRDTs( 2023) Carlos Baquero ; 5596
-
ItemState-machine replication for planet-scale systems( 2020) Perrin,M ; Sutra,P ; Vítor Manuel Duarte ; Carlos Baquero ; Rezende,TF ; Gotsman,A ; 6704 ; 5596
-
ItemTime-limited Bloom Filter( 2023) Paulo Sérgio Almeida ; Carlos Baquero ; 5607 ; 5596