New graph-based algorithms for partitioning VLSI circuits

Christopher J. Augeri, Hesham H Ali

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)

Abstract

When designing a circuit, it may be too large to fit on a single layer of a chip, on a single chip, or on a single board. Regardless of the design level, the same objectives remain. Normally, it is desirable to minimize the number of layers, chips, or boards, along with minimizing the delay. Additional constraints, such as the number of interconnections and power consumption, must often be considered. We have developed two k-way bounded partitioning algorithms; one is evolutionary-based, while the other is a hierarchical graph center-based approach. The algorithms are implemented and compared with known partitioning algorithms. Since VLSI circuits can be naturally modeled by graphs, experiments were conducted by partitioning graphs from various graph families against both simulated and real-world partitioning criteria. A direct result of this research is a high-level abstract graph-partitioning model. This model allows one to specify mathematical evaluation metrics and control parameters, permitting inter-domain comparison of algorithms and allowing one to identify the particular scenarios they are best applicable to.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE International Symposium on Circuits and Systems
Volume4
StatePublished - 2004
Event2004 IEEE International Symposium on Circuits and Systems - Proceedings - Vancouver, BC, Canada
Duration: May 23 2004May 26 2004

Other

Other2004 IEEE International Symposium on Circuits and Systems - Proceedings
CountryCanada
CityVancouver, BC
Period5/23/045/26/04

Fingerprint

VLSI circuits
Electric power utilization
Networks (circuits)
Experiments

ASJC Scopus subject areas

  • Electronic, Optical and Magnetic Materials
  • Electrical and Electronic Engineering

Cite this

Augeri, C. J., & Ali, H. H. (2004). New graph-based algorithms for partitioning VLSI circuits. In Proceedings - IEEE International Symposium on Circuits and Systems (Vol. 4)

New graph-based algorithms for partitioning VLSI circuits. / Augeri, Christopher J.; Ali, Hesham H.

Proceedings - IEEE International Symposium on Circuits and Systems. Vol. 4 2004.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Augeri, CJ & Ali, HH 2004, New graph-based algorithms for partitioning VLSI circuits. in Proceedings - IEEE International Symposium on Circuits and Systems. vol. 4, 2004 IEEE International Symposium on Circuits and Systems - Proceedings, Vancouver, BC, Canada, 5/23/04.
Augeri CJ, Ali HH. New graph-based algorithms for partitioning VLSI circuits. In Proceedings - IEEE International Symposium on Circuits and Systems. Vol. 4. 2004
Augeri, Christopher J. ; Ali, Hesham H. / New graph-based algorithms for partitioning VLSI circuits. Proceedings - IEEE International Symposium on Circuits and Systems. Vol. 4 2004.
@inproceedings{0fab217022bb4a9dab8da67b1538cec4,
title = "New graph-based algorithms for partitioning VLSI circuits",
abstract = "When designing a circuit, it may be too large to fit on a single layer of a chip, on a single chip, or on a single board. Regardless of the design level, the same objectives remain. Normally, it is desirable to minimize the number of layers, chips, or boards, along with minimizing the delay. Additional constraints, such as the number of interconnections and power consumption, must often be considered. We have developed two k-way bounded partitioning algorithms; one is evolutionary-based, while the other is a hierarchical graph center-based approach. The algorithms are implemented and compared with known partitioning algorithms. Since VLSI circuits can be naturally modeled by graphs, experiments were conducted by partitioning graphs from various graph families against both simulated and real-world partitioning criteria. A direct result of this research is a high-level abstract graph-partitioning model. This model allows one to specify mathematical evaluation metrics and control parameters, permitting inter-domain comparison of algorithms and allowing one to identify the particular scenarios they are best applicable to.",
author = "Augeri, {Christopher J.} and Ali, {Hesham H}",
year = "2004",
language = "English (US)",
volume = "4",
booktitle = "Proceedings - IEEE International Symposium on Circuits and Systems",

}

TY - GEN

T1 - New graph-based algorithms for partitioning VLSI circuits

AU - Augeri, Christopher J.

AU - Ali, Hesham H

PY - 2004

Y1 - 2004

N2 - When designing a circuit, it may be too large to fit on a single layer of a chip, on a single chip, or on a single board. Regardless of the design level, the same objectives remain. Normally, it is desirable to minimize the number of layers, chips, or boards, along with minimizing the delay. Additional constraints, such as the number of interconnections and power consumption, must often be considered. We have developed two k-way bounded partitioning algorithms; one is evolutionary-based, while the other is a hierarchical graph center-based approach. The algorithms are implemented and compared with known partitioning algorithms. Since VLSI circuits can be naturally modeled by graphs, experiments were conducted by partitioning graphs from various graph families against both simulated and real-world partitioning criteria. A direct result of this research is a high-level abstract graph-partitioning model. This model allows one to specify mathematical evaluation metrics and control parameters, permitting inter-domain comparison of algorithms and allowing one to identify the particular scenarios they are best applicable to.

AB - When designing a circuit, it may be too large to fit on a single layer of a chip, on a single chip, or on a single board. Regardless of the design level, the same objectives remain. Normally, it is desirable to minimize the number of layers, chips, or boards, along with minimizing the delay. Additional constraints, such as the number of interconnections and power consumption, must often be considered. We have developed two k-way bounded partitioning algorithms; one is evolutionary-based, while the other is a hierarchical graph center-based approach. The algorithms are implemented and compared with known partitioning algorithms. Since VLSI circuits can be naturally modeled by graphs, experiments were conducted by partitioning graphs from various graph families against both simulated and real-world partitioning criteria. A direct result of this research is a high-level abstract graph-partitioning model. This model allows one to specify mathematical evaluation metrics and control parameters, permitting inter-domain comparison of algorithms and allowing one to identify the particular scenarios they are best applicable to.

UR - http://www.scopus.com/inward/record.url?scp=4344593792&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=4344593792&partnerID=8YFLogxK

M3 - Conference contribution

VL - 4

BT - Proceedings - IEEE International Symposium on Circuits and Systems

ER -