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

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Writing a correct operating system kernel is notoriously hard. Kernel code requires manual memory management and type-unsafe code and must efficiently handle complex, asynchronous events. In addition, increasing CPU core counts further complicate kernel de ...

Reliable broadcast is a communication primitive guaranteeing, intuitively, that all processes in a distributed system deliver the same set of messages. The reason why this primitive is appealing is twofold: (i) we can implement it deterministically in a co ...

Secure asynchronous two-party communication applies ratcheting to strengthen privacy, in the presence of internal state exposures. Security with ratcheting is provided in two forms: forward security and post-compromise security. There have been several suc ...

This work demonstrates the first 3D printed wearable motor-sensory module prototype designed for facial rehabilitation, focusing on facial paralysis. The novelty of the work lies in the fast fabrication of the first fully soft working prototype, including ...

Let G be a simply connected simple algebraic group over an al- gebraically closed ﬁeld k of characteristic p > 0. The category of rationalG-modules is not semisimple. We consider the question of when the tensorproduct of two simple G-modules L(λ) and L(μ) ...

Modern large-scale data platforms manage colossal amount of data, generated by the ever-increasing number of concurrent users. Geo-replicated and sharded key-value data stores play a central role when building such platforms. As the strongest consistency m ...

Modern online services are shifting away from monolithic applications to loosely-coupled microservices because of their improved scalability, reliability, programmability and development velocity. Microservices communicating over the datacenter network req ...

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). More sophisticated applications, like cryptocurrencies, need ...

Datacenters are the heart of our digital lives. Online applications, such as social-networking and e-commerce, run inside datacenters under strict Service Level Objectives for their tail latency. Tight latency SLOs are necessary for such services to remain ...

In this thesis, we revisit classic problems in shared-memory distributed computing through the lenses of (1) emerging hardware technologies and (2) changing requirements. Our contributions consist, on the one hand, in providing a better understanding of th ...

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

Chattez avec Graph Search

NrOS: Effective Replication and Sharing in an Operating System

Dynamic Byzantine Reliable Broadcast

Beyond Security and Efficiency: On-Demand Ratcheting with Security Awareness

3D Printed Motor-Sensory Module Prototype for Facial Rehabilitation

On complete reducibility of tensor products of simple modules over simple algebraic groups

Efficient Protocols for Enforcing Causal Consistency in Geo-Replicated Key-Value Data Stores

Optimus Prime: Accelerating Data Transformation in Servers

Mneme: A Mobile Distributed Ledger

Operating System and Network Co-Design for Latency-Critical Datacenter Applications

Distributed Computing with Modern Shared Memory