| Asymmetric Distributed Shared Memory (2007) | |||||||||||||||
Abstract | |||||||||||||||
| We have proposed an "Asymmetric Distributed Shared Memory: ADSM", that provides users with efficient shared memory model. The ADSM is a hybrid system that needs not only the operating system support but also the 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 the execution time improvement compared to the not-optimized result, ranging from 76 % to 85 %. | |||||||||||||||
Publication details | |||||||||||||||
| |||||||||||||||