Intermediate Representations for Design Automation of Multiprocessor DSP Systems

被引:0
作者
Neal Bambha
Vida Kianzad
Mukul Khandelia
Shuvra S. Bhattacharyya
机构
[1] University of Maryland,Department of Electrical and Computer Engineering, and Institute for Advanced Computer Studies
来源
Design Automation for Embedded Systems | 2002年 / 7卷
关键词
Dataflow graphs; embedded systems; digital signal processing; interprocessor communication; self-timed scheduling;
D O I
暂无
中图分类号
学科分类号
摘要
Self-timed scheduling is an attractive implementation style for multiprocessor DSP systems due to its ability to exploit predictability in application behavior, its avoidanceof over-constrained synchronization, and its simplified clocking requirements.However, analysis and optimization of self-timed systems under real-time constraintsis challenging due to the complex, irregular dynamics of self-timed operation.In this paper, we review a number of high-level intermediate representationsfor compiling dataflow programs onto self-timed DSP platforms, including representationsfor modeling the placement of interprocessor communication (IPC) operations;separating synchronization from data transfer during IPC; modeling and optimizinglinear orderings of communication operations; performing accurate design spaceexploration under communication resource contention; and exploring alternativeprocessor assignments during the synthesis process. We review the structureof these representations, and discuss efficient techniques that operate onthem to streamline scheduling, communication synthesis, and power managementof multiprocessor DSP implementations.
引用
收藏
页码:307 / 323
页数:16
相关论文
共 16 条
  • [1] Back T.(1997)Evolutionary Computation: Comments on the History and Current State IEEE Transactions on Evolutionary Computation 1 3-17
  • [2] Hammel U.(1999)Scheduling Multiprocessor Tasks with Genetic Algorithms IEEE Transactions on Parallel and Distributed Systems 0 825-837
  • [3] Schwefel H.-P.(1998)Faster Maximum and Minimum Mean Cycle Algorithms for System-Performance Analysis IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 17 889-899
  • [4] Correa R. C.(1999)A Clustering Approach to Explore Grain-Sizes in the Definition of Processing Elements in Dataflow Architectures Journal of VLSI Signal Processing 22 9-20
  • [5] Ferreira A.(1980)Reducing the Size of the Nondominated Set: Pruning by Clustering Computers and Operations Research 7 55-66
  • [6] Rebreyend P.(1968)Scheduling Parallel Computations Journal of the Association for Computing Machinery 15 590-599
  • [7] Dasdan A.(1994)DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors IEEE Transactions on Parallel and Distributed Systems 5 951-967
  • [8] Gupta R. K.(undefined)undefined undefined undefined undefined-undefined
  • [9] Lieverse P.(undefined)undefined undefined undefined undefined-undefined
  • [10] Deprettere E. F.(undefined)undefined undefined undefined undefined-undefined