Publication

The Wisconsin Wind Tunnel: Virtual Prototyping of Parallel Computers

Publications associées (95)

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 Weakest Failure Detectors to Boost Obstruction-Freedom

Rachid Guerraoui, Michal Kapalka

This paper determines necessary and sufficient conditions to implement wait-free and non-blocking contention managers in a shared memory system. The necessary conditions hold even when universal objects (like compare-and-swap) or random oracles are availab ...

2006

The Weakest Failure Detectors to Boost Obstruction-Freedom

Rachid Guerraoui, Michal Kapalka

2006

Store-Ordered Streaming of Shared Memory

Anastasia Ailamaki, Babak Falsafi

Coherence misses in shared-memory multiprocessors account for a substantial fraction of execution time in many important scientific and commercial workloads. Memory streaming provides a promising solution to the coherence miss bottleneck because it improve ...

2005

Temporal Streaming of Shared Memory

Anastasia Ailamaki, Babak Falsafi

Coherent read misses in shared-memory multiprocessors account for a substantial fraction of execution time in many important scientific and commercial workloads. We propose Temporal Streaming, to eliminate coherent read misses by streaming data to a proces ...

2005

Reducing Memory Fragmentation with Performance-optimized Dynamic Memory Allocators in Network Applications

David Atienza Alonso

The needs for run-time data storage in modern wired and wireless network applications are increasing. Additionally, the nature of these applications is very dynamic, resulting in heavy reliance to dynamic memory allocation. The most significant problem in ...

Elsevier2005

What Can Be Implemented Anonymously?

Rachid Guerraoui, Eric Ruppert

Abstract. The vast majority of papers on distributed computing assume that processes are assigned unique identifiers before computation begins. But is this assumption necessary? What if processes do not have unique identifiers or do not wish to divulge the ...

2005

Causeway: Support for Controlling and Analyzing the Execution of Web-Accessible Applications

Willy Zwaenepoel

Causeway provides runtime support for the development of distributed meta-applications. These meta-applications control or analyze the behavior of multi-tier distributed applications such as multi-tier web sites or web services. Examples of meta-applicatio ...

2005

What Can Be Implemented Anonymously?

Rachid Guerraoui, Eric Ruppert

The vast majority of papers on distributed computing assume that processes are assigned unique identifiers before computation begins. But is this assumption necessary? What if processes do not have unique identifiers or do not wish to divulge them for reas ...

2004

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 parallel implementation of NEC for the analysis of large structures

Marcos Rubinstein, Abraham Rubinstein

We present a new, parallel version of the numerical electromagnetics code (NEC). The parallelization is based on a bidimensional block-cyclic distribution of matrices on a rectangular processor grid, assuring a theoretically optimal load balance among the ...

2003