Optimal synthesis of high-performance architectures

Abstract

An integer programming (IP) model, which simultaneously schedules and allocates functional units, registers, and buses, is presented for synthesizing cost-constrained globally optimal architectures. This research is important to industry because it provides optimal schedules that minimize interconnect costs and interface to analog and asynchronous processes, since these are seen as key to synthesizing high-performance architectures. A mathematical IP model of the architectural synthesis problem is formulated. A subset of the constraints is transformed into the node-packing problem and integral facets are extracted and generalized. Other constraints are tightened or mapped into the knapsack problem and facets are extracted and generalized. Area-delay cost functions are minimized using branch and bound on the resulting IP model. Globally optimal architectures are synthesized in faster CPU times than in previous research.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>