GENETIC ALGORITHM FOR NODE PARTITIONING PROBLEM AND APPLICATIONS IN VLSI DESIGN

被引：14

作者：

CHANDRASEKHARAM, R ^{[1
]}

SUBHRAMANIAN, S ^{[1
]}

CHAUDHURY, S ^{[1
]}

机构：

[1] INDIAN INST TECHNOL,DEPT ELECT ENGN,NEW DELHI 110007,INDIA

来源：

IEE PROCEEDINGS-E COMPUTERS AND DIGITAL TECHNIQUES | 1993年 / 140卷 / 05期

关键词：

GENETIC ALGORITHMS; NODE PARTITIONING PROBLEM; VLSI DESIGN;

D O I：

10.1049/ip-e.1993.0037

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

The group of classical graph-theoretic problems, including graph colouring, clique cover, and maximal clique, may be viewed as instances of a general node partitioning problem (NPP). A wide variety of real life problems can be modelled as instances of NPP. Finding an optimal partition for the NPP is said to be NP-complete. In this work a stochastic search by a genetic algorithm (GA) is employed to find a near optimal solution for the NPP. The critical aspects of the GA for NPP, such as the solution representation by elegant data structure, together with genetic operations and selection policies employed in the GA procedure, are also presented. The proposed GA does not require the number of disjunct node sets to be given a priori. Three application problems is VLSI design are solved as instances of NPP. The experimental results presented in each case of these application problems bring out the efficacy of genetic algorithms.

引用

页码：255 / 260

页数：6

共 18 条

[11]

JONE WB, 1989, 26TH P ACM IEEE DES, P531

[12]

KIME CR, 1982, 12TH P INT S FAULT T, P406

[13] OPTIMIZATION BY SIMULATED ANNEALING [J].

KIRKPATRICK, S ;

GELATT, CD ;

VECCHI, MP .

SCIENCE, 1983, 220 (4598) :671-680

[14]

KORMAN SM, 1975, THESIS IMPERIAL COLL

[15]

MISRA S, 1992, THESIS INDIAN I TECH, V721, P302

[16]

MONAN RC, 1992, VLSI92, V92, P368

[17] A GENETIC APPROACH TO STANDARD CELL PLACEMENT USING META-GENETIC PARAMETER OPTIMIZATION [J].

SHAHOOKAR, K ;

MAZUMDER, P .

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1990, 9 (05) :500-511

[18] OPTIMUM AND SUBOPTIMUM ALGORITHMS FOR INPUT ENCODING AND ITS RELATIONSHIP TO LOGIC MINIMIZATION [J].

YANG, SY ;

CIESIELSKI, MJ .

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1991, 10 (01) :4-12

← 1 2 →