We propose an “Asymmetric Distributed Shared Memory: ADSM”, which provides users with an efficient shared memory model. The ADSM is a hybrid system that needs not only operating system support, but also compiler support. The ADSM executes a load instruction as the shared read with the assistance of virtual memory mechanism. As for the shared write, the ADSM executes a sequence of instructions for consistency management after the corresponding store instruction. We describe the algorithm to reduce overheads for consistency management. The algorithm coalesces a sequence of instructions for consistency management using the information of affine memory accesses. The coalescing algorithm is evaluated using the SPLASH-2 benchmark. The performance evaluation shows that the coalescing algorithm achieves an execution time improvement compared to the non optimized result, ranging from 76% to 85%
Published in:
Parallel Architectures, Algorithms, and Networks, 1997. (I-SPAN '97) Proceedings., Third International Symposium on
Date of Conference: 18-20 Dec 1997