Weighted Competitive Update Protocol for DSM Systems


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 6, No. 8, pp. 2245-2252, Aug. 1999
10.3745/KIPSTE.1999.6.8.2245,   PDF Download:

Abstract

Since DSM provides a user a simple shared memory abstraction, the user does not have to be concerned with data movement between hosts. Each node in DSM systems has processor, memory, and connection to a network. Memory is divided into pages, and a page can have multiple copies in different nodes. To maintain data consistency between nodes, two conventional protocols are used: write-update protocol and invalidate protocol. The performance of these protocols depends on the system parameters and the memory access patterns. For adapting to memory access patterns, competitive update protocol updates those copies of a page that are expected to be used in the near future, while selectively invalidating other copies. We present weighted competitive update protocols that consider different communication bandwidth for each connection of two nodes. Test results by simulation show that the weighted competitive update protocol improves performance.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
L. S. Hwa, B. S. Hyun, K. J. Hoon, K. S. Soo, "Weighted Competitive Update Protocol for DSM Systems," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 6, no. 8, pp. 2245-2252, 1999. DOI: 10.3745/KIPSTE.1999.6.8.2245.

[ACM Style]
Lim Sung Hwa, Baek Sang Hyun, Kim Jai Hoon, and Kim Sung Soo. 1999. Weighted Competitive Update Protocol for DSM Systems. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 6, 8, (1999), 2245-2252. DOI: 10.3745/KIPSTE.1999.6.8.2245.