An algorithm for partitioning of application specific systems

Author

Peng, Zebo ; Kuchcinski, Krzysztof

Author_Institution

Dept. of Comput. & Inf. Sci., Linkoping Univ., Sweden

fYear

1993

fDate

22-25 Feb 1993

Firstpage

316

Lastpage

321

Abstract

A simulated-annealing based algorithm to partition an application specific system into a set of modules is presented. The role of partitioning is to discover the structure implicit in the functional specification of the system so as to guide high level synthesis decisions in a design environment for digital systems consisting of hardware parts and possibly software components. The partitioning algorithm can also be used to partition the final or intermediate results of a high-level synthesis process into several physical blocks. Experimental results show that the approach produces better register-transfer designs with less global communications

Keywords

Petri nets; circuit optimisation; data flow graphs; high level synthesis; logic partitioning; simulated annealing; Petri net; application specific systems; functional specification; high level synthesis decisions; partitioning algorithm; register-transfer designs; set of modules; simulated-annealing based algorithm; Algorithm design and analysis; Application software; Clustering algorithms; Design methodology; Hardware; High level synthesis; Logic design; Partitioning algorithms; Silicon; Software design;

fLanguage

English

Publisher

ieee

Conference_Titel

Design Automation, 1993, with the European Event in ASIC Design. Proceedings. [4th] European Conference on

Conference_Location

Paris

Print_ISBN

0-8186-3410-3

Type

conf

DOI

10.1109/EDAC.1993.386456

Filename

386456