Publication

Distributed process groups in the V Kernel

Publications associées (60)

Graph Chatbot

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.

Connectez-vous pour utiliser Chat avec Graph Search

“Alice in London Architecture Festival.”

Jean-Denis Bourquin, Claire Hofmann Chalard

A group of 12 architecture students from EPFL returned from the London Festival of Architecture (19 June-19 July 08), where their contribution, "Overflow", a structure that reacts to tides in the Thames River, was chosen as the best overall project among a ...

EPFL2008

Cayley Graphs and growth of groups

Nathalie Pellet

One of the most fundamental objects in algebra is the group. There exist plenty of different groups. In the following article we consider some free abelian gorups, cyclic groups, free groups and fundamental groups as well as the products of groups and draw ...

2008

Some results for long-range exclusion processes

Thomas Mountford

We examine the long-range exclusion process introduced by Spitzer and studied by Liggett and answer some of the open questions raised by Liggett. In particular, we show the existence of equilibria corresponding to bounded dual harmonic functions and that t ...

2008

Sealing OS Processes to Improve Dependability and Safety

James Richard Larus

In most modern operating systems, a process is a hardware-protected abstraction for isolating code and data. This protection, however, is selective. Many common mechanisms---dynamic code loading, run-time code generation, shared memory, and intrusive syste ...

ACM2007

Cross-Validation Optimization for Large Scale Hierarchical Classification Kernel Methods

Matthias Seeger

We propose a highly efficient framework for kernel multi-class models with a large and structured set of classes. Kernel parameters are learned automatically by maximizing the cross-validation log likelihood, and predictive probabilities are estimated. We ...

2007

Advances in the Design and Implementation of Group Communication Middleware

André Schiper, Sergio Mena, Olivier Rütti, Rachele Fuzzati, Daniel Bünzli

Group communication is a programming abstraction that allows a distributed group of processes to provide a reliable service in spite of the possibility of failures within the group. The goal of the project was to improve the state of the art of group commu ...

Springer Berlin Heidelberg2006

Deconstructing Process Isolation

James Richard Larus

Most operating systems enforce process isolation through hardware protection mechanisms such as memory segmentation, page mapping, and differentiated user and kernel instructions. Singularity is a new operating system that uses software mechanisms to enfor ...

ACM2006

Interfaces of the one-dimensional voter models

Samir Brahim Belhaouari

We show that for a voter model on {0,1}Z corresponding to a random walk with kernel p(·) and starting from unanimity to the right and opposing unanimity to the left, a tight interface between 0's and 1's exists if p(·) has second moments but does not if p( ...

EPFL2006

An integral-equation technique for solving thick irises in rectangular waveguides

Juan Ramon Mosig, Ivica Stevanovic, Pedro Crespo Valero

This paper presents an efficient integral-equation (IE) technique for analysis of thick irises inside multilayered rectangular waveguides. The IEs remain the same as in the case of zero-thickness iris and the thickness is accounted for only as a correction ...

2006

A General Characterization of Indulgence (Invited Paper)

Rachid Guerraoui

An indulgent algorithm is a distributed algorithm that, besides tolerating process failures, also tolerates arbitrarily long periods of instability, with an unbounded number of timing and scheduling failures. In particular, no process can take any irrevoca ...

2006