Concept

Programmation concurrente

Publications associées (378)

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

Frugal Mobile Objects

Rachid Guerraoui, Maxime Monod, Benoît Garbinato, Jesper Honig Spring

This paper presents a computing model for resource-limited mobile devices. The originality of the model lies in the integration of a stronglytyped event-based communication paradigm with abstractions for frugal control, assuming a small footprint runtime. ...

2006

Transactional Memory

James Richard Larus

The advent of multicore processors has renewed interest in the idea of incorporating transactions into the programming model used to write parallel programs. This approach, known as transactional memory, offers an alternative, and hopefully better, way to ...

Morgan & Claypool2006

A Robust Signal Detection Method for Ultra Wide Band (UWB) Networks with Uncontrolled Interference

Jean-Yves Le Boudec, Alaeddine El Fawal

We propose a novel detection method for non-coherent synchronization (signal acquisition) in multi-user UWB impulse radio (IR) networks. It is designed to solve the IUI (Inter-User Interference) that occurs in some ad-hoc networks where concurrent transmis ...

2006

Parallel depth first vs. work stealing schedulers on CMP architectures

Anastasia Ailamaki, Babak Falsafi

In chip multiprocessors (CMPs), limiting the number of off-chip cache misses is crucial for good performance. Many multithreaded programs provide opportunities for constructive cache sharing, in which concurrently scheduled threads share a largely overlapp ...

2006

Protocol composition frameworks and modular group communication

Sergio Mena

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

EPFL2006

Synchronizing without Locks is Inherently Expensive

Rachid Guerraoui, Hagit Albo Attiya

It has been considered bon ton to blame locks for their fragility, especially since researchers identified obstruction-freedom: a progress condition that precludes locking while being weak enough to raise the hope for good performance. This paper attenuate ...

2006

Mirroring Resources or Mapping Requests: Implementing WS-RF for Grid Workflows

Thomas Heinis

The Web services resource framework (WS-RF) and the Web services notification (WS-N) specifications are a crucial component of grid infrastructures. They provide a standardized interface to stateful services so that they can be managed remotely. There are ...

2006

Event-Based Programming without Inversion of Control

Martin Odersky, Philipp Haller

The actor computation model is especially suited for concurrent and distributed computations. Actors are basically concurrent processes which communicate through asynchronous message passing. When combined with pattern matching for messages, actor-based pr ...

2006

Lucky Read/Write Access to Robust Atomic Storage

Rachid Guerraoui, Marko Vukolic, Ron Levy

This paper establishes tight bounds on the \emph{best-case} time-complexity of distributed atomic read/write storage implementations that tolerate \emph{worst-case} conditions. We study asynchronous robust implementations where a writer and a set of reader ...

2006

Modeling heterogeneous real-time components in BIP

Joseph Sifakis

We present a methodology for modeling heterogeneous real-time components. Components are obtained as the superposition of three layers: behavior, specified as a set of transitions; Interactions between transitions of the behavior; Priorities, used to choos ...

2006