Optimization of VLSI allocation

Author

He, Zhongli ; Zhou, Dian

Author_Institution

Dept. of Electr. & Electron. Eng., Hong Kong Univ. of Sci. & Technol., Kowloon, Hong Kong

Volume

2

fYear

1995

fDate

30 Apr-3 May 1995

Firstpage

1065

Abstract

Allocation is one of main tasks in the high level synthesis. It includes module selection, functional unit allocation, storage allocation and interconnection allocation. In this paper, we model the allocation problem as cluster analysis and apply a new algorithm, neighbor state transition (NST) algorithm, for cluster optimization. It is proved that the algorithm produces an asymptotically global optimal solution with the upper bound on the cost function (1+0(1/n)^2-ε)F*, where F* is the cost of the optimum solution, n is the problem size and ε is a positive parameter arbitrarily close to zero. The numerical examples show that the NST algorithm produces better results compared to the other known methods

Keywords

VLSI; circuit optimisation; high level synthesis; integrated circuit design; integrated circuit interconnections; logic partitioning; state assignment; VLSI allocation; asymptotically global optimal solution; cluster analysis; cluster optimization; cost function; functional unit allocation; high level synthesis; interconnection allocation; module selection; neighbor state transition; problem size; storage allocation; upper bound; Algorithm design and analysis; Clustering algorithms; Cost function; Hardware; Helium; Optimization methods; Upper bound; Very large scale integration;

fLanguage

English

Publisher

ieee

Conference_Titel

Circuits and Systems, 1995. ISCAS '95., 1995 IEEE International Symposium on

Conference_Location

Seattle, WA

Print_ISBN

0-7803-2570-2

Type

conf

DOI

10.1109/ISCAS.1995.520330

Filename

520330