Timing Minimization by Statistical Timing hMetis-based Partitioning

In this paper we present statistical timing driven hMetisbased partitioning. We approach timing driven partitioning from a different perspective: we use the statistical timing criticality concept to change the partitioning process itself. We exploit the hyperedge coarsening scheme of the hMetis partitioner for our timing minimization purpose. This allows us to perform partitioning such that the most critical nets in the circuit are not cut and therefore timing minimization can be achieved. The use of the hMetis partitioning algorithm makes our partitioning methodology fast. Simulations results show that 22% average delay improvement can be obtained. Furthermore, as a result of using the statistical timing model, the partitioning results can tolerate changes in temperature and process variation, hence causing less delay change compared to partitioning using static timing models.

• Type: Conference
• Year: 2003
• Where: VLSID
• Authors: Cristinel Ababei, Kia Bazargan
• Keywords: Computer Architecture, HMetis Partitioning Algorithm, Partitioning Process, Statistical Timing Criticality, VLSID 2003