Publication

Software Transactional Memory on Relaxed Memory Models

Related publications (32)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

The Collective Memory of Amnesic Processes

Rachid Guerraoui, Bastian Pochon, James Pugh, Ron Levy

This paper considers the problem of robustly emulating a shared atomic memory over a distributed message passing system where processes can fail by crashing and possibly recover. We revisit the notion of atomicity in the crash-recovery context and introduc ...

2008

Mechanisms for store-wait-free multiprocessors

Anastasia Ailamaki, Babak Falsafi

Store misses cause significant delays in shared-memory multiprocessors because of limited store buffering and ordering constraints required for proper synchronization. Today, programmers must choose from a spectrum of memory consistency models that reduce ...

2007

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

Is SC+ILP=RC?

Babak Falsafi

Sequential consistency (SC) is the simplest programming interface for shared-memory systems but imposes program order among all memory operations, possibly precluding high performance implementations. Release consistency (RC), however, enables the highest ...

1999

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

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

Teapot: Language Support for Writing Memory Coherence Protocols

James Richard Larus

Recent shared-memory parallel computer systems offer the exciting possibility of customizing memory coherence protocols to fit an application's semantics and sharing patterns. Custom protocols have been used to achieve message-passing performance---while r ...

ACM1996

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

Cooperative Shared Memory: Software and Hardware for Scalable Multiprocessors

James Richard Larus, David Wood

We believe the paucity of massively parallel, shared-memory machines follows from the lack of a shared-memory programming performance model that can inform programmers of the cost of operations (so they can avoid expensive ones) and can tell hardware desig ...

ACM1993

Cooperative Shared Memory: Software and Hardware for Scalable Multiprocessors

James Richard Larus, David Wood

We believe the absence of massively-parallel, shared-memory machines follows from the lack of a shared-memory programming performance model that can inform programmers of the cost of operations (so they can avoid expensive ones) and can tell hardware desig ...

ACM1992