2002 · 251 citations · 19 references
EngineeringComputer EngineeringComputer ScienceComputer ArchitectureSimulation-based DesignSystems ArchitectureDataflow ModelingPerformance ModelingCoarse-grainingDataflow ArchitecturesDataflow GraphsDataflow MappingMicroarchitectural SimulationObject-oriented ArchitectureSimulation-based Performance Analysis
Video‑signal‑processing algorithms are mapped onto weakly‑programmable, coarse‑grain dataflow architectures. The paper proposes a quantitative analysis approach for application‑specific dataflow architectures. We present a quantitative analysis approach that models these algorithms as Kahn graphs, implements a clock‑cycle‑accurate, multi‑threaded simulation environment for coarse‑grain dataflow architectures, and enables designers to evaluate performance metrics and compare alternative designs. The simulator is configurable, efficient, and demonstrates that multiple dataflow architecture alternatives can be evaluated quickly on a modern workstation, enabling designers to rate and select better performing designs.
In this paper we present an approach for quantitative analysis of application-specific dataflow architectures. The approach allows the designer to rate design alternatives in a quantitative way and therefore supports him in the design process to find better performing architectures. The context of our work is video signal processing algorithms which are mapped onto weakly-programmable, coarse-grain dataflow architectures. The algorithms are represented as Kahn graphs with the functionality of the nodes being coarse-grain functions. We have implemented an architecture simulation environment that permits the definition of dataflow architectures as a composition of architecture elements, such as functional units, buffer elements and communication structures. The abstract, clock-cycle accurate simulator has been built using a multi-threading package and employs object oriented principles. This results in a configurable and efficient simulator. Algorithms can subsequently be executed on the architecture model producing quantitative information for selected performance metrics. Results are presented for the simulation of a realistic application on several dataflow architecture alternatives, showing that many different architectures can be simulated in modest time on a modern workstation.
19
The Semantics of a Simple Language for Parallel Programming.
Gilles Kahn · IFIP Congress · 1974 · 2.1K citations
Edward A. Lee, T.M. Parks · Proceedings of the IEEE · 1995 · 928 citations
Bounded scheduling of process networks
T.M. Parks · 1996 · 249 citations
B. Agrawal, K. Shenoi · IRE Transactions on Communications Systems · 1983 · 131 citations
Ultra-low-power domain-specific multimedia processors
A. Abnous, Jan M. Rabaey · 2002 · 118 citations