Performance Driven Circuit Clustering and Partitioning

  • Authors:
  • Affiliations:
  • Venue:
  • ITCC '02 Proceedings of the International Conference on Information Technology: Coding and Computing
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, the problem of performance driven circuit-partitioning problem is considered. The parameters taken into consideration to measure performance are power interconnection resource constraints. An algorithm is presented to build clusters in the bottom up manner while decomposing clusters for cutsize and delay minimization as well as power consumption and resource constraint. Partitioning method in top down manner is applied based on probability function.