activity
20152024
most citedBandwidth-Aware Page Placement in NUMA

17 citations · 39 across the 10 of their papers we have counts for

collaborators
Showing cs.DCShow all

10 papers · 1 filter

cs.DC2024

Alea-BFT: Practical Asynchronous Byzantine Fault Tolerance

Diogo S. Antunes, Afonso N. Oliveira, André Breda +3

Traditional Byzantine Fault Tolerance (BFT) state machine replication protocols assume a partial synchrony model, leading to a design where a leader replica drives the protocol and…

cs.DC2022★ 3 cited

Alea-BFT: Practical Asynchronous Byzantine Fault Tolerance

Afonso Oliveira, Henrique Moniz, Rodrigo Rodrigues

Traditional Byzantine Fault Tolerance (BFT) state machine replication protocols assume a partial synchrony model, leading to a design where a leader replica drives the protocol and…

cs.DC2021★ 3 cited

With Great Freedom Comes Great Opportunity: Rethinking Resource Allocation for Serverless Functions

Muhammad Bilal, Marco Canini, Rodrigo Fonseca +1

Current serverless offerings give users a limited degree of flexibility for configuring the resources allocated to their function invocations by either coupling memory and CPU reso…

cs.DC2020

Lazy State Determination: More concurrency for contending linearizable transactions

Tiago M. Vale, João Leitão, Nuno Preguiça +3

The concurrency control algorithms in transactional systems limits concurrency to provide strong semantics, which leads to poor performance under high contention. As a consequence,…

cs.DC2020

Aion: Better Late than Never in Event-Time Streams

Sérgio Esteves, Gianmarco De Francisci Morales, Rodrigo Rodrigues +2

Processing data streams in near real-time is an increasingly important task. In the case of event-timestamped data, the stream processing system must promptly handle late events th…

cs.DC2020★ 17 cited

Bandwidth-Aware Page Placement in NUMA

David Gureya, João Neto, Reza Karimi +6

Page placement is a critical problem for memoryintensive applications running on a shared-memory multiprocessor with a non-uniform memory access (NUMA) architecture. State-of-the-a…

cs.DC2018★ 1 cited

IPA: Invariant-preserving Applications for Weakly-consistent Replicated Databases

Valter Balegas, Nuno Preguiça, Sérgio Duarte +2

Storage systems based on Weak Consistency provide better availability and lower latency than systems that use Strong Consistency, especially in geo-replicated settings. However, un…

cs.DC2017

Generalized Paxos Made Byzantine (and Less Complex)

Miguel Pires, Srivatsan Ravi, Rodrigo Rodrigues

One of the most recent members of the Paxos family of protocols is Generalized Paxos. This variant of Paxos has the characteristic that it departs from the original specification o…

cs.DC2017

Making data center computations fast, but not so furious

Daniel Porto, João Loff, Rui Duarte +2

We propose an aggressive computational sprinting variant for data center environments. While most of previous work on computational sprinting focuses on maximizing the sprinting pr…

cs.DC2015★ 11 cited

Extending Eventually Consistent Cloud Databases for Enforcing Numeric Invariants

Valter Balegas, Diogo Serra, Sérgio Duarte +5

Geo-replicated databases often operate under the principle of eventual consistency to offer high-availability with low latency on a simple key/value store abstraction. Recently, so…