Open Access

Partitioning and Scheduling DSP Applications with Maximal Memory Access Hiding

EURASIP Journal on Advances in Signal Processing20022002:391670

https://doi.org/10.1155/S1110865702205041

Received: 2 September 2001

Published: 1 September 2002

Abstract

This paper presents an iteration space partitioning scheme to reduce the CPU idle time due to the long memory access latency. We take into consideration both the data accesses of intermediate and initial data. An algorithm is proposed to find the largest overlap for initial data to reduce the entire memory traffic. In order to efficiently hide the memory latency, another algorithm is developed to balance the ALU and memory schedules. The experiments on DSP benchmarks show that the algorithms significantly outperform the known existing methods.

Keywords

loop pipelining initial data maximal overlap balanced partition scheduling