An optimization algorithm for simultaneous routing and buffer insertion with delay-power constraints in VLSI layout design

Uttraphan, C.; Shaikh-Husin, Nasir; Hani, Mohamed Khalil

doi:10.1109/isqed.2014.6783348

Cited by 4 publications

(3 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The DESKF follows the same procedures as the BSKF. Instead of using the term, the distance, , is mapped into a probabilistic value in the range of [0,1] as follows: (9) Then, the probabilistic value is compared to a random number, rand , to update the solution For a particular dimension d, a bit value in the solution, is updated according to the same rule used in BSKF.…”

Section: The Distance Evaluated Simulated Kalman Filtermentioning

confidence: 99%

“…Examples of numerical optimization problems are Proportional-Integral-Derivative (PID) tuning in control applications [1], training of a neural network [2], adaptive beamforming [3], and engineering design problems [4]. On the other hand, combinatorial optimization or discrete problems concern with the best combination of a set of variables such as in traveling salesman problems [5], assembly sequence planning [6], scheduling for airport [7] and classroom [8], routing in integrated circuits [9], and feature selection [10]. In solving discrete and combinatorial optimization problems, metaheuristic algorithms such genetic algorithm (GA) [11] and ant colony optimization (ACO) [12] have been developed to operate in binary search space.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Distance Evaluated Simulated Kalman Filter with State Encoding for Combinatorial Optimization Problems

Yusof¹,

Ibrahim²,

Adam³

et al. 2018

IJET

View full text Add to dashboard Cite

Simulated Kalman Filter (SKF) is a population-based optimization algorithm which exploits the estimation capability of Kalman filter to search for a solution in a continuous search space. The SKF algorithm only capable to solve numerical optimization problems which involve continuous search space. Some problems, such as routing and scheduling, involve binary or discrete search space. At present, there are three modifications to the original SKF algorithm in solving combinatorial optimization problems. Those modified algorithms are binary SKF (BSKF), angle modulated SKF (AMSKF), and distance evaluated SKF (DESKF). These three combinatorial SKF algorithms use binary encoding to represent the solution to a combinatorial optimization problem. This paper introduces the latest version of distance evaluated SKF which uses state encoding, instead of binary encoding, to represent the solution to a combinatorial problem. The algorithm proposed in this paper is called state-encoded distance evaluated SKF (SEDESKF) algorithm. Since the original SKF algorithm tends to converge prematurely, the distance is handled differently in this study. To control and exploration and exploitation of the SEDESKF algorithm, the distance is normalized. The performance of the SEDESKF algorithm is compared against the existing combinatorial SKF algorithm based on a set of Traveling Salesman Problem (TSP).

show abstract

Section: The Distance Evaluated Simulated Kalman Filtermentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Distance Evaluated Simulated Kalman Filter with State Encoding for Combinatorial Optimization Problems

Yusof¹,

Ibrahim²,

Adam³

et al. 2018

IJET

View full text Add to dashboard Cite

show abstract

“…However, HRTB-LA will not explore the entire graph as in RMP because we use the initial tree as a reference for determining the Steiner node as in RIATA. We also incorporate the technique of graph pruning and look-ahead from [17,19], which is proven to be fast in single sink nets, into the multisink nets problem. The remainder of this paper is organized as follows: Section 2 describes the theoretical background for buffer insertion algorithms while Section 3 describes the problem formulation.…”

Section: Introductionmentioning

confidence: 99%

An optimized buffer insertion algorithm with delay-power constraints for VLSI layouts

Uttraphan¹,

Shaikh-Husin²,

Hani³

2017

Turk J Elec Eng & Comp Sci

View full text Add to dashboard Cite

Abstract:We propose a grid-graph algorithm for interconnect routing and buffer insertion in nanometer VLSI layout designs. The algorithm is designed to handle multiconstraint optimizations, namely timing performance and power dissipation. The proposed algorithm is called HRTB-LA, which stands for hybrid routing tree and buffer insertion with look-ahead. In recent VLSI designs, interconnect delay has become a dominant factor compared to gate delay. The well-known technique to minimize the interconnect delay is by inserting buffers along the interconnect wires. However, the buffer itself consumes power and it has been shown that power dissipation overhead due to buffer insertions is significantly high. Many methodologies to optimize timing performance with power constraint have been proposed, and no algorithm is based on dynamic programing technique using a grid graph. In addition, most of the algorithms for buffer insertion use a postrouting buffer insertion approach. In the presence of buffer obstacles, these postrouting algorithms may produce poor solutions. On the other hand, the simultaneous routing and buffer insertion algorithm offers a better solution, but it was proven to be NP complete. Hence, our main contribution is an efficient algorithm using a hybrid approach for multiconstraint optimization for multisink nets. The algorithm uses dynamic programming to compute incrementally the interconnect delay and power dissipation of the inserted buffers while an effective runtime is achieved with the aid of novel look-ahead and graph pruning schemes. Experimental results prove that HRTB-LA is able to handle multiconstraint optimizations and produces a solution up to 30% better compared to a postrouting buffer insertion algorithm in comparable runtime.

show abstract

Effects of Dummy Thermal Vias on Interconnect Delay and Power Dissipation of Very Large Scale Integration Circuits

Zhang

2018

Wuhan Univ. J. Nat. Sci.

View full text Add to dashboard Cite

An optimization algorithm for simultaneous routing and buffer insertion with delay-power constraints in VLSI layout design

Cited by 4 publications

References 23 publications

Distance Evaluated Simulated Kalman Filter with State Encoding for Combinatorial Optimization Problems

Distance Evaluated Simulated Kalman Filter with State Encoding for Combinatorial Optimization Problems

An optimized buffer insertion algorithm with delay-power constraints for VLSI layouts

Effects of Dummy Thermal Vias on Interconnect Delay and Power Dissipation of Very Large Scale Integration Circuits

Contact Info

Product

Resources

About