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

I'm a MSc student at the Department of Informatics of the University of Minho, supervised by Professor Carlos Baquero, and hosted by HASLab, INESC TEC. I've been granted two internships from HASLab and from NOVA University of Lisbon to pursue my research, mainly within my MSc program and the EU FP7 SyncFree project, which was partially published at ECOOP PMLDC’16 workshop in Italy. I hold a Bachelor degree in Computer Science from University of Minho as well. I'm working on Distributed Systems (Eventual Consistency), but I also enjoy Formal Methods (although I know very little about them). I hope that, one day, I can work on both of them to make Distributed Systems work better..

Interest
Topics
Details

Details

  • Name

    Vítor Manuel Duarte
  • Cluster

    Computer Science
  • Role

    Research Assistant
  • Since

    01st February 2016
001
Publications

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

The Single-Writer Principle in CRDT Composition

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

Publication
Proceedings of the Programming Models and Languages for Distributed Computing on - PMLDC '17

Abstract

2017

Practical evaluation of the Lasp programming model at large scale

Authors
Meiklejohn, CS; Enes, V; Yoo, J; Baquero, C; Roy, PV; Bieniusa, A;

Publication
ACM International Conference Proceeding Series

Abstract
Programming models for building large-scale distributed applications assist the developer in reasoning about consistency and distribution. However, many of the programming models for weak consistency, which promise the largest scalability gains, have little in the way of evaluation to demonstrate the promised scalability. We present an experience report on the implementation and largescale evaluation of one of these models, Lasp, originally presented at PPDP '15, which provides a declarative, functional programming style for distributed applications. We demonstrate the scalability of Lasp's prototype runtime implementation up to 1024 nodes in the Amazon cloud computing environment. It achieves high scalability by uniquely combining hybrid gossip with a programming model based on convergent computation. We report on the engineering challenges of this implementation and its evaluation, specifically related to operating research prototypes in a production cloud environment. © 2017 Copyright held by the owner/author(s).

2016

Join Decompositions for Efficient Synchronization of CRDTs after a Network Partition: Work in progress report

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

Publication
First Workshop on Programming Models and Languages for Distributed Computing, PMLDC@ECOOP 2016, Rome, Italy, July 17, 2016

Abstract
State-based CRDTs allow updates on local replicas without remote synchronization. Once these updates are propagated, possible conflicts are resolved deterministically across all replicas. d-CRDTs bring significant advantages in terms of the size of messages exchanged between replicas during normal operation. However, when a replica joins the system after a network partition, it needs to receive the updates it missed and propagate the ones performed locally. Current systems solve this by exchanging the full state bidirectionally or by storing additional metadata along the CRDT. We introduce the concept of join-decomposition for state-based CRDTs, a technique orthogonal and complementary to delta-mutation, and propose two synchronization methods that reduce the amount of information exchanged, with no need to modify current CRDT definitions. © 2016 Copyright held by the owner/author(s).