DocumentCode
2091330
Title
Optimal synthesis of high performance architectures
Author
Gebotys, Catherine H. ; Elmasry, M.I.
Author_Institution
Dept. of Electr. & Comput. Eng., Waterloo Univ., Ont., Canada
fYear
1991
fDate
12-15 May 1991
Abstract
A formal 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 for industry by providing optimal schedules which minimize interconnect costs and interface to analog and asynchronous processes, since these are seen as key to synthesizing high-performance architectures. A partially structured tight IP formulation of the architectural synthesis problem provides globally optimal schedules for piecewise linear cost functions, using branch and bound, in execution times faster than previous research
Keywords
computer architecture; integer programming; asynchronous processes; branch and bound; buses; execution times; functional units; globally optimal architectures; integer programming; interconnect costs; piecewise linear cost functions; registers; Computer architecture; Cost function; Hardware; Job shop scheduling; Linear programming; Optimal scheduling; Piecewise linear techniques; Registers; Scheduling algorithm; Synthesizers;
fLanguage
English
Publisher
ieee
Conference_Titel
Custom Integrated Circuits Conference, 1991., Proceedings of the IEEE 1991
Conference_Location
San Diego, CA
Print_ISBN
0-7803-0015-7
Type
conf
DOI
10.1109/CICC.1991.164142
Filename
164142
Link To Document