A component selection algorithm for high-performance pipelines

The use of a realistic component library with multiple implementations of operators, results in cost efcient designs; slow components can then be used on non-critical paths and the more expensive components on only the critical paths. This paper presents a cost-optimized algorithm for selecting components and pipelining a data ow graph, given a multipleimplementation library, and throughput and latency constraints. Experiments on a few benchmarks indicate that our algorithm gives results that are within 0.7% of the optimal result.

• Type: Conference
• Year: 1994
• Where: EURODAC
• Authors: Smita Bakshi, Daniel D. Gajski
• Keywords: Data Ow Graph, Ef Cient Designs, EURODAC 1994, Realistic Component Library, VHDL