Optimizing for parallelism and data locality

  • Authors:
  • Ken Kennedy;Kathryn S. McKinley

  • Affiliations:
  • -;-

  • Venue:
  • ICS '92 Proceedings of the 6th international conference on Supercomputing
  • Year:
  • 1992

Quantified Score

Hi-index 0.00

Visualization

Abstract

Previous research has used program transformation to introduce parallelism and to exploit data locality. Unfortunately, these two objectives have usually been considered independently. This work explores the trade-offs between effectively utilizing parallelism and memory hierarchy on shared-memory multiprocessors. We present a simple, but surprisingly accurate, memory model to determine cache line reuse from both multiple accesses to the same memory location and from consecutive memory access. The model is used in memory optimizing and loop parallelization algorithms that effectively exploit data locality and parallelism in concert. We demonstrate the efficacy of this approach with very encouraging experimental results.