Adaptive migratory scheme for distributed shared memory

Jai Hoon Kim, Nitin H. Vaidya

Research output: Contribution to conferencePaper

Abstract

This paper presents an adaptive migratory scheme for software Distributed Shared Memory (DSM). The proposed DSM system allows each node to independently choose one of the following three protocols: migratory, invalidate, and competitive update. In software DSM systems the migratory protocol is not necessarily optimal for a migratory access pattern. We define some conditions under which the migratory protocol is to be preferred over other candidate protocols. In our scheme, each node independently and continuously collects statistics that are used to determine the protocol to be used for each local copy of a page. Different nodes may select different protocols for the same page, based on their local view of the memory access patterns. The proposed scheme is an improvement over our previous adaptive scheme [9] that allowed only invalidate and competitive update protocols. The proposed scheme is implemented on a workstation cluster. Experimental results show that the new scheme is able to improve performance by choosing migratory protocol when appropriate.

Original languageEnglish (US)
Pages325-332
Number of pages8
DOIs
StatePublished - 1997
EventProceedings of the 1997 International Conference on Supercomputing - Vienna, Austria
Duration: Jul 7 1997Jul 11 1997

Other

OtherProceedings of the 1997 International Conference on Supercomputing
CityVienna, Austria
Period7/7/977/11/97

ASJC Scopus subject areas

  • Computer Science(all)

Fingerprint Dive into the research topics of 'Adaptive migratory scheme for distributed shared memory'. Together they form a unique fingerprint.

  • Cite this

    Kim, J. H., & Vaidya, N. H. (1997). Adaptive migratory scheme for distributed shared memory. 325-332. Paper presented at Proceedings of the 1997 International Conference on Supercomputing, Vienna, Austria, . https://doi.org/10.1145/263580.263659