Exploiting Bandwidth to Reduce Average Memory Access Time in Scalable Multiprocessors.

Abstract

The overhead of remote memory accesses is a major impediment to achieving good application performance on scalable shared-memory multiprocessors. This dissertation explores ways in which to exploit network and memory bandwidth in order to reduce the average cost of memory accesses. We consider scenarios (1) where the remote access cost is dominated by contention, and (2) where the hardware provides abundant band- width and the remote access time is dominated by the unsaturated request/access/reply sequence of operations. We introduce and evaluate two techniques for increasing the effective bandwidth available to processors, software interleaving and eager combining. We also evaluate strategies for hiding the high cost of remote accesses, including several forms of prefetching and update-based coherence protocols. We use both analytic models and detailed simulations of multiprocessor systems to quantify the effectiveness of these techniques, and to provide insight into the potential and limitations of exploiting bandwidth to reduce average memory access cost.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1995
Accession Number
ADA300197

Entities

People

  • Ricardo Bianchini

Organizations

  • University of Rochester

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Access Time
  • Algorithms
  • Application Software
  • Bandwidth
  • Communication Systems
  • Computations
  • Computer Architecture
  • Computer Programming
  • Computer Programs
  • Computer Science
  • Computers
  • Linear Algebra
  • Operating Systems
  • Parallel Computing
  • Parallel Processing
  • Programming Languages
  • Simulators

Fields of Study

  • Computer science

Readers

  • Parallel and Distributed Computing.