Cookies
Usamos cookies para melhorar nosso site e a sua experiência. Ao continuar a navegar no site, você aceita a nossa política de cookies. Ver mais
Fechar
  • Menu
Tópicos
de interesse
Detalhes

Detalhes

  • Nome

    Paulo Sérgio Almeida
  • Cargo

    Investigador Sénior
  • Desde

    01 novembro 2011
  • Nacionalidade

    Portugal
  • Contactos

    +351253604440
    paulo.s.almeida@inesctec.pt
002
Publicações

2019

Scalable eventually consistent counters over unreliable networks

Autores
Almeida, PS; Baquero, C;

Publicação
Distributed Computing

Abstract

2019

Higher-order patterns in replicated data types

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

Publicação
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

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

Publicação
CoRR

Abstract

2018

Delta State Replicated Data Types

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

Publicação
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING

Abstract

2017

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

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

Publicação
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.

Teses
supervisionadas

2019

Beyong Distributed Transctions through Exactly-once Exchanges

Autor
Ziad Ali Kassam

Instituição
UP-FCUP

2018

Multi-Value Distributed Key-Value Stores

Autor
Ricardo Jorge Tomé Gonçalves

Instituição
UM

2018

Beyong Distributed Transctions through Exactly-once Exchanges

Autor
Ziad Ali Kassam

Instituição
INESCTEC

2017

Beyond Distributed Transactions through Exactly-Once Exchanges

Autor
Ziad Kassam

Instituição
UM

2016

Eventually Consistent Distributed Data Structure Servers

Autor
Ricardo Jorge Tomé Gonçalves

Instituição
UM