Unit

Data Center Systems Laboratory

Laboratory

Related publications (282)

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.

Distributed programming with typed events

Rachid Guerraoui, Patrick Eugster

The remote-procedure-call abstraction, including its derivates (underlying, for example, Java RMI, CORBA, and .NET), currently represents one of the most popular paradigms for devising distributed applications. Objects (when acting as servers) are invoked ...

2004

Scalable Component Abstractions

We identify three programming language abstractions for the construction of re-usable components: abstract type members, explicit selftypes and symmetric mixin composition. Together, these abstractions enable us to transform an arbitrary assembly of static ...

2004

Scalable Component Abstractions

Martin Odersky, Matthias Zenger

2004

Towards Flexible Finite-State-Machine-Based Protocol Composition

André Schiper, Sergio Mena, Nils Richard Ekwall, Stefan Pleisch

We propose a novel approach to the composition of group communication protocols. In this approach, components are modelled as finite state machines communicating via signals. We introduce two building blocks, called adaptor and adaplexor, that ease the dev ...

2004

Reducing Fair Exchange to Atomic Commit

Rachid Guerraoui, Serge Vaudenay, Marko Vukolic, Gildas Avoine

The fair exchange problem is key to trading electronic items in systems of mutually untrusted parties.We consider modern variants of such systems where each party is equipped with a tamper proof security module. The security modules trust each other but ca ...

2004

Run-time Support for Distributed Object Sharing in Safe Programming Languages

Willy Zwaenepoel

We present a new run-time system that supports object sharing in a distributed system. The key insight in this system is that a handle-based implementation of such a system enables effcient and transparent sharing of data with both fine-grained and coarse- ...

2003

Shared Memory vs Message Passing

Rachid Guerraoui

his paper determines the computational strenght of the shared memory abstraction (a register) emulated over a message passing system, and compares it with fundamental message passing abstractions like consensus and various forms of reliable broadcast. We i ...

2003

A Flexible and Efficient Application Programming Interface (API) for a Customizable Proxy Cache

Willy Zwaenepoel

This paper describes the design, implementation, and performance of a simple yet powerful Application Programming Interface (API) for providing extended services in a proxy cache. This API facilitates the development of customized content adaptation, conte ...

2003

Unreliable Failure Detectors via Operational Semantics

Rachele Fuzzati

The concept of unreliable failure detectors for reliable distributed systems was introduced by Chandra and Toueg as a fine-grained means to add weak forms of synchrony into asynchronous systems. Various kinds of such failure detectors have been identified ...

2003

Unreliable Failure Detectors via Operational Semantics

Rachele Fuzzati

The concept of Unreliable failure detectors for reliable distributed systems was introduced by Chandra and Toueg as a fine-grained means to add weak forms of synchrony into asynchronous systems. Various kinds of such failure detectors have been identified ...

2003