By Topic

Memory latency and thread migration challenges for distributed shared memory 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
$31 $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

2 Author(s)
Kavi, K.M. ; Alabama Univ., Huntsville, AL, USA ; Cohen, W.E.

Distributed shared memory systems have received considerable interest since the concept was originally proposed by Kai Li (1986). In such systems networks of workstations can be used to solve computationally intensive problems. Straightforward implementation of DSMs have suffered performance penalties. This has led to various relaxed memory consistency models that offer opportunities for optimizing performance of DSM systems. To further improve the performance and eliminate false sharing, various DSM systems have tried numerous ad hoc techniques (e.g. combining several messages into a single message, permitting multiple writers to the same page). In a majority of these systems, the DSMs have been implemented on top of an existing OS kernel. This in itself has limited the performance as well as flexibility. The authors propose a new multithreaded-architecture for tolerating memory latencies. They also present some challenges to DSM system for supporting the multithreaded programming model and how the new architectures can aid in this regard

Published in:

System Sciences, 1998., Proceedings of the Thirty-First Hawaii International Conference on  (Volume:7 )

Date of Conference:

6-9 Jan 1998