Concept

Processus (informatique)

Publications associées (107)

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

The Complexity Of Early Deciding Set Agreement

Rachid Guerraoui, Bastian Pochon

In the k-set agreement problem, each processor starts with a private input value and eventually decides on an output value. At most k distinct output values may be chosen, and every processor's output value must be one of the proposed values. We consider a ...

Society for Industrial and Applied Mathematics2011

The impossibility of boosting distributed service resilience

Rachid Guerraoui

We study f -resilient services, which are guaranteed to operate as long as no more than f of the associated processes fail. We prove three theorems asserting the impossibility of boosting the resilience of such services. Our ﬁrst theorem allows any connect ...

Elsevier2011

Efficient Cache Attacks on AES, and Countermeasures

Dag Arne Osvik

We describe several software side-channel attacks based on inter-process leakage through the state of the CPU's memory cache. This leakage reveals memory access patterns, which can be used for cryptanalysis of cryptographic primitives that employ data-depe ...

Springer Verlag2010

JErlang: Erlang with Joins

Hubert Plociniczak

ERLANG is an industrially successful functional language that uses the Actor model for concurrency. It supports the message-passing paradigm by providing pattern-matching over received messages. Unfortunately coding synchronisation between multiple process ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2010

POP-C++ and Alpine3D: Petition for a New HPC Approach

Michael Lehning, Mathias Thierry Pierre Bavay, Pierre Kuonen

In the developed world, an ever better and finer understanding of the processes leading to natural hazards is expected. This is in part achieved using the invaluable tool of numerical modeling, which offers the possibility of applying scenarios to a given ...

Information Science Reference2010

Parallel fabrication of polymer-protected nanogaps

Francesco Stellacci, Hua Zhang

A method to create an array of sub-5 nm nanogaps with self-aligned holes in a protective polymer overlayer is presented. The parallel formation of the nanogaps, intended for electrical sensing of biomolecules in an aqueous environment, is achieved by elect ...

2010

Effect of inclined jet screen on turbidity current

Anton Schleiss, Giovanni De Cesare, Christoph Oehy

The sustainable use of reservoirs for irrigation, flood protection, water supply and hydropower may be endangered due to unavoidable reservoir sedimentation. Turbidity currents are the main process for the transport and deposit of sediments in reservoirs, ...

2010

Refined quorum systems

Rachid Guerraoui, Marko Vukolic

It is considered good distributed computing practice to devise object implementations that tolerate contention, periods of asynchrony and a large number of failures, but perform fast if few failures occur, the system is synchronous and there is no contenti ...

2010

The Disagreement Power of an Adversary

Rachid Guerraoui

At the heart of distributed computing lies the fundamental result that the level of agreement that can be obtained in an asynchronous shared memory model where t processes can crash is exactly t + 1. In other words, an adversary that can crash any subset o ...

2009

Processor Speed Control with Thermal Constraints

Giovanni De Micheli, David Atienza Alonso, Srinivasan Murali

We consider the problem of adjusting speeds of multiple computer processors, sharing the same thermal environment, such as a chip or multichip package. We assume that the speed of each processor (and associated variables such as power supply voltage) can b ...

2009