4
A n Evolutionary Algorithm f o r L o w Power VLSI Cell Placement Mahmood R. Minhas Information a n d Computer Science Department King Fahd University o f Petroleum a n d Minerals Dhahran 31261, Saudi Arabia E-mail: [email protected]. edu.sa Abstract - With t h e increasing use of battery operated mobile electronic devices, VLSI circuit designers a r e con- tinuowly focusing on approaches t o low power designs. W e present a n evolutionary cell placement technique fo r l ow power VLSI standard placement. T h e proposed technique is based o n t w o evolutionary algorithms namely Tabu Search a n d Genetic Algorithm. Experiments were carried o u t using representative circuits from ISCAS- 85/89 benchmark suite. F o r t h e comparison purposes, we also implemented G A f o r ou r problem a n d compared placements results of t he proposed technique t o those o f G A . Th e comparison shows that t h e proposed technique outperforms G A both i n terms of quality of final place- ment solution obtained a s well a s CP U r u n time require- ments. I . Introduction T h e need f o r l o w power driven VLSI design h a s emerged rapidly in past f e w years. While optimizing a circuit d e - sign f o r power consumption, other design objectives like performance and interconnect wire length need also o b e taken care o f . This fact leads t o t h development o f techniiques, which target t o simnultancously optimlize a ll these design goals. Previously, t h e objectives o f opti- mizing interconnect wire length an d performanice were focused, a n d a large number o f efforts targeting either o n e or both of above t w o objectives a re reported i n th e literature [1], [2]. There h a s been reported some work f o r optimizing power consumption while considering t h e wire length a n d performance a s constraints [3], [4]. R e - cently, some efforts targeting simultaneous optimnization o f a l l thrce ol)jectives a re also reported i n [5], [6]. T h e organizationi o f t h e rest of this paper i s a s follows: I n t h e next section, w e present t h e problem a nd formu- late t h e cost functions. Section 3 presents t h e implemen- tation details o f o u r proposed approach. T h e experimen- t a l results a n d comparison a r e presented i n Section 4. I I . VLSI Cell Placement a nd Cost Functions VLSI design i s a complex process a n d i s carried o u t a t certain abstraction levels ' ] . T h e design process starts from a n abstract idea, nd then each intermediate step continues refining th design and the process ends with t h e fabrication o f a n e w chip. T h e problem o f power optimization c a n b e addressed a t a higher level a s well as a t a lower level e.g., physical level [8]. I n this work, w e address t h e above problem t h e placement step at t h e physical level. Placement is a n important step i n VLSI physical design responsible f o r arranigeinenit o f cells oni a layout surface f o r optimizing certain objectives wlhile satisfying some constraints. Standard cell placemlenit i s a special case where a l l t h e cells t o b e placed have equal height. CAD subproblem lavel BehavloralVArchlecturatl Register transter/tgic O CGe%msk Idea Generic CAD toos Architectural design Behavioma modeling anc) ISimnulation tool Loical design Functional a nd logic minimizaton5 I *logc fittin a n d simulton t o s Physical desin Tools f o r patitionin placement, routing, etc. I Fabrcation (New c h i Fig. 1. Various steps i n VLSI design process. W e a r e addressing t h e problem a t cell placement level with the objectives of optimizing power consumptioni, timing performance (delay), a n d wire lenigtlh whiile coiI- sidering layout widtlh as a conistraint. Forinally, the prob- lein cani b e stated a s follows: A s e t o f cells or itiod- ules M = {m1l,t2, ...,m",t) an d a s e t o f signtals S = {81s 82s, ..., s k } is given. Moreover, a s e t o f signals S,,*,, where S m , 5 S , i s associated with each module m i E M . Similarly, a s e t o f modules M.,, where M , , = {milsj E S m i } is called a signal net, is associated with each signal , j E S. Also, a s e t o f locations L = {LI,L2,-...ILp} where p > i s given. T h e problem is t o assign each mi E M t o a unique location L j , such that a l l of o u r objcctivcs a-rr. optitnizcd subjcct to ouT con.stiniflt [7]. A . Cost Functions N o w we formulate cost functions f o r o u r three said o b - jectives an d f o r t h e width constraint. . Wire length Cost: Interconnect Wire length of each n e t i n t h e circuit i s estiinated an d then total wire length i s computed b y adding a l l these individ- ua l estimates: Costwire = E i i i EM ( 1) where l i i s t h e wire length estimation f o r n e t i anid M denotes total number o f niets i n circuit (wlhiclh i s th e same a s number of modules f o r sirngle output cells). 0-7803-8294-3/04/$20.00 ©2004 IEEE 1540 Authorized licensed use limited to: NATIONAL INSTITUTE OF TECHNOLOGY ROURKELA. Downloaded on May 9, 2009 at 02:38 from IEEE Xplore. Restrictions apply.

Algorithm for LPV CELL Placement

Embed Size (px)

Citation preview

Page 1: Algorithm for LPV CELL Placement

8/8/2019 Algorithm for LPV CELL Placement

http://slidepdf.com/reader/full/algorithm-for-lpv-cell-placement 1/4

An E v o l u t i o n a r y A l g o r i t h m f o r Low Power VLSI C e l l P l a c e m e n t

Mahmood R . M i n h a sI n f o r m a t i o n a n d C o m p u t e r S c i e n c e D e p a r t m e n tK i n g F a h d U n i v e r s i t y o f P e t r o l e u m a n d M i n e r a l s

D h a h r a n 3 1 2 6 1 , S a u d i A r a b i aE - m a i l : m i n h a s @ c c s e . k f u p m . e d u . s a

