By Topic

About the Efficiency of Partial Replication to Implement Distributed Shared Memory

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Helary, J.-M. ; IRISA Campus de Beaulieu, Rennes ; Milani, A.

Distributed shared memory abstraction (DSM) is traditionally realized through a distributed memory consistency system (MCS) on top of a message passing system. In this paper we analyze the impossibility of efficient partial replication implementation of causally consistent DSM. Efficiency is discussed in terms of control information that processes have to propagate to maintain consistency. We introduce the notions of share graph and hoop to model variable distribution and the concept of dependency chain to characterize processes that have to manage information about a variable even though they do not read or write that variable. Then, we consider PRAM, a consistency criterion weaker enough to allow efficient partial replication implementations and strong enough to solve interesting problems. Finally, we illustrate the power of PRAM with the Bellman-Ford shortest path algorithm

Published in:

Parallel Processing, 2006. ICPP 2006. International Conference on

Date of Conference:

14-18 Aug. 2006