Cookies Policy
We use cookies to improve our site and your experience. By continuing to browse our site you accept our cookie policy. Find out More
Close
  • Menu
About

About

My research interests cover data management in eventual consistent settings, distributed data aggregation and causality tracking. In the last years I have collaborated with my co-authors in the development of data summary mechanisms such as Scalable Bloom Filters, causality tracking for dynamic settings with Interval Tree Clocks and Dotted Version Vectors and in predictable eventual consistency with Conflict-Free Replicated Data Types. My recent work has been applied in the Riak distributed database and in Akka distributed data, and is running in production systems serving millions of users worldwide.

Interest
Topics
Details

Details

  • Name

    Carlos Baquero
  • Cluster

    Computer Science
  • Role

    Area Manager
  • Since

    01st November 2011
003
Publications

2018

Delta State Replicated Data Types

Authors
Almeida, PS; Shoker, A; Baquero, C;

Publication
CoRR

Abstract

2018

Global-Local View: Scalable Consistency for Concurrent Data Types

Authors
Akkoorath, DD; Brandão, J; Bieniusa, A; Baquero, C;

Publication
Euro-Par 2018: Parallel Processing - 24th International Conference on Parallel and Distributed Computing, Turin, Italy, August 27-31, 2018, Proceedings

Abstract
Concurrent 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.

2017

Borrowing an Identity for a Distributed Counter: Work in progress report

Authors
Enes, V; Baquero, C; Almeida, PS; Leitao, J;

Publication
Proceedings of the 3rd International Workshop on Principles and Practice of Consistency for Distributed Data, PaPoC@EuroSys 2017, Belgrade, Serbia, April 23 - 26, 2017

Abstract
Conflict-free Replicated Data Types (CRDTs) are data abstractions (registers, counters, sets, maps, among others) that provide a relaxed consistency model called Eventual Consistency. Current designs for CRDT counters do not scale, having a size linear with the number of both active and retired nodes (i.e., nodes that leave the system permanently after previously manipulating the value of the counter). In this paper we present a new counter design called Borrow-Counter, that provides a mechanism for the retirement of transient nodes, keeping the size of the counter linear with the number of active nodes. © 2017 ACM.

2017

Compact Resettable Counters through Causal Stability

Authors
Younes, G; Almeida, PS; Baquero, C;

Publication
Proceedings of the 3rd International Workshop on Principles and Practice of Consistency for Distributed Data, PaPoC@EuroSys 2017, Belgrade, Serbia, April 23 - 26, 2017

Abstract
Conflict-free Data Types (CRDTs) were designed to automatically resolve conflicts in eventually consistent systems. Different CRDTs were designed in both operation-based and state-based flavors such as Counters, Sets, Registers, Maps, etc. In a previous paper [2], Baquero et al. presented the problem with embedded CRDT counters and a solution, covering state-based counters that can be embedded in maps, but needing an ad-hoc extension to the standard counter API. Here, we present a resettable operation-based counter design, with the standard simple API and small state, through a causalstability- based state compaction. © 2017 ACM.

2017

Scalable eventually consistent counters over unreliable networks

Authors
Almeida, PS; Baquero, C;

Publication
Distributed Computing

Abstract

Supervised
thesis

2017

Broadcast Cancellation in Unstructured Networks

Author
Rui Manuel Dias Ferreira Lima

Institution
UM

2017

Efficient Synchronization of state-based CRDTs

Author

Institution
UM

2017

Sensing, coordination and actuation in office spaces

Author

Institution
UM

2016

Optimizing Operation-based Conflict-free Replicated Data Types

Author
Georges Younes

Institution
UM

2016

Broadcast Cancellation

Author
Rui Manuel Dias Ferreira Lima

Institution
UM