System Support for Efficient Replication in Distributed Systems

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.

The hardware complexity of modern machines makes the design of adequate programming models crucial for jointly ensuring performance, portability, and productivity in high-performance computing (HPC). Sequential task-based programming models paired with adv ...

Formally verifying the correctness of software network functions (NFs) is necessary for network reliability, yet existing techniques require full source code and mandate the use of specific data structures. We describe an automated technique to verify NF b ...

Byzantine Reliable Broadcast (BRB) is a fundamental distributed computing primitive, with applications ranging from notifications to asynchronous payment systems. Motivated by practical consideration, we study Client-Server Byzantine Reliable Broadcast (CS ...

Peer-to-peer (p2p) networks are not independent of their peers, and the network efficiency depends on peers contributing resources. Because shared resources are not free, this contribution must be rewarded. Peers across the network may share computation po ...

The notion of adversary is a staple of distributed computing. An adversary typically models “hostile” assumptions about the underlying distributed environment, e.g., a network that can drop messages, an operating system that can delay processes or an attac ...

Machine learning is currently shifting from a centralized paradigm to decentralized ones where machine learning models are trained collaboratively. In fully decentralized learning algorithms, data remains where it was produced, models are trained locally a ...

Type-level programming is becoming more and more popular in the realm of functional programming. However, the combination of type-level programming and subtyping remains largely unexplored in practical programming languages. This paper presents match types ...

Eventual consistency is a consistency model that favors liveness over safety. It is often used in large-scale distributed systems where models ensuring a stronger safety incur performance that are too low to be deemed practical. Eventual consistency tends ...

This paper presents an analysis of the role of social media, specifically Twitter, in the context of non-fungible tokens, better known as NFTs. Such emerging technology framing the creation and exchange of digital object, started years ago with early proje ...

Utilization of edge devices has exploded in the last decade, with such use cases as wearable devices, autonomous driving, and smart homes. As their ubiquity grows, so do expectations of their capabilities. Simultaneously, their formfactor and use cases lim ...

Formal verification of real-world software systems remains challenging for a number of reasons, including lack of automation, friction in specifying properties, and limited support for the diverse programming paradigms used in industry. In this thesis we m ...

Online services have become ubiquitous in technological society, the global demand for which has driven enterprises to construct gigantic datacenters that run their software. Such facilities have also recently become a substrate for third-party organizatio ...

Although telomeres are essential for chromosome stability, they represent fragile structures in our genome. Telomere shortening occurs during aging in cells lacking telomerase due to the end replication problem. In addition, recent work uncovered that the ...

System Support for Efficient Replication in Distributed Systems

Chat with Graph Search

Decentralized in-order execution of a sequential task-based code for shared-memory architectures

Automated Verification of Network Function Binaries

Oracular Byzantine Reliable Broadcast

Fair Incentivization of Bandwidth Sharing in Decentralized Storage Networks

The Universal Gossip Fighter

Frugal Decentralized Learning

Type-Level Programming with Match Types

Differentiated consistency for worldwide gossips

The impact of NFT profile pictures within social network communities

In-Memory Hardware and Architectural Extensions for Workloads Acceleration

Scaling Language Features for Program Verification

Hardware and Software Support for RPC-Centric Server Architecture

TFIIH moonlighting at telomeres