Distributed Shared Memory Scheme for Multi-thread programming


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 3, No. 4, pp. 791-802, Jul. 1996
10.3745/KIPSTE.1996.3.4.791,   PDF Download:

Abstract

In this paper, we discuss a distributed shared memory management scheme based on multi-threaded programming model for a large-scale loosely coupled multiproccesor system. The scheme covers three major issues in the distributed shared memory; the address translation table management, the block coherence maintenance, and the block placement policy. The scheme efficiently resolves the general problems occurred in the distributed shared memory such as a false sharing, an unnecessary replication, a block bouncing, and an address aliasing phenomenon. It also provides the application transparency, good scalability, easy implementation, and multithreaded programming model to users.


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]
S. D. Wha, "Distributed Shared Memory Scheme for Multi-thread programming," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 3, no. 4, pp. 791-802, 1996. DOI: 10.3745/KIPSTE.1996.3.4.791.

[ACM Style]
Seo Dae Wha. 1996. Distributed Shared Memory Scheme for Multi-thread programming. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 3, 4, (1996), 791-802. DOI: 10.3745/KIPSTE.1996.3.4.791.