Reducing communication overhead and page faults in SDSM platforms

Authors:
Artemis A. Christopoulou;Eleftherios D. Polychronopoulos
Affiliations:
High Performance Information Systems Laboratory, Computer Engineering & Informatics Department, University of Patras, Rio, Greece;High Performance Information Systems Laboratory, Computer Engineering & Informatics Department, University of Patras, Rio, Greece
Venue:
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
Year:
2006

Citing 5
Cited 0

Scope consistency: a bridge between release consistency and entry consistency

Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Optimizing Home-Based Software DSM Protocols

Cluster Computing
The Affinity Entry Consistency Protocol

ICPP '97 Proceedings of the international Conference on Parallel Processing
An Efficient Lock Protocol for Home-Based Lazy Release Consistency

CCGRID '01 Proceedings of the 1st International Symposium on Cluster Computing and the Grid
A practical transparent data sharing service for the grid

CCGRID '05 Proceedings of the Fifth IEEE International Symposium on Cluster Computing and the Grid (CCGrid'05) - Volume 2 - Volume 02

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a new dynamic, cache coherence protocol for Software Distributed Shared Memory (SDSM) systems that adopt the scope-consistency model[7]. We initially outline our basic protocol, called Reduced Message Protocol (RMP), and then propose two enhancements: the Multiple Home RMP (RMP-MH) and the Lock Migration RMP (RMP-LM). The experimentation we conducted with the proposed protocols, exhibits significant improvements by reducing two of the major latency factors in SDSM platforms: the total communication messages and the overall number of page faults. To demonstrate the efficiency and the effectiveness of the RMP protocols, we used SPLASH as well as synthetic application benchmarks.