Dynamic home node reallocation on software distributed shared memory
Hiroshi Harada, Yutaka Ishikawa, Atsushi Hori, Hiroshi Tezuka, Shinji Sumimoto, Toshiyuki Takahashi · 2000
This paper proposes a dynamic home node reallocation mechanism in a sofware distributed system memory system to reduce the communication overhead at the memory barrier synchronization point. The mechanism has been implemented in a software distributed memory system called SCASH. The evaluation results using the LU application of SPLASH2 running on a PC cluster show that the execution performance using the mechanism is better than using static home node allocation mechanisms including an optimal case of up to 8 node execution.