Concept

Middleware (distributed applications)

Related publications (82)

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.

ASEBA, an event-based middleware for distributed robot control

Francesco Mondada, Stéphane Magnenat, Valentin Longchamp

Computing infrastructures of mobile robots have grown in complexity in the last decades; They have evolved from single processor systems to networks of microcontrollers communicating through a shared bus. This has induced additional architectural constrain ...

IEEE Press2007

Structural and Algorithmic Issues of Dynamic Protocol Update

André Schiper, Olivier Rütti

In this paper, we study dynamic protocol update (DPU). Contrary to local code updates on-the-fly, DPU requires global coordination of local code replacements. We propose a novel solution to DPU. The key idea is to add a level of indirection between the ser ...

2006

Middleware support for the "Internet of Things"

Karl Aberer, Manfred Hauswirth, Ali Salehi

The ``Internet of Things'' intends to enhance items of our everyday life with information and/or processing and interconnect them, so that computers can sense, integrate, present, and react on all kinds of aspects of the physical world. As this implies tha ...

5th GI/ITG KuVS Fachgespräch "Drahtlose Sensornetze"2006

Type-based event dissemination

Sébastien Bähni

With the explosion of broadband Internet connections in the late 80s, new types of applications, called distributed applications, came to light. These applications typically seek to provide a user with remote services that appear to that user as if they we ...

EPFL2006

Energy-efficient dynamic memory allocators at the middleware level of embedded systems

David Atienza Alonso

The next generation of embedded systems will be dominated by mobile devices, which are able to deliver communications and rich multimedia content anytime, anywhere. The major themes in these ubiquitous computing systems are applications with increased user ...

ACM2006

Caching Dynamic Web Content: Designing and Analysing an Aspect-Oriented Solution

Willy Zwaenepoel, Sumit Mittal

Caching dynamic web content is an effective approach to reduce Internet latency and server load. An ideal caching solution is one that can be added transparently by the developers and provides complete consistency of the cached documents, while minimizing ...

2006

Tashkent: Uniting Durability with Transaction Ordering for High-Performance Scalable Database Replication

Sameh Mohamed Elnikety, Fernando Pedone

In stand-alone databases, the functions of ordering the transaction commits and making the effects of transactions durable are performed in one single action, namely the writing of the commit record to disk. For efficiency many of these writes are grouped ...

2006

Dynamic Update of Distributed Agreement Protocols

André Schiper, Olivier Rütti

In this paper, we address the problem of dynamic protocol update (DPU) that requires global coordination of local code replacements. We propose a novel approach to DPU. The key idea is the use of synchronization facilities of the services that get updated. ...

2005

Time-complexity bounds on agreement problems

Partha Dutta

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

EPFL2005

Binary Versus Analogue Path Monitoring in IP Networks

Patrick Thiran, Xuan Hung Nguyen

Monitoring systems that can detect path outages and periods of degraded performance are important for many distributed applications. Trivial pairwise probing systems do not scale well and cannot be employed in large networks. To build scalable path monitor ...

2005