Clique partitioning based integrated architecture synthesis for VLSI chips

  • Jer Min Jou
  • , Shiann Rong Kuang
  • , Ren Der Chen

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations

Abstract

The tasks as module selection, scheduling and allocation involved in the architecture synthesis problem of VLSI chips are tightly interdependent. Simultaneous optimization of these tasks is necessary for the global solution of a design. In this paper, we present a new graph model for the integrated architecture synthesis problem of VLSI chips and then formulate the problem as a partial clique partition problem and solve it globally using a heuristic. We have tested our approach using examples from the literature and experimental results show that our approach is better then or as good as other published approaches.

Original languageEnglish
Title of host publication1993 International Symposium on VLSI Technology, Systems, and Applications, VLSI-TSA 1993 - Proceedings of Technical Papers
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages58-62
Number of pages5
ISBN (Electronic)0780309782
DOIs
StatePublished - 1993
Externally publishedYes
Event1993 International Symposium on VLSI Technology, Systems, and Applications, VLSI-TSA 1993 - Taipei, Taiwan
Duration: 12 05 199314 05 1993

Publication series

NameInternational Symposium on VLSI Technology, Systems, and Applications, Proceedings
ISSN (Print)1930-8868

Conference

Conference1993 International Symposium on VLSI Technology, Systems, and Applications, VLSI-TSA 1993
Country/TerritoryTaiwan
CityTaipei
Period12/05/9314/05/93

Bibliographical note

Publisher Copyright:
© 1993 IEEE.

Fingerprint

Dive into the research topics of 'Clique partitioning based integrated architecture synthesis for VLSI chips'. Together they form a unique fingerprint.

Cite this