A Genetic Algorithm-Based Circuit Partitioner For Mcms

Majhi, Ananta K and Patnaik, LM and Ramanc, Srilata (1995) A Genetic Algorithm-Based Circuit Partitioner For Mcms. In: Microprocessing And Microprogramming, 41 (1). pp. 83-96.

PDF 2.pdf Restricted to Registered users only Download (1MB) | Request a copy

Abstract

Multichip Modules (MCMs) is a packaging technology gaining importance, because it reduces the interconnect delays across chips, by bringing the interconnect delays closer in magnitude to the on-chip delays, The problem here is to partition a circuit across multiple chips, producing MCMs. Partitioning is a combinatorial optimization problem. One of the methods to solve the problem is by the use of Genetic Algorithms (GAs), which are based on genetics. GAs can be used to solve both combinatorial as well as functional optimization problems. This paper solves the problem of partitioning using the GA approach. The performance of GAs is compared with that of Simulated Annealing (SA), by executing the algorithms on three benchmark circuits. The effect of varying the parameters of the algorithm on the performance of GAs is studied.

Item Type:	Journal Article
Publication:	Microprocessing And Microprogramming
Publisher:	Elsavier
Additional Information:	Copyright of this article belongs to Elsavier.
Keywords:	Genetic algorithms;Multichip modules;VLSI circuit partitioning.
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	24 Mar 2009 09:50
Last Modified:	31 Mar 2011 09:29
URI:	http://eprints.iisc.ac.in/id/eprint/19125

Actions (login required)

View Item