Algorithm selection: a quantitative computation-intensive optimization approach

Authors:
Miodrag Potkonjak;Jan Rabaey
Affiliations:
C&C Research Laboratories, NEC USA Princeton, NJ;Dept. of EECS, University of California at Berkeley, Berkeley, CA
Venue:
ICCAD '94 Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design
Year:
1994

Citing 8
Cited 5

Parallel and distributed computation: numerical methods

Parallel and distributed computation: numerical methods
A scheduling and resource allocation algorithm for hierarchical signal flow graphs

DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
Discrete cosine transform: algorithms, advantages, applications

Discrete cosine transform: algorithms, advantages, applications
Program Implementation Schemes for Hardware-Software Systems

Computer
Synthesis fo the hardware/software interface in microcontroller-based systems

ICCAD '92 Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design
Fast Algorithms for Digital Signal Processing

Fast Algorithms for Digital Signal Processing
Fast Prototyping of Datapath-Intensive Architectures

IEEE Design & Test
A Hardware-Software Codesign Methodology for DSP Applications

IEEE Design & Test

Optimal ILP-based approach for throughput optimization using simultaneous algorithm/architecture matching and retiming

DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
High-level synthesis techniques for reducing the activity of functional units

ISLPED '95 Proceedings of the 1995 international symposium on Low power design
Cost optimization in ASIC implementation of periodic hard-real time systems using behavioral synthesis techniques

ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
A methodology and algorithms for the design of hard real-time multitasking ASICs

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Exploration with upgradeable models using statistical methods for physical model emulation

Proceedings of the 50th Annual Design Automation Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a set of specifications for a targeted application, algorithm selection refers to choosing the most suitable algorithm for a given goal, among several functionally equivalent algorithms. We demonstrate an extraordinary potential of algorithm selection for achieving high throughput, low cost, and low power implementations.We introduce an efficient technique for low-bound evaluation of the throughput and cost during algorithm selection and propose a relaxation-based heuristic for throughput optimization. We also present an algorithm for cost optimization using algorithm selection. The effectiveness of methodology and algorithms is illustrated using examples.