Resynchronization for multiprocessor DSP systems

被引:8
作者
Bhattacharyya, SS [1 ]
Sriram, S
Lee, EA
机构
[1] Univ Maryland, Dept Elect & Comp Engn, College Pk, MD 20742 USA
[2] Univ Maryland, Inst Adv Comp Studies, College Pk, MD 20742 USA
[3] Texas Instruments Inc, DSP R&D Res Ctr, Dallas, TX USA
[4] Univ Calif Berkeley, Dept Elect Engn & Comp Sci, Berkeley, CA 94720 USA
来源
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-FUNDAMENTAL THEORY AND APPLICATIONS | 2000年 / 47卷 / 11期
基金
美国国家科学基金会;
关键词
embedded multiprocessors; iterative dataflow graphs; latency; multiprocessor scheduling; pipelining; real-time signal processing; self-timed systems; set covering; shared memory; VLSI signal processing;
D O I
10.1109/81.895327
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper introduces a technique, called resynchronization, for reducing synchronization overhead in multiprocessor implementations of digital signal processing (DSP) systems. The technique applies to arbitrary collections of dedicated, programmable or configurable processors, such as combinations of programmable DSP's, ASICS, and FPGA subsystems. Thus, it is particularly well-suited to the evolving trend toward heterogeneous single-chip multiprocessors in DSP systems. Resynchronization exploits the well-known observation [43] that in a given multiprocessor implementation, certain synchronization operations may be redundant in the sense that their associated sequencing requirements are ensured by other synchronizations in the system. The goal of resynchronization is to introduce new synchronizations in such a way that the number of original synchronizations that become redundant exceeds the number of new synchronizations that are added, and thus, the net synchronization cost is reduced. Our study is based in the context of self-timed execution for iterative dataflow specifications of DSP applications. An iterative dataflow specification consists of a dataflow representation of the body of a loop that is to be iterated indefinitely; dataflow programming in this form has been employed extensively in the DSP domain.
引用
收藏
页码:1597 / 1609
页数:13
相关论文
共 13 条
[1]   MACRO PIPELINING BASED SCHEDULING ON HIGH-PERFORMANCE HETEROGENEOUS MULTIPROCESSOR SYSTEMS [J].
BANERJEE, S ;
HAMADA, T ;
CHAU, PM ;
FELLMAN, RD .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 1995, 43 (06) :1468-1484
[2]   THE SYNCHRONOUS APPROACH TO REACTIVE AND REAL-TIME SYSTEMS [J].
BENVENISTE, A ;
BERRY, G .
PROCEEDINGS OF THE IEEE, 1991, 79 (09) :1270-1282
[3]   STATIC SCHEDULING FOR SYNTHESIS OF DSP ALGORITHMS ON VARIOUS MODELS [J].
CHAO, LF ;
SHA, EHM .
JOURNAL OF VLSI SIGNAL PROCESSING, 1995, 10 (03) :207-223
[4]   OPTIMIZING THE CONTROL-UNIT THROUGH THE RESYNCHRONIZATION OF OPERATIONS [J].
FILO, D ;
KU, DC ;
DEMICHELI, G .
INTEGRATION-THE VLSI JOURNAL, 1992, 13 (03) :231-258
[5]   SYNTHESIS OF SYNCHRONOUS COMMUNICATION HARDWARE IN A MULTIPROCESSOR ARCHITECTURE [J].
HUISKEN, JA ;
DELARUELLE, A ;
EGBERTS, B ;
EECKHOUT, P ;
VANMEERBERGEN, J .
JOURNAL OF VLSI SIGNAL PROCESSING, 1993, 6 (03) :289-299
[6]   APPROXIMATION ALGORITHMS FOR COMBINATORIAL PROBLEMS [J].
JOHNSON, DS .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1974, 9 (03) :256-278
[7]   RELATIVE SCHEDULING UNDER TIMING CONSTRAINTS - ALGORITHMS FOR HIGH-LEVEL SYNTHESIS OF DIGITAL CIRCUITS [J].
KU, DC ;
DEMICHELI, G .
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1992, 11 (06) :696-718
[8]   RATIO OF OPTIMAL INTEGRAL AND FRACTIONAL COVERS [J].
LOVASZ, L .
DISCRETE MATHEMATICS, 1975, 13 (04) :383-390
[9]   OPTIMAL PARTITIONING OF RANDOM PROGRAMS ACROSS 2 PROCESSORS [J].
NICOL, DM .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1989, 15 (02) :134-141
[10]  
Teich J., 1995, Proceedings of the Eighth International Symposium on System Synthesis (IEEE Cat. No.95TH8050), P156, DOI 10.1109/ISSS.1995.520628