Distributed Planar Manipulation in Fluidic Environments

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.

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

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

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

We prove that no fully transactional system can provide fast read transactions (including read-only ones that are considered the most frequent in practice). Specifically, to achieve fast read transactions, the system has to give up support of transactions ...

Transactions can simplify distributed applications by hiding data distribution, concurrency, and failures from the application developer. Ideally the developer would see the abstraction of a single large machine that runs transactions sequentially and neve ...

The use of transactions in distributed systems dates back to the 70's. The last decade has also seen the proliferation of transactional systems. In the existing transactional systems, many protocols employ a centralized approach in executing a distributed ...

The celebrated distributed computing approach for building systems and services using multiple machines continues to expand to new domains. Computation devices nowadays have additional sensing and communication capabilities, while becoming, at the same tim ...

This paper investigates the problem of controlling a heterogeneous group of vehicles with the aim of forming multi-lane convoys. We use a distributed, graph-based control law, implemented in a longitudinal coordinate system parallel to the road. Each vehic ...

The long-range correction to the surface tension can amount to up to 55% of the calculated value of the surface tension for cutoffs in the range of 2.1-6.4 sigma. The calculation of the long-range corrections to the surface tension and to the configuration ...

Most existing distributed systems use logical clocks to order events in the implementation of various consistency models. Although logical clocks are straightforward to implement and maintain, they may affect the scalability, availability, and latency of t ...

It is notoriously difficult to develop reliable, high-performance distributed systems that run over asynchronous networks. Even if a distributed system is based on a well-understood distributed algorithm, its implementation can contain errors arising from ...

In modern distributed systems, failures are the norm rather than the exception. In many cases, these failures are not benign. Settings such as the Internet might incur malicious (also called Byzantine or arbitrary) behavior and asynchrony. As a result, and ...

We study erasure-coded atomic register implementations in an asynchronous crash-recovery model. Erasure coding provides a cheap and space-efficient way to tolerate failures in a distributed system. This paper presents ORCAS, Optimistic eRasure-Coded Atomic ...

It is noticeable that our society is increasingly relying on computer systems. Nowadays, computer networks can be found at places where it would have been unthinkable a few decades ago, supporting in some cases critical applications on which human lives ma ...

In many distributed systems, designing an application that maintains consistency and availability despite failure of processes, involves solving some form of agreement. Not surprisingly, providing efficient agreement algorithms is critical for improving th ...

A distributed algorithm comprises a collection of sequential-code entities, which are spread over different computers connected to a network. The process of designing a distributed algorithm is influenced by the assumptions we make on the computational env ...

This thesis is at the crossing of object-orientation and reliable distributed systems, and contributes to integrate those two research fields. Existing distributed programming environments can be characterised according to whether they rely on object conce ...

Distributed Planar Manipulation in Fluidic Environments

Chat with Graph Search

NrOS: Effective Replication and Sharing in an Operating System

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

Distributed Computing with Modern Shared Memory

Distributed Transactional Systems Cannot Be Fast

Fast General Distributed Transactions with Opacity

The Complexity of Reliable and Secure Distributed Transactions

Reliable and Real-Time Distributed Abstractions

Distributed Graph-Based Control of Convoys of Heterogeneous Vehicles using Curvilinear Road Coordinates

Controlling the Long-Range Corrections in Atomistic Monte Carlo Simulations of Two-Phase Systems

Consistency Models in Distributed Systems with Physical Clocks

Model Checking of Distributed Algorithm Implementations

Abstractions for asynchronous distributed computing with malicious players

Optimistic Erasure-Coded Distributed Storage

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

Time-complexity bounds on agreement problems

Soft real-time analysis of asynchronous agreement algorithms using Petri nets

Protocol objects and patterns for structuring reliable distributed systems