Publication

Cooperative Shared Memory: Software and Hardware for Scalable Multiprocessors

Publications associées (62)

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

Software Transactional Memory on Relaxed Memory Models

Rachid Guerraoui, Vasu Singh

Pseudo-code descriptions of STMs assume sequentially consistent program execution and atomicity of high-level STM operations like read, write, and commit. These assumptions are often violated in realistic settings, as STM implementations run on relaxed mem ...

Springer2009

Why STM can be more than a Research Toy

Rachid Guerraoui, Vincent Gramoli, Aleksandar Dragojevic, Pascal Felber

Software Transactional Memory (STM) promises to simplify concurrent programming without requiring speciﬁc hardware support. Yet, STM’s credibility lies on the extent to which it can leverage multi-cores to outperform sequential code. A recent CACM paper [8 ...

2009

The Granularity of Soft-Error Containment in Shared-Memory Multiprocessors

Babak Falsafi

Concerns over rising soft-error rates in processor logic has led to numerous proposals for error tolerance mechanisms. In this paper, we examine the role of soft-error containment in a shared memory multiprocessor. We study a range of design alternatives b ...

2006

In situ micro gripper shaping by electro discharge machining

Reymond Clavel, Mélanie Dafflon, Cédric Joseph

A machining process based on Electro Discharge Machining (EDM) has been developed and allows producing flexible and low-cost tweezers-like grippers or grippers shaped for a specific application. It can be easily included in a micromanipulation setup and re ...

2006

Virtual Memory Window with Dynamic Prefetching Support

Paolo Ienne, Miljan Vuletic

Reconfigurable Systems-an-Chip (RSoCs) on the market consist of full -fledged processors and large Field -Programmable Gate Arrays (FPGAs). The latter can be used to implement the system glue logic, various peripherals, and application - specific coprocess ...

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

OpenMP for Networks of SMPs

Willy Zwaenepoel

In this paper, we present the first system that implement OpenMP on network of shared-memory multiprocessors. This system enables the program to rely on a single, standard, shared-memory API for parallelization within a multiprocessor and between multiproc ...

2000

Comparing the effectiveness of fine-grain memory caching against page migration/replication in reducing traffic in DSM clusters

Babak Falsafi

In this paper we compare and contrast two techniques to improve capacity/conflict miss traffic in CC-NUMA DSM clusters. Page migration/replication optimizes read-write accesses to a page used by a single processor by migrating the page to that processor an ...

2000

Combining Compile-Time and Run-Time Support for Efficient Distributed Shared Memory

Willy Zwaenepoel, Sandhya Dwarkadas

We describe an integrated compile-time and run-time system for efficient shared memory parallel computing on distributed memory machines. The combined system presents the user with a shared memory programming model, with its well-known benefits in terms of ...

1999

Parallelization of population-based evolutionary algorithms for combinatorial optimization problems

The objective of the present work is to make efficient parallelization of evolutionary algorithms (EA) easier in order to solve large instances of difficult combinatorial optimization problems within an acceptable amount of time, on parallel computer archi ...

EPFL1999