Channel and Switchbox Routing with Minimized Crosstalk - A Parallel Genetic Algorithm Approach

Authors:
J. Lienig
Affiliations:
-
Venue:
VLSID '97 Proceedings of the Tenth International Conference on VLSI Design: VLSI in Multimedia Applications
Year:
1997

Citing 9
Cited 0

Punctuated equilibria: a parallel genetic algorithm

Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Minimum crosstalk switchbox routing

ICCAD '94 Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design
Minimum crosstalk channel routing

ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Artificial Intelligence Approach to VLSI Routing

Artificial Intelligence Approach to VLSI Routing
Easy-to-Use Object-Oriented Parallel Processing with Mentat

Computer
Genetic Algorithms and Punctuated Equilibria in VLSI

PPSN I Proceedings of the 1st Workshop on Parallel Problem Solving from Nature
A genetic algorithm for channel routing in vlsi circuits

Evolutionary Computation
Performance driven spacing algorithms using attractive and repulsive constraints for submicron LSI's

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Reduction of crosstalk between interconnections becomes an important consideration in today's VLSI design. This paper presents a novel approach to solve the VLSI channel and switchbox routing problems with the objective of satisfying crosstalk constraints for the nets. The approach is based on a parallel genetic algorithm which runs on a distributed network of workstations. All our routing results are qualitatively better or as good as the best published results. In addition, our algorithm is able to significantly reduce the occurrence of crosstalk.