Macro-cell and module placement by genetic adaptive search with bitmap-represented chromosome
dc.contributor.author | Chan, Heming | en_US |
dc.contributor.author | Mazumder, Pinaki | en_US |
dc.contributor.author | Shahookar, K. | en_US |
dc.date.accessioned | 2006-04-10T14:31:26Z | |
dc.date.available | 2006-04-10T14:31:26Z | |
dc.date.issued | 1991-11 | en_US |
dc.identifier.citation | Chan, Heming, Mazumder, P., Shahookar, K. (1991/11)."Macro-cell and module placement by genetic adaptive search with bitmap-represented chromosome." Integration, the VLSI Journal 12(1): 49-77. <http://hdl.handle.net/2027.42/29041> | en_US |
dc.identifier.uri | http://www.sciencedirect.com/science/article/B6V1M-47X7F2K-14/2/3c38b6c3c031b657e2282996516fba29 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/29041 | |
dc.description.abstract | The genetic algorithm has been applied to the VLSI module placement problem. This algorithm is an iterative, evolutional approach. A placement configutation is represented by a set of primitive features such as location and orientation, and the features are arranged in the form of a two-dimensional bitmap chromosome. The representation is flexible, and can handle arbitrarily shaped cells, and pads, and is applicable to the placement of macro cells, and gate arrays. Three new versions of genetic operators, namely, crossover, inversion and mutation, are used to explore the solution space. Crossover creates new configurations by combining attributes from a pair of existing configurations. This feature passing scheme constitutes the primary difference between our genetic approach and the other traditional searching techniques. Inversion enables more uniform inheritance of features from one generation to the next, and mutation prevents the algorithm from getting trapped at local optima. We have pointed out that the bitmap representation enables the algorithm to divide the entire solution space into a set of feature-equivalent classes, or schemata where each class contains a set of solutions with common physical attributes. We show that the genetic algorithm adaptively biases the search based on the past observed fitness of the schemata. We also demonstrated the power of the genetic algorithm experimentally for macro cell placement, and obtained satisfactory results. | en_US |
dc.format.extent | 1570481 bytes | |
dc.format.extent | 3118 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Elsevier | en_US |
dc.title | Macro-cell and module placement by genetic adaptive search with bitmap-represented chromosome | en_US |
dc.type | Article | en_US |
dc.rights.robots | IndexNoFollow | en_US |
dc.subject.hlbsecondlevel | Electrical Engineering | en_US |
dc.subject.hlbtoplevel | Engineering | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Department of Electrical Engineering and Computer Science, The University of Michigan, Ann Arbor, MI 48109, USA | en_US |
dc.contributor.affiliationum | Department of Electrical Engineering and Computer Science, The University of Michigan, Ann Arbor, MI 48109, USA | en_US |
dc.contributor.affiliationum | Department of Electrical Engineering and Computer Science, The University of Michigan, Ann Arbor, MI 48109, USA | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/29041/1/0000074.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1016/0167-9260(91)90042-J | en_US |
dc.identifier.source | Integration, the VLSI Journal | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.