Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
ROBUST SIMULATION OF SHARED MEMORY: 20 YEARS AFTER
 

Summary: ROBUST SIMULATION OF SHARED MEMORY:
20 YEARS AFTER
Hagit Attiya
Department of Computer Science, Technion
and School of Computer and Communication Sciences, EPFL
Abstract
The article explores the concept of simulating the abstraction of a shared
memory in message passing systems, despite the existence of failures. This
abstraction provides an atomic register accessed with read and write opera-
tions. This article describes the Attiya, Bar-Noy and Dolev simulation, its
origins and generalizations, as well as its applications in theory and practice.
Dedicated to the 60th
birthday of Danny Dolev
1 Introduction
In the summer of 1989, I spent a week in the bay area, visiting Danny Dolev,
who was at IBM Almaden at that time, and Amotz Bar-Noy, who was a post-
doc at Stanford, before going to PODC in Edmonton.1
Danny and Amotz have
already done some work on equivalence between shared memory and message-
passing communication primitives [14]. Their goal was to port specific renaming

  

Source: Attiya, Hagit - Department of Computer Science, Technion, Israel Institute of Technology

 

Collections: Computer Technologies and Information Sciences