Removal of Intersection for Multi-net Multi-pin Routing Problem with Layer Assignment

2010 ◽  
Author(s):  
Subhra Sundar Goswami
Keyword(s):  
Routing Problem ◽  
Layer Assignment

A Method for the Multi-Net Multi-Pin Routing Problem with Layer Assignment

2009 ◽  
Author(s):  
Tuhina Samantam ◽  
Hafizur Rahaman ◽  
Prasun Ghosal ◽  
Parthasarathi Dasgupta
Keyword(s):  
Routing Problem ◽  
Layer Assignment

scholarly journals Minimum Crosstalk Vertical Layer Assignment for Three-Layer VHV Channel Routing

VLSI Design ◽  
1998 ◽  
Vol 7 (1) ◽  
pp. 73-84
Author(s):  
Shashidhar Thakur ◽  
Kai-Yuan Chao ◽  
D. F. Wong
Keyword(s):  
Optimal Algorithm ◽  
Vlsi Circuits ◽  
Vertical Layer ◽  
Channel Routing ◽  
Routing Problem ◽  
Circuit Performance ◽  
Layer Assignment

With the increasing density of VLSI circuits, the interconnection wires are getting packed even closer. This has increased the effect of interaction between these wires on circuit performance and hence, the importance of controlling crosstalk. We consider the gridded channel routing problem where, specifically, the channel has 3 routing layers in the VHV configuration. Given a horizontal track assignment for the nets, we present an optimal algorithm for minimizing the crosstalk between vertical wiring segments in the channel by finding an optimal vertical layer assignment for them. We give an algorithm that minimizes total crosstalk between vertical wires on the same V layer on adjacent columns of the grid in O(ν logν) time using O(ν) memory, where the channel has ν columns. We then extend this algorithm to consider crosstalk between wires in nonadjacent columns and between wires on different layers. Finally, we show how our algorithms can be extended to take crosstalk tolerance specifications for nets into account.

Fuzzy multi-objective location and routing problem

2020 ◽  
Vol 39 (3) ◽  
pp. 3259-3273
Author(s):  
Nasser Shahsavari-Pour ◽  
Najmeh Bahram-Pour ◽  
Mojde Kazemi
Keyword(s):  
Firefly Algorithm ◽  
High Reliability ◽  
Research Area ◽  
Nsga Ii ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Location Allocation ◽  
Multi Objective ◽  
Location Routing ◽  
The Cost

The location-routing problem is a research area that simultaneously solves location-allocation and vehicle routing issues. It is critical to delivering emergency goods to customers with high reliability. In this paper, reliability in location and routing problems was considered as the probability of failure in depots, vehicles, and routs. The problem has two objectives, minimizing the cost and maximizing the reliability, the latter expressed by minimizing the expected cost of failure. First, a mathematical model of the problem was presented and due to its NP-hard nature, it was solved by a meta-heuristic approach using a NSGA-II algorithm and a discrete multi-objective firefly algorithm. The efficiency of these algorithms was studied through a complete set of examples and it was found that the multi-objective discrete firefly algorithm has a better Diversification Metric (DM) index; the Mean Ideal Distance (MID) and Spacing Metric (SM) indexes are only suitable for small to medium problems, losing their effectiveness for big problems.

Chip layer assignment method for analytical placement of 3D ICs

2013 ◽  
Vol 33 (6) ◽  
pp. 1548-1552
Author(s):  
Wenchao GAO ◽  
Qiang ZHOU ◽  
Xu QIAN ◽  
Yici CAI
Keyword(s):  
Assignment Method ◽  
3D Ics ◽  
Layer Assignment
Sign in / Sign up

Export Citation Format

Share Document