By Topic

Dynamic adaptation of sharing granularity in DSM systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
A. Itzkovitz ; Dept. of Comput. Sci., New York Univ., NY, USA ; N. Niv ; A. Schuster

The tradeoff between false sharing elimination and aggregation in Distributed Shared Memory (DSM) systems has a major effect on their performance. Some studies in this area show that fine grain access is advantageous, while others advocate the use of large coherency units. One way to resolve the tradeoff is to dynamically adapt the granularity to the application memory access pattern. In this paper we propose a novel technique for implementing multiple sharing granularities over page based DSMs. We present protocols for efficient switching between small and large sharing units during runtime. We show that applications may benefit from adapting the memory sharing to the memory access pattern, using both coarse grain sharing and fine grain sharing interchangeably in different stages of the computation. Our experiments show a substantial improvement in the performance using adapted granularity level over using a fixed granularity level

Published in:

Parallel Processing, 1999. Proceedings. 1999 International Conference on

Date of Conference: