By Topic

A latency-hiding scheme for multiprocessors with buffered multistage networks

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

1 Author(s)
Stenstrom, P. ; Dept. of Comput. Eng., Lund Univ., Sweden

Multistage networks for large-scale shared-memory multiprocessors are buffered to increase the throughput and hide the latency. This is achieved by pipelining consecutive memory requests from the same processor. However, unrestrictive pipelining may violate strict memory consistency models such as sequential consistency since memory requests are not guaranteed to be performed in program order. The author proposes and evaluates a novel access ordering scheme that allows the processors to pipeline memory requests under the sequential consistency model. This is achieved by access ordering mechanisms at memory that detect when a request arrives out of order. Simulations show that the scheme manages to improve the processor utilization significantly by hiding network latency through pipelining

Published in:

Parallel Processing Symposium, 1992. Proceedings., Sixth International

Date of Conference:

23-26 Mar 1992