Difficult Channel Instance Generator for VLSI Physical Design Automation using Genetic Algorithm

@article{Sau2017DifficultCI,
  title={Difficult Channel Instance Generator for VLSI Physical Design Automation using Genetic Algorithm},
  author={Swagata Saha Sau and Rajat Kumar Pal},
  journal={Indian journal of science and technology},
  year={2017},
  volume={10},
  pages={1-8}
}
  • S. S. Sau, R. Pal
  • Published 7 April 2017
  • Computer Science
  • Indian journal of science and technology
Objectives: The wire length minimization of Channel routing problem is NP-hard. There are several heuristic algorithms available in the literature to get the feasible routing solutions using some limited instances. Here we want to generate all possible random channel instances based on Genetic Algorithm (GA). Methods/ Statistical Analysis: The present paper is described in three phases. In the first phase, we generate fixed size initial population based on some strategies and define the fitness… 

Figures from this paper

References

SHOWING 1-10 OF 27 REFERENCES

Algorithms for Generating Random Channel Instances for Channel Routing Problem

TLDR
Algorithms for generating random channel instances for their use in computing channel routing solutions in VLSI physical design and a heuristic algorithm for solving these problems is developed.

The Efficient Hybrid Approach to Channel Routing Problem

TLDR
The experimental results show that the proposed algorithm maintains the convergence properties of sequential genetic algorithm while it achieves linear speedup as the nets of the channel routing and the number of computing processors increase.

An Efficient Algorithm for Reducing Wire Length in Three-Layer Channel Routing

TLDR
An efficient polynomial time graph-based heuristic algorithm that minimizes the total wire length for most of the benchmark channel instances available in the reserved three-layer no-dogleg Manhattan channel routing model is developed.

A re-router for optimizing wire length in two-and four-layer no-dogleg channel routing

  • S. S. SauR. Pal
  • Computer Science
    18th International Symposium on VLSI Design and Test
  • 2014
TLDR
This paper develops two heuristic algorithms to minimize the total (vertical) wire length in channel routing problem and develops an efficient re-router Further_Reduced_Wire_Length to optimize the wirelength in the reserved two-layer (VH) no-dogleg channel routing model.

Routing through a dense channel with minimum total wire length

TLDR
A new efficient channel routing algorithm in the knock-knee mode that routes every solvable channel routing problem, uses minimum area, runs in time linear in the size of the routing area, and produces a layout with minimum total wire length if the channel is dense.

An efficient high performance parallel algorithm to yield reduced wire length VLSI circuits

  • S. S. SauR. Pal
  • Computer Science
    2012 5th International Conference on Computers and Devices for Communication (CODEC)
  • 2012
TLDR
This paper proposes an efficient polynomial time graph based parallel algorithm to reduce the total wire length without radically increasing of required area for interconnection in the reserved two-layer no-dogleg Manhattan channel routing model.

A Re-router for Reducing Wire Length in Multi- Layer No-Dogleg Channel Routing

TLDR
Two heuristic algorithms to reduce the total (vertical) wire length in channel routing problem in the reserved multi-layer no-dogleg Manhattan routing models, where vertical and horizontal layers of interconnect alternate.

Genetic Algorithms and Genetic Programming - Modern Concepts and Practical Applications

TLDR
This book provides a better understanding of the basic workflow of GAs and GP, encouraging readers to establish new bionic, problem-independent theoretical concepts and shows how to substantially increase achievable solution quality.

On the Complexity of the Channel Routing Problem in the Dogleg-free Multilayer Manhattan Model

TLDR
The second author has shown that in case lV=lH=k>1, it is NP-complete to decide whether a channel routing problem can be solved with width (d/k) in the dogleg-free 2k-layer Manhattan model and the remaining case is pointed out.

A Difficult Channel Routing Generator

TLDR
A random channel routing generator which can generate difficult channel routing instances of arbitrary size is presented.