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 language | English |
|---|---|
| Title of host publication | 1993 International Symposium on VLSI Technology, Systems, and Applications, VLSI-TSA 1993 - Proceedings of Technical Papers |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 58-62 |
| Number of pages | 5 |
| ISBN (Electronic) | 0780309782 |
| DOIs | |
| State | Published - 1993 |
| Externally published | Yes |
| Event | 1993 International Symposium on VLSI Technology, Systems, and Applications, VLSI-TSA 1993 - Taipei, Taiwan Duration: 12 05 1993 → 14 05 1993 |
Publication series
| Name | International Symposium on VLSI Technology, Systems, and Applications, Proceedings |
|---|---|
| ISSN (Print) | 1930-8868 |
Conference
| Conference | 1993 International Symposium on VLSI Technology, Systems, and Applications, VLSI-TSA 1993 |
|---|---|
| Country/Territory | Taiwan |
| City | Taipei |
| Period | 12/05/93 → 14/05/93 |
Bibliographical note
Publisher Copyright:© 1993 IEEE.