A Heuristic Thread Assignment Scheme for the Distributed Shared Memory System

• Main Authors: Iuan-Long Wang, 王淵龍
• Other Authors: Ce-Kuen Shieh
• Format: Others
• Language: en_US
• Published: 1995
• Online Access: http://ndltd.ncl.edu.tw/handle/52325501123838057801

碩士 === 國立成功大學 === 電機工程研究所 === 83 === In this thesis, efforts are invested on the design and implementation of a heuristic thread assignment scheme on the distributed shared memory system. This scheme is mainly to cluster threads which have stronger data dependency into the same node according to the information collected on the pre-run time. Consequently, the data contention among nodes can be reduced significantly and the workload is evenly distributed all over the system. Basically, how to reduce the network traffic is a very crucial factor on designing a distributed shared memory system. If the Sequential Consistency is provided on the distributed shared memory system, the page thrashing effect would reduce the performance. On the other hand, the Release Consistency can relieves us from page thrashing due to the false sharing in a page, but it still suffer from the true sharing in a page. In this thesis, the thread assignment scheme can turn the inter- node communication into the intra-node communication via assigning threads which have stronger data dependency into the same node. And that will improve the performance significantly. We have implemented this thread assignment scheme on Cohesion, a distributed shared memory system which is built up on our laboratory. From the real testing on this platform, including SOR, matrix multiplication, etc., it is proved that the true sharing effect can be indeed decreased.