ParADE: An OpenMP Programming Environment for SMP Cluster Systems
Proceedings of the 2003 ACM/IEEE conference on Supercomputing
A Dynamic Lock Protocol for Scope-Consistency sDSM Systems
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
Lazy home-based protocol for a software distributed shared memory system
International Journal of High Performance Computing and Networking
Design and implementation of an agent home scheme strategy for prefetch-based DSM systems
International Journal of Parallel Programming
A novel data grid coherence protocol using pipeline-based aggressive copy method
GPC'07 Proceedings of the 2nd international conference on Advances in grid and pervasive computing
A cost-intelligent application-specific data layout scheme for parallel file systems
Proceedings of the 20th international symposium on High performance distributed computing
Lazy home-based protocol: combining homeless and home-based distributed shared memory protocols
HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications
Reducing communication overhead and page faults in SDSM platforms
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
Enhancing data replication with greedy pipeline-based aggressive copy protocol in data grids
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
Hi-index | 0.01 |
Home-based Lazy Release Consistency (HLRC) shows poor performance on lock based applications because of two reasons: (1) a whole page is fetched on a page fault while actual modification is much smaller, and (2) a home is at the fixed location while access pattern is migratory. In this paper we present an efficient lock protocol for HLRC. In this protocol, the pages that are expected to be used by acquirer are selectively updated using diffs. The diff accumulation problem is minimized by limiting the size of diffs to be sent for each page. Our protocol reduces the number of page faults inside critical sections because pages can be updated by applying locally stored diffs. This reduction yields the reduction of average lock waiting time and the reduction of message amount. The experiment with five applications shows that our protocol archives 2% - 40% speedup against base HLRC for four applications.