Memory Access Dependencies in Shared-Memory Multiprocessors
IEEE Transactions on Software Engineering
Lazy release consistency for software distributed shared memory
ISCA '92 Proceedings of the 19th annual international symposium on Computer architecture
Techniques for reducing consistency-related communication in distributed shared-memory systems
ACM Transactions on Computer Systems (TOCS)
Special issue on distributed shared memory systems: guest editors' introduction
Journal of Parallel and Distributed Computing - Special issue on distributed shared memory systems
Weak ordering—a new definition
ISCA '90 Proceedings of the 17th annual international symposium on Computer Architecture
Memory consistency and event ordering in scalable shared-memory multiprocessors
ISCA '90 Proceedings of the 17th annual international symposium on Computer Architecture
HPCA '96 Proceedings of the 2nd IEEE Symposium on High-Performance Computer Architecture
SPLASH: Stanford parallel applications for shared-memory
SPLASH: Stanford parallel applications for shared-memory
Hi-index | 0.00 |
Distributed shared memory allows processes to view the physically distributed memory as a globally shared virtual memory. Lazy release consistency (LRC), among known techniques, is an efficient software model proposed for distributed shared memory. It relies heavily on lock synchronization to maintain data coherency. The lock scheme used in LRC, however, conducts many interrupt invocations on the remote processors, which in turn steal effective cpu cycles from remote processors, thus prolonging the lock acquisition time and the total elapsed time of application programs. In this paper, a lock improvement technique is proposed to alleviate interrupt invocations caused by the lock acquire operations, leading to reduction in the lock acquisition time and the overall program execution time. Our improvement technique was evaluated under the TreadMarks' framework using four applications, where TreadMarks is a distributed shared memory system based on LRC. The experimental results indicate that our technique improves the lock acquisition time over TreadMarks on a network of workstations by more than 14% for one application.