Ricardo J. Dias

Ricardo J. Dias

Auto-generated profile, based on publicly available information

Ricardo J. Dias

Universidade Nova de Lisboa

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
3 April 2017
Verified
Conference Paper
Open access
HMHenrique Moniz
Henrique Moniz
JLJoão Leitão
João Leitão
RDRicardo J. Dias
Ricardo J. Dias
JGJohannes Gehrke
Johannes Gehrke
NPNuno Preguiça
Nuno Preguiça
RRRodrigo Rodrigues
Rodrigo Rodrigues
Most geo-replicated storage systems use weak consistency to avoid the performance penalty of coordinating replicas in different data centers. This departure from strong semantics poses problems to application programmers, who need to address the anomalies enabled by weak consistency. In this paper we use a recently proposed isolation level, called Non-Monotonic Snapshot Isolation, to achieve ACID transactions with low latency. To this end, we present Blotter, a geo-replicated system that leverages these semantics in the design of a new concurrency control protocol that leaves a small amount of local state during reads to make commits more efficient, which is combined with a configuration of Paxos that is tailored for good performance in wide area settings. Read operations always run on the local data center, and update transactions complete in a small number of message steps to a subset of the replicas. We implemented Blotter as an extension to Cassandra. Our experimental evaluation shows that Blotter has a small overhead at the data center scale, and performs better across data centers when compared with our implementations of the core Spanner protocol and of Snapshot Isolation on the same codebase.

9 January 2015 in ACM Transactions on Architecture and Code Optimization
Verified
Journal Article
Open access
HLHeiner Litz
Heiner Litz
RDRicardo J. Dias
Ricardo J. Dias
DCDavid R. Cheriton
David R. Cheriton
Transactional memory systems providing snapshot isolation enable concurrent access to shared data without incurring aborts on read-write conflicts. Reducing aborts is extremely relevant as it leads to higher concurrency, greater performance, and better predictability. Unfortunately, snapshot isolation does not provide serializability as it allows certain anomalies that can lead to subtle consistency violations. While some mechanisms have been proposed to verify the correctness of a program utilizing snapshot isolation transactions, it remains difficult to repair incorrect applications. To reduce the programmer’s burden in this case, we present a technique based on dynamic code and graph dependency analysis that automatically corrects existing snapshot isolation anomalies in transactional memory programs. Our evaluation shows that corrected applications retain the performance benefits characteristic of snapshot isolation over conventional transactional memory systems.

1 January 2013 in Lecture Notes in Computer Science
Verified
Book Chapter
Closed access
PDF file
RDRicardo J. Dias
Ricardo J. Dias
VPVasco Pessanha
Vasco Pessanha
JLJoão M. Lourenço
João M. Lourenço

19 July 2009
Verified
Conference Paper
Open access
PDF file
JLJoão Lourenço
João Lourenço
RDRicardo Dias
Ricardo Dias
JLJoão Luís
João Luís
MRMiguel Rebelo
Miguel Rebelo
VPVasco Pessanha
Vasco Pessanha

1 March 2017
Verified
Conference Paper
Closed access
RDRicardo J. Dias
Ricardo J. Dias
CFCarla Ferreira
Carla Ferreira
JFJan Fiedor
Jan Fiedor
JLJoao M. Lourenco
Joao M. Lourenco
ASAleš Smrčka
Aleš Smrčka
TVTomas Vojnar
Tomas Vojnar
The central notion of this paper is that of contracts for concurrency, allowing one to capture the expected atomicity of sequences of method or service calls in a concurrent program. The contracts may be either extracted automatically from the source code, or provided by developers of libraries or software modules to reflect their expected usage in a concurrent setting. We start by extending the so-far considered notion of contracts for concurrency in several ways, improving their expressiveness and enhancing their applicability in practice. Then, we propose two complementary analyses - a static and a dynamic one - to verify programs against the extended contracts. We have implemented both approaches and present promising experimental results from their application on various programs, including real-world ones where our approach unveiled previously unknown errors.

16 December 2016 in ACM Transactions on Architecture and Code Optimization
Verified
Journal Article
Open access
TVTiago M. Vale
Tiago M. Vale
JSJoão A. Silva
João A. Silva
RDRicardo J. Dias
Ricardo J. Dias
JLJoão M. Lourenço
João M. Lourenço
This article presents Pot, a system that leverages the concept of preordered transactions to achieve deterministic multithreaded execution of programs that use Transactional Memory. Preordered transactions eliminate the root cause of nondeterminism in transactional execution: they provide the illusion of executing in a deterministic serial order, unlike traditional transactions that appear to execute in a nondeterministic order that can change from execution to execution. Pot uses a new concurrency control protocol that exploits the serialization order to distinguish between fast and speculative transaction execution modes in order to mitigate the overhead of imposing a deterministic order. We build two Pot prototypes: one using STM and another using off-the-shelf HTM. To the best of our knowledge, Pot enables deterministic execution of programs using off-the-shelf HTM for the first time. An experimental evaluation shows that Pot achieves deterministic execution of TM programs with low overhead, sometimes even outperforming nondeterministic executions, and clearly outperforming the state of the art.