Mapping DSP Applications onto Self-timed Multiprocessors

Abstract

Self-timed scheduling is an attractive implementation style for multiprocessor DSP systems due to its ability to exploit predictability in application behavior, its avoidance of over-constrained synchronization, and its simplified clocking requirements. However, analysis and optimization of self-timed systems under real-time constraints is challenging due to the complex, irregular dynamics of self-timed operation. This paper examines a number of intermediate representations for compiling dataflow programs onto self-timed DSP platforms, and discusses efficient techniques that operate on these representations to streamline scheduling, communication synthesis, and power management of self-timed implementations.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 2001
Accession Number
ADA456793

Entities

People

  • M. Khandelia
  • N. Bambha
  • S. S. Bhattacharyya
  • V. Kianzad

Organizations

  • University of Maryland

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Clustering
  • Coding
  • Computations
  • Computer Programming
  • Computers
  • Data Transmission
  • Embedded Systems
  • Engineering
  • Estimators
  • Gantt Charts
  • Genetic Algorithms
  • Multiprocessors
  • Scheduling (Production)
  • Simulations
  • Steady State
  • Universities

Fields of Study

  • Computer science
  • Engineering

Readers

  • Computational Linguistics
  • Distributed Systems and Data Platform Development
  • Integrated Circuit Design and Technology.