Parallel and Distributed Processing Symposium, International (2004)
Santa Fe, New Mexico
Apr. 26, 2004 to Apr. 30, 2004
Zili Shao , University of Texas at Dallas
Qingfeng Zhuge , University of Texas at Dallas
Yi He , University of Texas at Dallas
Chun Xue , University of Texas at Dallas
Meilin Liu , University of Texas at Dallas
Edwin H.-M. Sha , University of Texas at Dallas
In high level synthesis for real-time digital signal processing (DSP) architectures using heterogeneous functional units (FUs), an important problem is how to assign a proper FU type to each operation of a DSP application and generate a schedule in such a way that all requirements can be met and the total cost can be minimized. In this paper, we propose a two-phase approach to solve this problem. In the first phase, we solve heterogeneous assignment problem, i.e., how to assign a proper FU type to a DSP application such that the total cost can be minimized while the timing constraint is satisfied. In the second phase, based on the assignments obtained from the first phase, we propose a minimum resource scheduling algorithm to generate a schedule and a feasible configuration that uses as little resource as possible. We prove heterogeneous assignment problem is NP-complete and propose several algorithms to solve it. The experiments show that Algorithm DFG_Assign_Repeat is the best that gives a reduction of 25.7% on total cost compared with the previous work.
M. Liu, Q. Zhuge, Z. Shao, E. H. Sha, C. Xue and Y. He, "Assignment and Scheduling of Real-time DSP Applications for Heterogeneous Functional Units," Parallel and Distributed Processing Symposium, International(IPDPS), Santa Fe, New Mexico, 2004, pp. 60b.