Concept

Transactional memory

Publications associées (111)

Address partitioning in DSM clusters with parallel coherence controllers

Recent research suggests that DSM clusters can benefit from parallel coherence controllers. Parallel controllers requires address partitioning and synchronization to avoid handling multiple coherence events for the same memory address simultaneously. This ...

2000

Parallel Dispatch Queue: a queue-based programming abstraction to parallelize fine-grain communication protocols

Babak Falsafi, David Wood

This paper proposes a novel queue-based programming abstraction, Parallel Dispatch Queue (PDQ), that enables efficient parallel execution of fine-grain software communication protocols. Parallel systems often use fine-grain software handlers to integrate a ...

1999

Sirocco: cost-effective fine-grain distributed shared memory

Babak Falsafi, James Richard Larus, David Wood

Software fine-grain distributed shared memory (FGDSM) provides a simplified shared-memory programming interface with minimal or no hardware support. Originally software FGDSMs targeted uniprocessor-node parallel machines. This paper presents Sirocco, a fam ...

1998

OpenMP on Networks of Workstations

Willy Zwaenepoel

We describe an implementation of a sizable subset of OpenMP on networks of workstations (NOWs). By extending the availability of OpenMP to NOWs, we overcome one of its primary drawbacks compared to MPI, namely lack of portability to environments other than ...

1998

Transaction Reordering in Replicated Databases

Rachid Guerraoui, André Schiper, Fernando Pedone

Transaction Reordering in Replicated Databases F.Pedone, R.Guerraoui and A.Schiper This paper presents a fault-tolerant lazy replication protocol that ensures 1-copy serializability at a relatively low cost. Unlike eager replication approaches, our protoco ...

1997

Transaction Reordering in Replicated Databases

Rachid Guerraoui, André Schiper, Fernando Pedone

1997

Efficient Support for Irregular Applications on Distributed-Memory Machines

James Richard Larus

Irregular computation problems underlie many important scientific applications. Although these problems are computationally expensive, and so would seem appropriate for parallel machines, their irregular and unpredictable run-time behavior makes this type ...

ACM1995

From Causal Consistency to Sequential Consistency in Shared Memory Systems

André Schiper

Sequential consistency and causal consistency constitute two of the main consistency criteria used to define the semantics of accesses in the shared memory model. An execution is sequentially consistent if all processes can agree on a same legal sequential ...

Springer-Verlag1995

Fine-grain access control for distributed shared memory

Babak Falsafi, James Richard Larus, David Wood

The paper discusses implementations of fine-grain memory access control, which selectively restricts reads and writes to cache-block-sized memory regions. Fine-grain access control forms the basis of efficient cache- coherent shared memory. The paper focus ...

1994

Parallelization of General Linkage Analysis Problems

Willy Zwaenepoel, Sandhya Dwarkadas

We describe a parallel implementation of a genetic linkage analysis program that achieves good speedups, even for analyses on a single pedigree and with a single starting recombination fraction vector. Our parallel implementation has been run on three diff ...

1994

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