"Loop Scheduling and Partitions for Hiding Memory Latencies"

(by F. Chen, and E. H.-M. Sha) in Proceedings of the IEEE 12th International Symposium on System Synthesis, San Jose, CA, November, 1999, pp. 64-70.

 

ABSTRACT

  Partition Scheduling with Prefetching (PSP) is a memory latency hiding technique which combines the loop pipelining technique with data prefetching. In PSP, the iteration space is first divided into regular partitions. Then two parts of the schedule, the ALU part and the memory part, are produced and balanced to produce an overall schedule with high throughput. These two parts are executed simultaneously, and hence the remote memory latency are overlapped. We study the optimal partition shape and size so that a well balanced overall schedule can be obtained. Experiments on DSP benchmarks show that the proposed methodology consistently produces optimal or near optimal solutions.

 

[ Published listings ] [ Top ]