By Topic

A cost model for distributed shared memory using competitive update

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)
Jai-Hoon Kim ; Dept. of Comput. Sci., Texas A&M Univ., College Station, TX, USA ; Vaidya, N.F.

This paper presents a new “cost” analysis model for distributed shared memory (DSM) using a competitive update protocol. The cost metric of interest is the overhead of message passing necessary to implement DSM. This approach is based on segment model proposed previously (Kim et al., 1996, 1997). The input parameter for the cost analysis model is the probability density function of the number of remote updates in a segment. This distribution can quite accurately characterize many applications. The proposed model is validated by comparing analytical results obtained using the model to experimental results. The competitive update protocol for shared memory is defined using a parameter called the “update limit” (or threshold). Using the proposed model, we compute the optimal update limit for the competitive update protocol

Published in:

High-Performance Computing, 1997. Proceedings. Fourth International Conference on

Date of Conference:

18-21 Dec 1997