Cookies Policy
The website need some cookies and similar means to function. If you permit us, we will use those means to collect data on your visits for aggregated statistics to improve our service. Find out More
Accept Reject
  • Menu
About
Download Photo HD

About

Paulo Sérgio Almeida is an Assistant Professor at the Department of Informatics at University of Minho, and a researcher at HASLab / INESC TEC. He obtained a MSc degree from University of Porto in 1994 and a PhD degree in Computer Science from Imperial College London in 1998. His research activities have been in the area of distributed systems, namely in causality tracking mechanisms, eventually consistent non-relational databases, fault-tolerant distributed aggregation algorithms, bloom filters, and distributed algorithms in graphs. In recent years the main focus of research has been on Conflict-free Replicated Data Types.

Interest
Topics
Details

Details

  • Name

    Paulo Sérgio Almeida
  • Role

    Senior Researcher
  • Since

    01st November 2011
  • Nationality

    Portugal
  • Contacts

    +351253604440
    paulo.s.almeida@inesctec.pt
002
Publications

2019

Scalable eventually consistent counters over unreliable networks

Authors
Almeida, PS; Baquero, C;

Publication
Distributed Computing

Abstract

2019

Higher-order patterns in replicated data types

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

Publication
Proceedings of the 6th Workshop on Principles and Practice of Consistency for Distributed Data, PaPoC 2019

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

2019

Efficient Synchronization of State-based CRDTs

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

Publication
CoRR

Abstract

2018

Delta State Replicated Data Types

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

Publication
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING

Abstract

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.

Supervised
thesis

2019

Beyong Distributed Transctions through Exactly-once Exchanges

Author
Ziad Ali Kassam

Institution
UP-FCUP

2018

Beyong Distributed Transctions through Exactly-once Exchanges

Author
Ziad Ali Kassam

Institution
INESCTEC

2018

Multi-Value Distributed Key-Value Stores

Author
Ricardo Jorge Tomé Gonçalves

Institution
UM

2017

Beyond Distributed Transactions through Exactly-Once Exchanges

Author
Ziad Kassam

Institution
UM

2016

Beyond Distributed Transactions through Exactly-Once Exchanges

Author
Ziad Kassam

Institution
UM