Loop Scheduling with Complete Memory Latency Hiding on Multi-core Architecture

  • Authors:

  • Chun Xue;Zili Shao;Meilin Liu;Meikang Qiu;Edwin H. -M. Sha

  • Affiliations:

  • University of Texas at Dallas, USA;Hong Kong Polytechnic University, Hong Kong;University of Texas at Dallas, USA;University of Texas at Dallas, USA;University of Texas at Dallas, USA

  • Venue:
  • ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

The widening gap between processor and memory performance is the main bottleneck for modern computer systems to achieve high processor utilization. In this paper, we propose a new loop scheduling with memory management technique, Iterational Retiming with Partitioning (IRP), that can completely hide memory latencies for applications with multi-dimensional loops on architectures like CELL processor [1]. In IRP, the iteration space is first partitioned carefully. Then a two-part schedule, consisting of processor and memory parts, is produced such that the execution time of the memory part never exceeds the execution time of the processor part. These two parts are executed simultaneously and complete memory latency hiding is reached. Experiments on DSP benchmarks show that IRP consistently produces optimal solutions as well as significant improvement over previous techniques.