Publication

uBFT: Microsecond-Scale BFT using Disaggregated Memory

Related publications (14)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

In online data-intensive (OLDI) services, each client request typically executes on multiple servers in parallel; as a result, “system hiccups”, although rare within a single server, can interfere with many client requests and cause violations of service-l ...

USENIX2021

In the problem of private information retrieval with side information, a single user wants to recover one of the K independent messages which are stored at one or multiple servers. The user initially has a subset of messages as side information. The goal o ...

2018

Multiview video refers to videos of the same dynamic 3-D scene captured simultaneously by multiple closely spaced cameras from different viewpoints. We study interactive streaming of pre-encoded multiview videos, where, at any time, a client can request an ...

Ieee-Inst Electrical Electronics Engineers Inc2014

, , ,

The soaring demand for computing power in our digital information age has produced as collateral undesirable effect a surge in power consumption and heat density for computing servers. Accordingly, 30-40% of the energy consumed in state-of-the-art servers ...

IEEE/ACM Press2014

, , , , , , , ,

Emerging scale-out workloads require extensive amounts of computational resources. However, data centers using modern server hardware face physical constraints in space and power, limiting further expansion and calling for improvements in the computational ...

2012

Quantifying the Mismatch between Emerging Scale-Out Applications and Modern Processors

Anastasia Ailamaki, Babak Falsafi, Michael Ferdman, Mohammad Alisafaee, Yusuf Onur Koçberber, Stavros Volos, Ilknur Cansu Kaynak, Adrian Daniel Popescu, Al Mutaz Adileh, Dorde Jevdic

Association for Computing Machinery2012

Clearing the Clouds: A Study of Emerging Workloads on Modern Hardware

Anastasia Ailamaki, Babak Falsafi, Michael Ferdman, Mohammad Alisafaee, Yusuf Onur Koçberber, Stavros Volos, Ilknur Cansu Kaynak, Adrian Daniel Popescu, Al Mutaz Adileh

Emerging scale-out cloud applications need extensive amounts of computational resources. However, data centers using modern server hardware face physical constraints in space and power, limiting further expansion and calling for improvements in the computa ...

2011

RouteBricks: Exploiting Parallelism to Scale Software Routers

Mihai Dobrescu

We revisit the problem of scaling software routers, motivated by recent advances in server technology that enable high-speed parallel processing---a feature router workloads appear ideally suited to exploit. We propose a software router architecture that p ...

ACM2009

Relaxed Atomic Broadcast: State-Machine Replication Using Bounded Memory

André Schiper, Sergio Mena, Omid Shahmirzadi

Atomic broadcast is a useful abstraction for implementing fault-tolerant distributed applications such as state machine replication. Although a number of algorithms solving atomic broadcast have been published, the problem of bounding the memory used by th ...

2009

Advanced Peer-to-Peer Networking: The P-Grid System and its Applications

Karl Aberer, Manfred Hauswirth, Philippe Cudré-Mauroux, Anwitaman Datta, Roman Schmidt, Jie Wu, Zoran Despotovic

The limitations of client/server systems become evident in an Internet-scale distributed environment. Peer-topeer (P2P) systems offer an interesting alternative to traditional client/server systems: Every node acts both as a client and a server and “ ...

2003