Protocol composition frameworks and modular group communication : models, algorithms and architectures

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.

Enterprises collect data in large volumes and leverage them to drive numerous concurrent decisions and business processes. Their teams deploy multiple applications that often operate concurrently on the same data and infrastructure but have widely differen ...

The scale and pervasiveness of the Internet make it a pillar of planetary communication, industry and economy, as well as a fundamental medium for public discourse and democratic engagement. In stark contrast with the Internet's decentralized infrastructur ...

The pursuit of software security and reliability hinges on the identification and elimination of software vulnerabilities, a challenge compounded by the vast and evolving complexity of modern systems. Fuzzing has emerged as an indispensable technique for b ...

Most modern in-memory online transaction processing (OLTP) engines rely on multi-version concurrency control (MVCC) to provide data consistency guarantees in the presence of conflicting data accesses. MVCC improves concurrency by generating a new version o ...

Biphoton frequency combs (BFCs) are promising quantum sources for large-scale and high-dimensional quantum information and networking systems. In this context, the spectral purity of individual frequency bins will be critical for realizing quantum networki ...

The landscape of computing is changing, thanks to the advent of modern networking equipment that allows machines to exchange information in as little as one microsecond. Such advancement has enabled microsecond-scale distributed computing, where entire dis ...

We introduce the first multitasking vision transformer adapters that learn generalizable task affinities which can be applied to novel tasks and domains. Integrated into an off-the-shelf vision transformer backbone, our adapters can simultaneously solve mu ...

Distributed systems designers typically strive to improve performance and preserve availability despite failures or attacks; but, when strong consistency is also needed, they encounter fundamental limitations. The bottleneck is in replica coordination, whi ...

A correspondence functor is a functor from the category of finite sets and correspondences to the category of k-modules, where k is a commutative ring. By means of a suitably defined duality, new correspondence functors are constructed, having remarkable p ...

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 ...

The aim of this paper is to serve as a lightweight introduction to concurrency control for database theorists through a uniform presentation of the work on robustness against Multiversion Read Committed and Snapshot Isolation. ...

Advances in mobile computing have paved the way for new types of distributed applications that can be executed solely by mobile devices on Device-to-Device (D2D) ecosystems (e.g., crowdsensing). Sophisticated applications, like cryptocurrencies, need distr ...

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 ...

The ability of dataflow circuits to implement dynamic scheduling promises to overcome the conservatism of static scheduling techniques that high-level synthesis tools typically rely on. Yet, the same distributed control mechanism that allows dataflow circu ...

An oblivious linear function evaluation protocol, or OLE, is a two-party protocol for the function f (x) = ax + b, where a sender inputs the field elements a, b, and a receiver inputs x and learns f (x). OLE can be used to build secret-shared multiplicatio ...

As IoT applications gain widespread adoption, it becomes important to design and implement IoT protocols with security. Existing research in protocol security reveals that the majority of disclosed protocol vulnerabilities are caused by incorrectly impleme ...

Nanoparticles (NPs) have wide applications in physical and chemical processes, and their individual properties (e.g., shape, size, and composition) and ensemble properties (e.g., distribution and homogeneity) can significantly affect the performance. Howev ...

The booming popularity of online services has led to a major evolution in the way these services are built and deployed. To cope with such online data-intensive services, service providers deploy several massive-scale datacenters, also referred to as wareh ...

Computational protein design has emerged as a powerful tool capable of identifying sequences compatible with pre-defined protein structures. The sequence design protocols, implemented in the Rosetta suite, have become widely used in the protein engineering ...

Consensus protocols for asynchronous networks are usually complex and inefficient, leading practical systems to rely on synchronous protocols. The invention proposes an approach to simplify asynchronous consensus by building it atop a novel threshold logic ...

Protocol composition frameworks and modular group communication : models, algorithms and architectures

Chat with Graph Search

Oligolithic Cross-task Optimizations across Isolated Workloads

Planetary-Scale Byzantine Fault Tolerance

To Infinity, and Beyond (Coverage)

One-shot Garbage Collection for In-memory OLTP through Temporality-aware Version Storage

Time-Resolved Hanbury Brown-Twiss Interferometry of On-Chip Biphoton Frequency Combs Using Vernier Phase Modulation

Reliable Microsecond-Scale Distributed Computing

Vision Transformer Adapters for Generalizable Multitask Learning

Building Strongly-Consistent Systems Resilient to Failures, Partitions, and Slowdowns

Correspondence functors and duality

Hardware and Software Support for RPC-Centric Server Architecture

Concurrency control for database theorists

Toward Mobile Distributed Ledgers

Differentiated consistency for worldwide gossips

A Comprehensive Timing Model for Accurate Frequency Tuning in Dataflow Circuits

Efficient protocols for oblivious linear function evaluation from ring-LWE

PROFACTORY: Improving IoT Security via Formalized Protocol Customization

High-Throughput Sizing, Counting, and Elemental Analysis of Anisotropic Multimetallic Nanoparticles with Single-Particle Inductively Coupled Plasma Mass Spectrometry

Hardware-Software Co-Design of an RPC Processor

A Rosetta-based protein design protocol converging to natural sequences

Asynchronous distributed coordination and consensus with threshold logical clocks