A b s t r a c t - W i t h t h e i n c r e a s i n g u s e o f b a t t e r y o p e r a t e dm o b i l e e l e c t r o n i c d e v i c e s , V L S I c i r c u i t d e s i g n e r s a r e c o n -t i n u o w l y f o c u s i n g o n a p p r o a c h e s t o l o w p o w e r d e s i g n s .We p r e s e n t a n e v o l u t i o n a r y c e l l p l a c e m e n t t e c h n i q u e f o rl o w p o w e r V L S I s t a n d a r d c e l l p l a c e m e n t . T h e p r o p o s e dt e c h n i q u e i s b a s e d o n t w o e v o l u t i o n a r y a l g o r i t h m s n a m e l yT a b u S e a r c h a n d G e n e t i c A l g o r i t h m . E x p e r i m e n t s w e r ec a r r i e d o u t u s i n g r e p r e s e n t a t i v e c i r c u i t s f r o m I S C A S -8 5 / 8 9 b e n c h m a r k s u i t e . F o r t h e c o m p a r i s o n p u r p o s e s ,w e a l s o i m p l e m e n t e d GA f o r o u r p r o b l e m a n d c o m p a r e dp l a c e m e n t s r e s u l t s o f t h e p r o p o s e d t e c h n i q u e t o t h o s e o fG A . T h e c o m p a r i s o n s h o w s t h a t t h e p r o p o s e d t e c h n i q u eo u t p e r f o r m s GA b o t h i n t e r m s o f q u a l i t y o f f i n a l p l a c e -m e n t s o l u t i o n o b t a i n e d a s w e l l a s CP U r u n t i m e r e q u i r e -m e n t s .

I . I n t r o d u c t i o n

T h e n e e d f o r l o w p o w e r d r i v e n V L S I d e s i g n h a s e m e r g e dr a p i d l y i n p a s t f e w y e a r s . W h i l e o p t i m i z i n g a c i r c u i t d e -s i g n f o r p o w e r c o n s u m p t i o n , o t h e r d e s i g n o b j e c t i v e s l i k ep e r f o r m a n c e a n d i n t e r c o n n e c t w i r e l e n g t h n e e d a l s o t ob e t a k e n c a r e o f . T h i s f a c t l e a d s t o t h e d e v e l o p m e n t o ft e c h n i i q u e s , w h i c h t a r g e t t o s i m n u l t a n c o u s l y o p t i m l i z e a l l

t h e s e d e s i g n g o a l s . P r e v i o u s l y , t h e o b j e c t i v e s o f o p t i -m i z i n g i n t e r c o n n e c t w i r e l e n g t h a n d p e r f o r m a n i c e w e r ef o c u s e d , a n d a l a r g e n u m b e r o f e f f o r t s t a r g e t i n g e i t h e ro n e o r b o t h o f a b o v e t w o o b j e c t i v e s a r e r e p o r t e d i n t h el i t e r a t u r e [ 1 ] , [ 2 ] . T h e r e h a s b e e n r e p o r t e d s o m e w o r kf o r o p t i m i z i n g p o w e r c o n s u m p t i o n w h i l e c o n s i d e r i n g t h ew i r e l e n g t h a n d p e r f o r m a n c e a s c o n s t r a i n t s [ 3 ] , [ 4 ] . R e -c e n t l y , s o m e e f f o r t s t a r g e t i n g s i m u l t a n e o u s o p t i m n i z a t i o no f a l l t h r c e o l ) j e c t i v e s a r e a l s o r e p o r t e d i n [ 5 ] , [ 6 ] .

T h e o r g a n i z a t i o n i o f t h e r e s t o f t h i s p a p e r i s a s f o l l o w s :I n t h e n e x t s e c t i o n , w e p r e s e n t t h e p r o b l e m a n d f o r m u -l a t e t h e c o s t f u n c t i o n s . S e c t i o n 3 p r e s e n t s t h e i m p l e m e n -t a t i o n d e t a i l s o f o u r p r o p o s e d a p p r o a c h . T h e e x p e r i m e n -t a l r e s u l t s a n d c o m p a r i s o n a r e p r e s e n t e d i n S e c t i o n 4 .

I I . VLSI C e l l P l a c e m e n t and C o s t F u n c t i o n s

V L S I d e s i g n i s a c o m p l e x p r o c e s s a n d i s c a r r i e d o u t a tc e r t a i n a b s t r a c t i o n l e v e l s ' ] . T h e d e s i g n p r o c e s s s t a r t sf r o m a n a b s t r a c t i d e a , a n d t he n e a c h i n t e r m e d i a t e s t e pc o n t i n u e s r e f i n i n g t h e d e s i g n a n d t h e p r o c e s s e n d s w i t ht h e f a b r i c a t i o n o f a n e w c h i p . T h e p r o b l e m o f p o w e ro p t i m i z a t i o n c a n b e a d d r e s s e d a t a h i g h e r l e v e l a s w e l la s a t a l o w e r l e v e l e . g . , p h y s i c a l l e v e l [ 8 ] . I n t h i s w o r k , w ea d d r e s s t h e a b o v e p r o b l e m i n t h e p l a c e m e n t s t e p a t t h ep h y s i c a l l e v e l . P l a c e m e n t i s a n i m p o r t a n t s t e p i n V L S I

p h y s i c a l d e s i g n r e s p o n s i b l e f o r a r r a n i g e i n e n i t o f c e l l s o n ia l a y o u t s u r f a c e f o r o p t i m i z i n g c e r t a i n o b j e c t i v e s w l h i l es a t i s f y i n g s o m e c o n s t r a i n t s . S t a n d a r d c e l l p l a c e m l e n i t i sa s p e c i a l c a s e w h e r e a l l t h e c e l l s t o b e p l a c e d h a v e e q u a lh e i g h t .

CAD s u b p r o b l e m l a v e l

B e h a v l o r a l V A r c h l e c t u r a t l

R e g i s t e r t r a n s t e r / t g i c O

C G e % m s k

I d e a G e n e r i c CAD t o o s

