A Cost Model for Distributed Shared Memory Using Competitive Update

This paper presents a new "cost" analysis model for distributed shared memory (DSM) using competitive update protocol. The cost metric of interest here is the overhead of message passing necessary to implement DSM. This approach is based on segment model proposed previously [10, 11]. Input parameter for the cost analysis model proposed here 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 "update limit" (or threshold). Using the proposed model, we compute the optimal update limit for competitive update protocol. 1 Introduction Software distributed shared memory (DSM) systems have many advantages over message passing systems [12, 15]. Since DSM provides a user a simple shared memory abs..