ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

A provably tight delay-driven concurrently congestion mitigating global routing algorithm

Samanta, Radhamanjari and Erzin, Adil I and Raha, Soumyendu and Shamardin, Yuriy V and Takhonov, Ivan I and Zalyubovskiy, Vyacheslav V (2015) A provably tight delay-driven concurrently congestion mitigating global routing algorithm. In: APPLIED MATHEMATICS AND COMPUTATION, 255 . pp. 92-104.

[img] PDF
app_mat_com-255_92_2015.pdf - Published Version
Restricted to Registered users only

Download (669kB) | Request a copy
Official URL: http://dx.doi.org/10.1016/j.amc.2014.11.062

Abstract

Routing is a very important step in VLSI physical design. A set of nets are routed under delay and resource constraints in multi-net global routing. In this paper a delay-driven congestion-aware global routing algorithm is developed, which is a heuristic based method to solve a multi-objective NP-hard optimization problem. The proposed delay-driven Steiner tree construction method is of O(n(2) log n) complexity, where n is the number of terminal points and it provides n-approximation solution of the critical time minimization problem for a certain class of grid graphs. The existing timing-driven method (Hu and Sapatnekar, 2002) has a complexity O(n(4)) and is implemented on nets with small number of sinks. Next we propose a FPTAS Gradient algorithm for minimizing the total overflow. This is a concurrent approach considering all the nets simultaneously contrary to the existing approaches of sequential rip-up and reroute. The algorithms are implemented on ISPD98 derived benchmarks and the drastic reduction of overflow is observed. (C) 2014 Elsevier Inc. All rights reserved.

Item Type: Journal Article
Publication: APPLIED MATHEMATICS AND COMPUTATION
Publisher: ELSEVIER SCIENCE INC
Additional Information: Copy right for this article belongs to the ELSEVIER SCIENCE INC, 360 PARK AVE SOUTH, NEW YORK, NY 10010-1710 USA
Keywords: Steiner tree; Elmore delay; Global routing; Gradient method
Department/Centre: Division of Interdisciplinary Sciences > Supercomputer Education & Research Centre
Date Deposited: 28 Apr 2015 07:58
Last Modified: 28 Apr 2015 07:58
URI: http://eprints.iisc.ac.in/id/eprint/51440

Actions (login required)

View Item View Item