A r c h i t e c t u r a l d e s i g n B e h a v i o m a m o d e l i n g a n c )I S i m n u l a t i o n t o o l

L o i c a l d e s i g n F u n c t i o n a l a n d l o g i c m i n i m i z a t o n 5I * l o g c f i t t i n a n d s i m u l t o n t o s

P h y s i c a l desin T o o l s f o r p a t i t i o n i np l a c e m e n t , r o u t i n g , e t c .I

F a b r c a t i o n

( N e w c h i

F i g . 1 . V a r i o u s s t e p s i n V L S I d e s i g n p r o c e s s .

We a r e a d d r e s s i n g t h e p r o b l e m a t c e l l p l a c e m e n t l e v e lw i t h t h e o b j e c t i v e s o f o p t i m i z i n g p o w e r c o n s u m p t i o n i ,t i m i n g p e r f o r m a n c e ( d e l a y ) , a n d w i r e l e n i g t l h w h i i l e c o i I -s i d e r i n g l a y o u t w i d t l h a s a c o n i s t r a i n t . F o r i n a l l y , t h e p r o b -l e i n c a n i b e s t a t e d a s f o l l o w s : A s e t o f c e l l s o r i t i o d -

u l e s M = { m 1 l , t 2 , . . . , m " , t ) a n d a s e t o f s i g n t a l s S =

{ 8 1 s 8 2 s , . . . , s k } i s g i v e n . M o r e o v e r , a s e t o f s i g n a l s S , , * , ,w h e r e S m , 5S , i s a s s o c i a t e d w i t h e a c h m o d u l e m i E M.

S i m i l a r l y , a s e t o f m o d u l e s M . , , w h e r e M , , = { m i l s j E

S m i } i s c a l l e d a s i g n a l n e t , i s a s s o c i a t e d w i t h e a c h s i g n a l, j E S . A l s o , a s e t o f l o c a t i o n s L ={ L I , L 2 , - . . . I L p }

w h e r e p > n i s g i v e n . T h e p r o b l e m i s t o a s s i g n e a c hm i E M t o a u n i q u e l o c a t i o n L j , s u c h t h a t a l l o f o u ro b j c c t i v c s a - r r . o p t i t n i z c d s u b j c c t t o o u T c o n . s t i n i f l t [ 7 ] .

A . C o s t F u n c t i o n s

Now we f o r m u l a t e c o s t f u n c t i o n s f o r o u r t h r e e s a i d o b -

j e c t i v e s a n d f o r t h e w i d t h c o n s t r a i n t .. Wire l e n g t h C o s t : I n t e r c o n n e c t W i r e l e n g t h o f

e a c h n e t i n t h e c i r c u i t i s e s t i i n a t e d a n d t h e n t o t a lw i r e l e n g t h i s c o m p u t e d b y a d d i n g a l l t h e s e i n d i v i d -u a l e s t i m a t e s :

C o s t w i r e = E i ii EM

( 1 )

w h e r e l i i s t h e w i r e l e n g t h e s t i m a t i o n f o r n e t i a n i dM d e n o t e s t o t a l n u m b e r o f n i e t s i n c i r c u i t ( w l h i c l hi s t h e s a m e a s n u m b e r o f m o d u l e s f o r s i r n g l e o u t p u tc e l l s ) .

0 - 7 8 0 3 - 8 2 9 4 - 3 / 0 4 / $ 2 0 . 0 0 © 2 0 0 4 I E E E 1 5 4 0

Authorized licensed use limited to: NATIONAL INSTITUTE OF TECHNOLOGY ROURKELA. Downloaded on May 9, 2009 at 02:38 from IEEE Xplore. Restrictions apply.

Page 2: Algorithm for LPV CELL Placement

8/8/2019 Algorithm for LPV CELL Placement

http://slidepdf.com/reader/full/algorithm-for-lpv-cell-placement 2/4

Power C o s t : P o w e r c o n s u m p t i o n P i o f a n e t i i n ac i r c u i t c a n b e g i v e n a s :

P i 2 C i *V D D f *S i * ( 2 )

w h e r e C i i s t o t a l c a p a c i t a n c e o f n e t i , VDD i s t h es u p p l y v o l t a g e , f i s t h e c l o c k f r e q u e n c y , S i i s t h e

s w i t c h i n g p r o b a b i l i t y o f n e t i , a n d , B i s a t e c h n o l o g yd e p e n d e n t c o n s t a n t .A s s u m i n g a f i x s u p p l y v o l t a g e a n d c l o c k f r e q u e n c y ,t h e a b o v e e q u a t i o n r e d u c e s t o t h e f o l l o w i n g :

P i - C i S i ( 3 )

T h e c a p a c i t a n c e C i o f c e l l i i s g i v e n a s :

C i = r t + E : C94

cicj ~ ~ ~ ~ ~ ~ ~ ( 4 )jEMi

w h e r e C q i s t h e i n p u t c a p a c i t a n c e o f g a t e j a n d C ii s t h e i n t e r c o n n e c t c a p a c i t a n c e a t t h e o u t p u t n o d eo f c e l l i .A t t h e p l a c e m e n t p h a s e , o n l y t h e i n t e r c o n n e c t c a -p a c i t a n c e C i c a n b e m a n i p u l a t e d w h i l e C . ^ c o m e sf r o m t h e p r o p e r t i e s o f t h e c e l l l i b r a r y u s e d a n d i st h u s i n d e p e n d e n t o f p l a c e m e n t . M o r e o v e r , C i d e -p e n d s o n w i r e l e n g t h o f n e t i , s o e q u a t i o n 3 c a n b ew r i t t e n a s :

P i ~ - l i S i ( 5

T h e c o s t f u n c t i o n f o r t o t a l p o w e r c o n s u m p t i o n i nt h e c i r c u i t c a n b e g i v e n a s :

( 6 )o s t p o w e r = Z P i=

Z ( l i S )i EM iEM

* D e l a y C o s t : D e l a y c o s t i s d e t e r m i n e d b y t h e d e l a ya l o n g t h e l o n g e s t p a t h i n a c i r c u i t . T h e d e l a y T , , o f a

p a t h 7 r c o n s i s t i n g o f n e t s { v i , v 2 , . . . , V k } , i s e x p r e s s e da s :

k - i

T W = E ( C D + I D i )i = l

( 7 )

w h e r e C D i i s t h e s w i t c h i n g d e l a y o f t h e c e l l d r i v i n gn e t v i a n d I D i i s t h e i n t e r c o n n e c t d e l a y o f n e t v i .T h e p l a c e m e n t p h a s e a f f e c t s I D i b e c a u s e C D i i s

t e c h n o l o g y d e p e n d e n t p a r a m e t e r a n di s

i n d e p e n d e n to f p l a c e m e n t . U s i n g t h e RC d e l a y m o d e l , I D i i sg i v e n a s :

I D i = ( L F i + R r ) x C i ( 8 )

w h e r e L F i i s l o a d f a c t o r o f t h e d r i v i n g b l o c k , t h a ti s i n d e p e n d e n t o f l a y o u t , R r i s t h e i n t e r c o n n e c t r e -s i s t a n c e o f n e t v i a n d C i i s t h e l o a d c a p a c i t a n c e o fc e l l i g i v e n i n E q u a t i o n 4 .

T h e d e l a y c o s t f u n c t i o n c a n b e w r i t t e n a s :

C o s t d e l a y = m a x { T 7 r } ( 9 )

* Width C o s t : W i d t h c o s t i s g i v e n b y t h e maximumo f a l l t h e r o w w i d t h s i n t h e l a y o u t . W e h a v e c o n -s t r a i n e d l a y o u t w i d t h n o t t o e x c e e d a c e r t a i n p o s i -t i v e r a t i o a t o t h e a v e r a g e r o w w i d t h w a v g , w h e r e

W a v g i s t h e minimum p o s s i b l e l a y o u t w i d t h o b t a i n e db y d i v i d i n g t h e t o t a l w i d t h o f a l l t h e c e l l s i n t h e l a y -o u t b y t h e n u m b e r o f r o w s i n t h e l a y o u t . F o r m a l l y ,

w e c a n e x p r e s s w i d t h c o n s t r a i n i t a s b e l o w :W i d t h -W a v g < C X W a v ( 1 0 )

* O v e r a l l F u z z y C o s t F u n c t i o n : S i n c e , w e a r e o p -t i m i z i n g t h r e e o b j e c t i v e s s i m u l t a n e o u s l y , w e i i e e d t oh a v e a c o s t f u n c t i o n t h a t r e p r e s e n t s t h e e f f e c t o f a l lt h r e e o b j e c t i v e s i n f o r m o f a s i n g l e q u a n t i t y . We p r o -p o s e t h e u s e o f f u z z y l o g i c t o i n t e g r a t e t h e s e m u l t i -p l e , p o s s i b l y c o n f l i c t i n g o b j e c t i v e s i n t o a s c a l a r c o s tf u n c t i o n . F u z z y l o g i c a l l o w s u s t o d e s c r i b e t h e o b -j e c t i v e s i n t e r m s o f l i n g u i s t i c v a r i a b l e s . T h e n , f u z z yr u l e s a r e u s e d t o f i n d t h e o v e r a l l c o s t o f a p l a c e m e n ts o l u t i o n . I n t h i s w o r k , w e h a v e u s e d f o l l o w i n g f u z z yr u l e :I F a s o l u t i o n h a sSMALL w i r e l e n g t h ANDLOW p o w e r c o n s u m p t i o n ANDSHORT d e l a yTHEN i t i s a n GOOD s o l u t i o n .

t . o 9 ; 9 ,C / o ,

F i g . 2 . M e m b e r s h i p f u n c t i o n s

T h e a b o v e r u l e i s t r a n s l a t e d t o a n d - l i k e OW A f u z z yo p e r a t o r [ 9 1 a n d t h e m e m b e r s h i p p ( x ) o f a s o l u t i o nx i n f u z z y s e t GOOD s o l u t i o n i s g i v e n a s :

mf 3 . p i n , { t t j ( X ) } + ( 1 - d ) * E j ( x ) ;J=pd 3 j = P A d ,

/ ( x ) i f W i d t h - W a v g < a * W a v g ,

1 0 ; o t h e r w i s e . ( 1 1 )H e r e p j ( x ) f o r j = p , d , I , w i d t h l a r e t h e m e m n b e r s h i pv a l u e s i n t h e f u z z y s e t s LOW p o w e r c o n s u m p t i o n ,SHORT d e l a y , a n d SMALL w i r e l e n g t h r e s p e c t i v e l y ., B i s t h e c o n s t a n t i n t h e r a n g e [ 0 , 1 1 . T h e s o l u t i o nt h a t r e s u l t s i n maximum v a l u e o f p ( x ) i s r e p o r t e da s t h e b e s t s o l u t i o n f o u n d b y t h e s e a r c h h e u r i s t i c .T h e m e m b e r s h i p f u n c t i o n s f o r f u i z z y s e t s LOW p o w e rc o n s u m p t i o n , SHORT d e l a y , a n d SMALL w i r e l e n g t ha r e s h o w n i n F i g u r e 2 . W e c a n v a r y t h e p r e f e r e n i c eo f a n o b j e c t i v e j i n o v e r a l l m e i n b e r s h i p f u n c t i o I n b yc h a n g i n g t h e v a l u e o f g j . Th e l o w e r b o u n i d s O j f o r

1 5 4 1

Authorized licensed use limited to: NATIONAL INSTITUTE OF TECHNOLOGY ROURKELA. Downloaded on May 9, 2009 at 02:38 from IEEE Xplore. Restrictions apply.

Page 3: Algorithm for LPV CELL Placement

8/8/2019 Algorithm for LPV CELL Placement

http://slidepdf.com/reader/full/algorithm-for-lpv-cell-placement 3/4

d i f f e r e n t o b j e c t i v e s a r e c o m p u t e d a s g i v e n i n E q u a -t i o n s 1 2 - 1 5 :

n

° l = Z E l V v i E { V 1 , V 2 V n } ( 1 2 )i = l

O

i = l * VEVIV2 -i V 13

OdZ= C D j + I D j V j E { V I , V 2 , . . . V k } i n p a t h 7 r Cj = l

( 1 4 )E n Widthi(5O w i d t h _ Z=1 W i d t h

# o f rows i n l a y o u tw h e r e O j f o r j E { l , p , d , w i d t h } a r e t h e o p t i m a lc o s t s f o r w i r e - l e n g t h , p o w e r , d e l a y a n d l a y o u t w i d t hr e s p e c t i v e l y , n i s t h e n u m b e r o f n e t s i n l a y o u t , l i st h e o p t i m a l w i r e - l e n g t h o f n e t v i , C D i i s t h e s w i t c h -i n g d e l a y o f t h e c e l l i d r i v i n g n e t v i , I D , i s t h e o p -

t i m a l i n t e r c o n n e c t d e l a y o f n e t v i c a l c u l a t e d w i t ht h e h e l p o f l i , S i i s t h e s w i t c h i n g p r o b a b i l i t y o f n e t

v i , 7 r , i s t h e m o s t c r i t i c a l p a t h w i t h r e s p e c t t o o p -t i m a l i n t e r c o n n e c t d e l a y s , k i s t h e n u m b e r o f n e t si n 7 r , a n d W i d t h i i s t h e w i d t h o f t h e i n d i v i d u a l c e l ld r i v i n g n e t v i .

I I I . The P r o p o s e d T e c h n i q u e andI m p l e m e n t a t i o n D e t a i l s

I n t h i s s e c t i o n , we f i r s t p r e s e n t t h e p r o p o s e d a l g o r i t h ma n d t h e n d i s c u s s i t s i m p l e m e n t a t i o n d e t a i l s f o r l o w p o w e rV L S I p l a c e m e n t .

A n i t n t e r e s t i n i g n i o v e l i ( l e a i s t h e i n i t r o ( l u c t i o n i o f n p o p -

u l a t i o n o f s o l u t i o n i s i n i s t e n ( d o f s i n i g l C s o l u t i o n i n T a b i uS e a r c h a l g o r i t h m ( T S ) [ 1 0 ] . T h i s i s l i k e l y t o e n h a n c et h e p o w e r o f TS b y a l l o w i n g i t t o v i s i t t h e s e a r c h s p a c ei n a p a r a l l e l f a s h i o n . T h e a l g o r i t h m s t a r t s b y t a k i n g ar a n d o m i n i t i a l p o p u l a t i o n o f s o l u t i o n s . T h e n , f o r e a c h i n -d i v i d u a l i n t h e p o p u l a t i o n , a c e r t a i n n u m b e r o f n e i g h b o rs o l u t i o n s a r e g e n e r a t e d a n d t h e b e s t n e i g h b o r i s f o u n d .A c h a r a c t e r i s t i c o f t h e m o v e l e a d i n g t o t h e b e s t n e i g h b o rs o l u t i o I I i s s t o r e ( d i n a t a b u l i s t . T l h e r e a r c a s i m a n y t a b ul i s t s a s t h e n u m b e r o f s o l u t i o n s i n t h e p o p u l a t i o n i . e . ,

N T . T h e r e a s o n f o r t a k i n g N T t a b u l i s t s i s o b v i o u s t h a tt h e s e r i e s o f m o v e s f o r e a c h i n d i v i d u a l i n t h e p o p u l a t i o ni s d i f f e r e n t . T h e r e f o r e , e a c h s e r i e s s h o u l d b e s t o r e d i n a

s e p a r a t e l i s t s o t h a t a t a b u l i s t r e s t r i c t s t h e c y c l i c m o v e so n i t s c o r r e s p o n d i n g i n d i v i d u a l o n l y . H o w e v e r , t h e a s p i -r a t i o n l e v e l ( A L ) i s u n i q u e f o r a l l t h e i n d i v i d u a l s . T h ep u r p o s e i s t h a t t h e t a b u move o n a n i n d i v i d u a l s o l u t i o ni s a l l o w e d o n l y i f i t r e s u l t s i n a s o l u t i o n t h a t i s b e t t e rt h a n a n o v e r a l l u n i q u e b e s t s o l u t i o n .

T h e a b o v e p r o c e s s c o n t i n u e s f o r a c e r t a i n n u m b e r o fi t e r a t i o n s a n d a r e c o r d i s k e p t o f t h e NT i n d i v i d u a l b e s ts o l u t i o n s o b t a i n e d f r o m p e r t u r b i n g NT i n d i v i d u a l i n i t i a ls o l u t i o n s . T h e n e i t h e r t h e s e b e s t s o l u t i o n s o r t h e c u r -

r e n t s o l u t i o n s a r e p a s s e d t o GA f o r f u r t h e r o p t i m i z a t i o n .T h e s e s e m i - o p t i m i z e d i n d i v i d u a l s a r e l i k e l y t o p r o d u c e

g o o d o f f s p r i n g s b y m a t i n g w i t h o n e a n o t h e r . N o w , GAi s r u n f o r a g i v e n n u m b e r o f g e n e r a t i o n s o n t h e s e p a s s e ds o l u t i o n s a n d a r e c o r d o f t h e b e s t i n d i v i d u a l s i s k e p t .A g a i n , e i t h e r t h e c u r r e n t i n d i v i d u a l s o r b e s t o n e s a r ep a s s e d b a c k t o T S . T h e s w i t c h i n g b e t w e e n TS a n d GAi s r e p e a t e d f o r a g i v e n n u m b e r o f t i m e s .

A . S o l u t i o n E n c o d i n gA p l a c e m e n t s o l u t i o n i s a n a r r a n g e n m e n t o f c e l l s i n t w od i m e n s i o n a l l a y o u t s u r f a c e . S o w e d e c i d e d t o r e p r e s e n i ts o l u t i o n i n t h e f o r m i i o f a 2 - D g r i d . D u e t o v a r y i n i g w i d t l h so f t h e c e l l s i n a c i r c u i t , a l l t h e r o w s c a n n o t h a v e e q u a ln u m b e r o f c e l l s . T h i s f a c t d i s t u r b s o u r t w o d i m e n s i o n a lr e p r e s e n t a t i o n . F o r i n s ta n ce c o ns i d e r a c i r c u i t c o m p r i s -i n g o f 1 1 c e l l s 1 , 2 , 3 , . . . , 1 1 . A p o s s i b l e l a y o u t n m a y b ea s b e l o w :3 5 8 69 1 07 1 1 14 2

I n o r d e r t o m a k e i t a p e r f e c t g r i d , w e f i l l t h e e m p t y l o -c a t i o n s b y d u m m y c e l l s r e p r e s e n t e d b y d i s t i n c t n e g a t i v ei n t e g e r s a s s h o w n b e l o w . T h e s e n e g a t i v e n u m b e r s a r eu s e d f o r e n c o d i n g p u r p o s e a s w e l l a s f o r t h e a p p r o p r i a t ea p p l i c a t i o n o f g e n e t i c o p e r a t o r s l i k e c r o s s o v e r a n d t h e s ed o n o t p l a y a n y r o l e i n c o s t c o m p u t a t i o n o f t h e s o l u t i o n .3 5 8 69 1 0 - 1 - 27 1 1 1 - 34 2 - 4 - 5

I n t h e i n i t i a l i z a t i o n s t e p r a n d o m e n i c o d e d s t r i i n g s a r eg e n e r a t e d . F o r e n i c o ( i n l g p u r p o s e . w ( u s , - e . a s ( q u a r e g r i ( dl h t a v i n i g L s l o t s , s u i c h l t h t a t L > N , w l h e r o N i s t h e n u i h l ) e ro f c e l l s i n t h e c i r c u i i t . E t a l h c e l l i s a s t s i g e d l a t p o s i t i v ei n t e g e r v a l u e . A l s o , L - N d u m my c e l l s a r e c r e a t e d ,e a c h d u m m y c e l l i s a s s i g n e d a n e g a t i v e i n t e g e r i n s u c h aw a y t h a t n o t t w o d u m m y c e l l s h a v e t h e s a m e v a l u e . T og e n e r a t e t h e s t . r i n g , f i r s t r o w o f t h e g r i d i s p l a c e d f i r s t i nt h e s t r i n g f o l l o w e d b y t h e n e x t r o w a n d s o o n .

B . C o s t E v a l u a t i o n i

S i n c e , we a r e a d d r e s s i n g a m u l t i o b j e c t i v e o p t i m n i z a t i o np r o b l e m i n w h i c h we a r e t r y i n g t o m i n i m i z e t h r e e m u -t u a l l y c o n f l i c t i n g o b j e c t i v e s , t h e r e f o r e w e s h o u l d h a v e am e a s u r e w h i c h c a n q u a n t i f y t h e o v e r a l l q u a l i t y o f a s o -

l u t i o n w i t h r e s p e c t t o a l l t h r e e o b j e c t i v e s c o l l e c t i v e l y .A c o n v e n t i o n a l a p p r o a c h t o t h i s p r o b l e m i s t h e u s e o fw e i g h t e d s u m . T h i s a p p r o a c h i s n o t u s e d i n o u r i m p l e -m e n t a t i o n b e c a u s e i t i s k n o w n t o h a v e c e r t a i n p r o b l e m s .F o r i n s t a n c e , i t i s d i f f i c u l t t o f i n d v a l u e s f o r w e i g h t s a st h e s e h e a v i l y a f f e c t t h e r e l a t i v e i m p o r t a n i c e o f o b j e c t i v e s .

I n t h i s a p p r o a c h , t h e c o s t s o f a l l t h e o b j e c t i v e s a r e f i r s tF u z z y l o g i c p r o v i d e s a c o n v e n i e n t a p p r o a c h a n d l h e n c e

u s e d i n t h i s w o r k . I n t h i s s c h e m e , e a c h s o l u t i o n i s a s -s i g n e d a f i t n e s s v a l u e b e t w e e n 0 a n d 1 t h a t i s e q u a l t o t h em e m b e r s h i p v a l u e i n t h e f u z z y s e t o f a c c e p t a b l e s o l u t i o i n .T h i s m e m b e r s h i p v a l u e i s c o m p u t e d u s i n g E q u a t i o n 1 1 .

1 5 4 2

Authorized licensed use limited to: NATIONAL INSTITUTE OF TECHNOLOGY ROURKELA. Downloaded on May 9, 2009 at 02:38 from IEEE Xplore. Restrictions apply.

Page 4: Algorithm for LPV CELL Placement

8/8/2019 Algorithm for LPV CELL Placement

http://slidepdf.com/reader/full/algorithm-for-lpv-cell-placement 4/4

TABLE IA COMPARISON BETWEEN TH E P R O P O S E D T E C H N I Q U E AN D GA R E S U L T S

l _ _ _ _ _ _ GA T h e P r o p o s e d A l g o r i t h mC i r c u i t L ( p m ) P D ( p s ) T ( s ) L ( p m ) P D ( p s ) T ( s )

s 2 0 8 1 2 4 2 6 3 8 8 1 1 3 2 3 4 1 2 1 6 2 3 5 6 1 1 0 4 2 6

s 2 9 8 4 0 6 2 8 3 8 1 3 0 2 9 2 2 3 4 5 4 6 3 1 1 2 5 3 6 2

s 3 8 6 6 8 2 4 1 6 6 5 1 9 3 3 9 4 5 6 3 2 9 1 4 8 6 1 9 1 6 5 6

s 6 4 1 1 7 8 1 2 4 5 3 2 7 4 0 2 1 9 8 2 1 2 4 3 3 2 8 8 2 6 6 4 2 1 4 3s 8 3 2 2 1 0 1 5 4 7 8 7 3 9 5 7 2 0 6 1 8 4 5 1 4 2 5 7 3 5 1 1 9 2 9

s 9 5 3 3 1 0 0 4 5 0 2 7 2 3 5 1 1 2 2 1 2 5 9 6 7 4 2 3 9 2 1 2 1 8 4 6

s 1 1 9 6 4 8 7 2 9 1 4 7 5 5 3 7 2 1 6 1 2 0 3 8 5 7 4 1 1 5 2 6 3 3 4 3 2 7 6

s 1 2 3 8 5 0 3 8 7 1 5 0 3 5 3 9 6 1 6 2 0 8 3 9 0 6 5 1 1 3 4 2 3 5 1 3 6 6 7

s 1 4 8 8 6 9 7 9 2 1 7 3 4 6 7 8 4 2 1 4 3 4 5 6 1 4 8 1 4 1 3 5 6 6 9 5 1 5 7

s 1 4 9 4 6 9 2 2 3 1 7 1 6 9 7 7 1 2 6 0 3 2 5 4 9 1 4 1 3 7 6 3 6 6 8 5 6 4 3

c 3 5 4 0 3 1 0 9 9 6 1 0 9 8 5 0 9 2 4 5 7 7 2 4 1 6 4 2 4 5 5 7 9 0 5 1 7 0 3 3 3 2 4 7

I V . E x p e r i m e n t a l R e s u l t s and D i s c u s s i o n

T h e p r o p o s e d t e c h n i q u e i s a p p l i e d f o r p l a c e m e n t o f

s o m e c i r c u i t s f r o m I S C A S - 8 5 / 8 9 b e n c h m a r k s u i t e s . F o rt h e c o m p a r i s o n p u r p o s e s , a n o t h e r w e l l - k n o w n e v o l u t i o n -a r y a l g o r i t h m w a s a l s o i m p l e m e n t e d a n d a p p l i e d t o t h ea b o v e c i r c u i t s . T h e p e r f o r m a n c e o f t h e p r o p o s e d a l g o -r i t h m i s c o m p a r e d w i t h t h a t o f G A . T h e c o s t s o f t h e b e s ts o l u t i o n s g e n e r a t e d b y b o t h t h e a p p r o a c h e s a r e l i s t e di n T a b l e I . H e r e " L " , " P " a n d " D " r e p r e s e n t t h e w i r el e n g t h , p o w e r a n d d e l a y c o s t s r e s p e c t i v e l y , a n d " T " r e p -r e s e n t s e x e c u t i o n t i m e i n s e c o n d s . L a y o u t w i d t h w a s

c o n i s t r a i n e d n o t t o e x c e e d m o r e t h a n 1 . 2 t i m e s t h e a v -e r a g e r o w w i d t h b y f i x i n g t h e v a l u e o f a i n e q u a t i o n 1 0

e q u a l t o 0 . 2 . T h i s c o n s t r a i n t i s s a t i s f i e d i n o b t a i n i n i g a l lt h e r e s u l t s s h o w n h e r e .

T h e r e s u l t s o f GA a r e o b t a i n e d b y b e s t s e t t i n g s o f i t sv a r i o u s a l g o r i t h m i c p a r a m e t e r s . T h e p a r a m e t e r s s e t t i n go f t h e p r o p o s e d t e c h n i q u e f o r a c h i e v i n g t h e s e s r e s u l t si s a s f o l l o w s . T o t a l n u m b e r o f i t e r a t i o n s r u n a r e 5 0 0 0 ,w h i c h c o m p r i s e o f 2 0 0 0 TS i t e r a t i o n s a n d 3 0 0 0 GA g e n -e r a t i o n s . T h e s w i t c h f r o m T S t o GA i s m a d e o n l y o n c e .T h e p o p u l a t i o n s i z e NT u s e d i n T S p a r t i s 4 w h i l e i nGA p a r t t h e p o p u l a t i o n s i z e i s 1 6 c h r o m o s o m l e s . T h i sf i n e t u n i n g o f p a r a m e t e r s i s m a d e a f t e r c a r e f u l s t u d y o ft h e r e s u l t s o b t a i n e d b y c h o o s i n g d i f f e r e n t s e t t i n g s . T h ep o p u l a t i o n s i z e i n c a s e o f TS i s r e d u c e d a f t e r o b s e r v -i n g t h a t l a r g e p o p u l a t i o n s i z e i n c r e a s e s r u n t i m e o f T Sp a r t w i t h o u t p r o v i d i n g a n y s i g n i f i c a n t p e r f o r m a n c e . By

a d o p t i n g t h i s m e a s u r e , t h e r u n t i m e r e q u i r e m e n t o f t h e

p r o p o s e d t e c h n i q u e a r e s i g n i f i c a n t l y l o w e r e d .I t c a n b e o b s e r v e d f r o m t h e r e s u l t s t h a t i n a l l o f c a s e s ,

t h e p r o p o s e d t e c h n i q u e p r o d u c e d s o l u t i o n s w h i c h a r eb e t t e r i n q u a l i t y a s c o m p a r e d t o t h o s e o b t a i n e d f r o mG A . A l s o , t h e r u n t i m e r e q u i r e m e n t s o f t h e p r o p o s e dt e c h n i q u e a r e c o n s i d e r a b l y l o w e r t h a n t h a t o f G A .

V . C o n c l u s i o n s

We p r e s e n t e d a n e v o l u t i o n a r y t e c h n i q u e f o r l o w p o w e rV L S I c e l l p l a c e m e n t . T h e p r o p o s e d t e c h n i q u e i s a p p l i e d

f o r p l a c e m e n t o f s o m e c i r c u i t s f r o m I S C A S - 8 5 / 8 9 b e n c h -m a r k s u i t e s . T h e c o m p a r i s o n s h o w s t h e s u p e r i o r i t y o f

t h e p r o p o s e d t e c h n i q u e o v e r GA i n t e r m s o f p l a c e m e n tq u a l i t y a n d CP U r un t im e r e q u i r e m e n t s .

A c k n o w l e d g m e n t :A u t h o r t h a n k s K i n g F a h d U n i v e r s i t y o f P e t r o l e u m &M i n e r a l s , D h a h r a n , S a u d i A r a b i a , f o r a l l a s s i s t a n c e a n ds u p p o r t p r o v i d e d f o r c a r r y i n g o u t r e s e a r c h .

R e f e r e n c e s

[ 1 1 K . S h a h o o k a r a n d P . M a z u m d e r . V L S I C e l l P l a c e m l c n t T c c h i -n i q u e s . ACM C o m p u t i n g S u r v e y s , 2 ( 2 3 ) : 1 4 3 - 2 2 0 , J u i i e 1 9 9 1 .

[ 2 J K . C h a u d h a r y A . S r i n i v a s a n a n d E . S . K u h . R i t u a l : AP e r f o r m a n c e - d r i v e n P l a c e m l e n t A l g o r i t h i n . I E E E 7 h n n s n c -t i o n s o n C i r c u i t s a n d S y s t e t m s - 1 1 , 1 1 ( 3 9 ) : 8 2 5 - 8 4 0 , N o v e m n b e r

1 9 9 2 .[ 3 1 H . V a i s h n a v a n i d M a s s o u d P e d r a r n . P C U 1 3 E : A P e t f o r m i i a i n c e

D r i v e n P l a c e m e n i t A l g o r i t h m t i f o r Low P o w e r D e s i g n i . IEEED e s i g n A u t o m a t i o n C o n f e r e n c e , w i t h E u r o - V H D L , p ag e s 7 2 -7 7 , 1 9 9 3 .

( 4 1 G l e n n H o l t a n d A k h i l e s h T y a g i . GEEP: A L o w P o w e r G e n e t i cA l g o r i t h m L a y o u t S y s t e m . IEEE 3 9 t h M i d w e s t S y m p o s i u mo n C i r c u i t s a n d S y s t e m s , 3 : 1 3 3 7 - 1 3 4 0 , A u g u s t 1 9 9 6 .

[ 5 1 S a d i q M . S a i t , H a b i b Y o u s s e f , Aiman A l - M a l e h , a n d M a l i -mood R . M i n h a s . I t e r a t i v e H e u r i s t i c s f o r M u l t i o b j e c t i v e V L S IS t a n d a r d C e l l P l a c e m e n t . INNS-IEEE I n t e r n a t i o n a l J o i n tC o n f e r e n c e on N e u r a l N e t w o r k s ( I J C N N ) , 3 : 2 2 2 4 - 2 2 2 9 , J u l y2 0 0 1 .

[ 6 J S a d i q M . S a i t , Mahmood R . M i n h a s , a n d J u n a i d A . K h a n .P e r f o r m a n c e a n d l o w p o w e r d r i v e n V L S I s t a n d a r d c e l l p l a c e -ment u s i n g Tabu s e a r c h . I n P r o c e e d i n g s o f t h e IEEE C o n g r e s s

o n E v o l u t i o n a r y C o m p u t a t i o n ( C E C ) , 1 : 3 7 2 - 3 7 7 , May 2 0 0 2 .

1 7 1 S a d i q M . S a i t a n d H a b i b Y o u s s e f . VLSI P h y s i c a l D e s i g n A u -t o m a t i o n : T h e o r y a n d P r a c t i c e . M c G r a w - H i l l B o o k Com-p a n y , E u r o p e , 1 9 9 5 .

[ 8 1 S r i n i v a s D e v a d a s a n d S h a r a d M a l i k . A S u r v e y o f O p t i m i z a -t i o n T e c h n i q u e s T a r g e t i n g Low P o w e r V L S I C i r c u i t s . 3 2 n dACM/IEEE D e s i g n A u t o m a t i o n C o n f e r e n c e , 1 9 9 5 .

[ 9 ] R o n a l d R . Y a g e r . On o r d e r e d w e i g h t e d a v e r a g i n g a g g r e g a t i o no p e r a t o r s i n m u l t i c r i t e r i a d e c i s i o n m a k i t n g . IEEE 7 T h a n s a c t i o n to n S y s t e m s , MAN, a n d C y b e r n e t i c s , 1 8 ( 1 ) , J a n i u a r y 1 9 8 8 .

[ 1 0 1 S a d i q M . S a i t a n d H a b i b Y o u s s e f . I t e r a t i v e C o m p u t t e r A l g o -r i t h m s w i t h A p p l i c a t i o n s i n E n g i n e e r i n g : S o l v i n g C o m b i n a -t o r i a l O p t i m i z a t i o n P r o b l e m s . IEEE C o m p u t e r S o c i e t y P r e s s ,C a l i f o r n i a , D e c e m b e r 1 9 9 9 .

1 5 4 3

Authorized licensed use limited to: NATIONAL INSTITUTE OF TECHNOLOGY ROURKELA Downloaded on May 9 2009 at 02:38 from IEEE Xplore Restrictions apply