Academic Journals Database
Disseminating quality controlled scientific knowledge

Partitioning and Scheduling DSP Applications with Maximal Memory Access Hiding

ADD TO MY LIST
 
Author(s): Wang Zhong | Sha Edwin Hsing-Mean | Wang Yuke

Journal: EURASIP Journal on Advances in Signal Processing
ISSN 1687-6172

Volume: 2002;
Issue: 9;
Start page: 391670;
Date: 2002;
Original page

Keywords: loop pipelining | initial data | maximal overlap | balanced partition scheduling

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.
Affiliate Program      Why do you need a reservation system?