loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
8th International Conference on VLSI Design
Genetic multiway partitioning
New Delhi, India
January 04-January 07
ISBN: 0-8186-6905-5
K. Shahookar, Dept. of Electr. Eng. & Comput. Sci., Michigan Univ., Ann Arbor, MI, USA
P. Mazumder, Dept. of Electr. Eng. & Comput. Sci., Michigan Univ., Ann Arbor, MI, USA
This research investigates a new software tool for Genetic Partitioning. The Genetic Algorithm is used to perform the partitioning with a significant improvement in result quality. Furthermore, it can optimize a cost function with multiple objectives and constraints. Separate algorithms have been developed, fine-tuned for bipartitioning and multiway partitioning. The bipartitioning problem is represented as a binary chromosome. Efficient bit-mask operations perform crossover, mutation, and net cut evaluation 32 bits at a time, without unpacking. The multiway partitioning algorithm has a global view of the problem, and generates/optimizes all the necessary partitions simultaneously. The algorithms were tested on the MCNC benchmark circuits, and the cut size obtained was lower than that for the conventional Fiduccia-Mattheyses algorithm.
Index Terms:
VLSI; circuit CAD; cellular arrays; logic CAD; logic partitioning; genetic algorithms; software tools; circuit optimisation; genetic multiway partitioning; software tool; result quality; cost function; multiple objectives; bipartitioning; binary chromosome; bit-mask operations; crossover; mutation; net cut evaluation; MCNC benchmark circuits; cut size; CAD; VLSI
Citation:
K. Shahookar, P. Mazumder, "Genetic multiway partitioning," vlsid, pp.365, 8th International Conference on VLSI Design, 1995
Usage of this product signifies your acceptance of the Terms of Use.