Interface Design for Rationally Clocked GALS Systems

Size: px

Start display at page:

Download "Interface Design for Rationally Clocked GALS Systems"

Hortense Brown
8 years ago
Views:

1 Intefae Deign fo Rationally Cloked GALS Sytem Joyee Mekie, Supatik Chakaboty, Giih Venkataamani,.S. Thiagaajan, D.K. Shama Mah 15, 2006

2 Motivation SoC : integation of pedeigned I oe Rationally loked ytem CK1 / CK2 = m/n Intefae equiement Eo fee I I I I I Flow ontol Sytem potool infomation I I I Simplifiation in intefae deign

3 Exiting wok Rationally loked ytem [Samenta, A. Chakaboty] Aynhonou ytem Stoppable loking heme [Meehmitt, Spoull, Chapio, Yun, Muttebah] -module [Roenbege] ipeline ynhonize [Seizovi] Multi-ynhonou/meohonou ytem Adaptive ynhonize [Ginoa] STARI [Geenteet] Obliviou to potool infomation!

Chapio, Yun, Muttebah] -module [Roenbege] ipeline ynhonize [Seizovi]

4 oblem tatement Intefae fo ationally loked ytem Fee of ynhonization eo Ue potool infomation Chek fo flow ontol Simplify intefae deign

5 Teminology S * 2T R SU H 3T S : Sende R : Reeive 6T = lm lok S and R lok phae loked at 0 * : Unafe Cyle (S to R) SU = etup time H = hold time T = gd lok

6 Nethat baed Fomalim Nethat : High level eti net epeentation [Mukund, 2003] 3T 2T 3T = lok peiod of 2T = lok peiod of T = gd/bae lok Aume : 3T and 2T yn. with T

7 Delay augmented Nethat Communiation Tanition: a : mg fom to b : mg fom to 3T a b 2T Computation Tanition: : 1 omputation yle of 3T : 2 omputation yle of 2T eah + = non-deteminiti omputation time 1 a b 2

8 Deied output fom analyi To detemine : 3T a b 2T If numbe of meage toed in intefae exeed a pe-defined limit a when meage ae ent (end intant) 1 b 2

9 opoed flow Nethat epeentation Captue potool Expanded Nethat Embed Clok atio State pae gen. + Reahability analyi Buffe oveflow? Mg ent on i th intant?

10 Buffe & Cyli lae Buffe plae: Fo eah hannel Collet a token fo eah meage ent Loe a token fo eah meage ed. Time of token enty = end intant 3T 1 a b yli plae 2T 2 Cyli plae One token pe poe buffe plae

11 Behavio of and module 1 2 3T 2T 0 T i 3T i+1 i+2

12 Behavio of and module 1 2 3T 2T T 3 4 T i

13 Expanded eti Net 1 2 Token alway move fom one yli plae to it ueo yli plae 3:2

14 Expanded eti Net with additional yle 1 2 3:2

15 Expanded eti Net fo :2

16 Cheking fo buffe oveflow Geneation of tate pae State pae exploation and eahability analyi Temination ondition Given : n = max. bound, If buffe plae token > n : Repot Oveflow! Ele, omplete pae exploed : Repot no oveflow

17 Deteting end intant 0,a 1,b 1,0,0 b 1 b 8 a 8 a 9 a 1 b 9 a 2 b 7 a 10 a 3 b 2 a4 b 3 b 6 a 11 a 7 a 6 a 5 b 4 b 5 3T 2T

18 Deteting end intant 0,a 1,b 1,0,0 1,a 2,b 9,1,0 b 1 b 8 a 8 a 9 a 1 b 9 a 2 b 7 a 10 a 3 b 2 a4 b 3 b 6 a 11 a 7 a 6 a 5 b 4 b 5 3T 2T

19 Deteting end intant 0,a 1,b 1,0,0 5,a 9,b 9,0,0 1,a 2,b 9,1,0 4,a 8,b 1,0,0 b 1 b 8 a 8 a 9 a 1 b 9 2,a 3,b 1,1,0 3,a 7,b 8,0,0 a 10 a 2 a 3 b 2 b 7 3,a 4,b 2,0,0 2,a 6,b 7,0,0 a4 b 3 b 6 a 11 4,a 10,b 3,0,0 1,a 5,b 6,0,0 a 7 a 6 a 5 b 4 b 5 3T 2T 5,a 11,b 4,0,1 0,a 4,b 5,0,1

20 Deteting end intant b 1 b 8 a 8 a 9 a 1 b 9 a 10 a 2 a 3 b 2 b 7 a4 b 3 b 6 a 11 1,a 5,b 6,0,0 b 5 3T 2T 5,a 11,b 4,0,1 0,a 4,b 5,0,1 a 7 a 6 a 5 b 4

21 Deteting Send intant with SU 5,a 11,b 4, {1,2} b 1 b 8 a 8 a 9 a 1 b 9 a 2 b 7 a 10 a 3 b 2 a4 b 3 b 6 3T a 11 2T a 7 a 6 a 5 b 4 b 5 SU = 2

22 Deteting Send intant with SU 5,a 11,b 4, {1,2} b 1 b 8 0,a 4,b 5, {1,1} a 8 a 9 a 1 b 9 a 2 b 7 a 10 a 3 b 2 a4 b 3 b 6 3T a 11 2T a 7 a 6 a 5 b 4 b 5

23 Deteting Send intant with SU 5,a 11,b 4, {1,2} b 1 b 8 0,a 4,b 5, {1,1} a 8 a 9 a 1 b 9 a 2 b 7 1,a 10,b 6, {1,0} a 10 a 3 a4 b 2 b 3 b 6 3T a 11 2T a 7 a 6 a 5 b 4 b 5

24 Deteting Send intant with SU 5,a 11,b 4, {1,2} b 1 b 8 0,a 4,b 5, {1,1} a 8 a 9 a 1 b 9 a 2 b 7 1,a 10,b 6, {1,0} a 10 a 3 a4 b 2 b 3 b 6 2,a 11,b 7, {1,0} 3T a 11 2T a 7 a 6 a 5 b 4 b 5 3,a 4,b 8, {1,0} 4,a 5,b 1, {0,0} Rev. tanition fie when: SU-ount = 0 & token > 0

25 Intefae Analyi to Deign Nethat epeentation NuSMV Model NuSMV Analyi Intefae deign Selet delay pad No OF 1.Chek Buffe oveflow 2. Send intant 3. Co. Reeive intant OF Repot Oveflow

26 Intefae Deign Data Sende Reeive C Seletion Ciuit C Delay pad : Detet and Coet fo unafe intant Implementation fo n = 1 Aumption : Data emain on data bu till next end intant

27 Intefae Deign Data Sende ND pnd Reeive C Seletion Ciuit C Delay padding ontol line intead of data line

28 Intefae Deign Data Sende ND pnd Reeive C Seletion Ciuit C Optimization : meging appopiate delay ange

29 Intefae Deign Data Sende ND ule gen pnd SR lath Reeive C Seletion Ciuit ule gen C

30 Cae Study : MEG2 enode hip [M.Ikeda et al, 1999]

31 Cae Study Reult of automated analyi : Total Intefae (Data + Contol) : 22 Intefae not eqd fo Synhonou I oe : 10 Intefae obviated due to potool : 11 Ou Contibution Total Intefae to be implemented : 1 Buffeing not equied : n = 1 fo all intefae Total Int. Synh. Int. Obviated Int. Impl. Analyi time DDC < 1 e MEG < 1 e MEG < 1 e

32 Compaion with Samenta et al appoah DDC MEG2 1 MEG2-2 otool baed appoah Samenta et al [1995] Samenta et al appoah - Independent of potool - Moe hadwae - Double buffeing : owe hungy olution - May affet pefomane

33 efomane ompaion 1 A m 2:3 B Samenta et al : 2 Meage pe 12T Ou Appoah : 3 Meage pe 12T Samenta et al A B m1 m1 m2 m2 m m1 m2 Ou appoah A B m1 m2 m3 m m1 m2 m3

34 Conluion otool awaene implifie intefae deign Ou appoah Nethat baed Fully automatable Fo ational lok No ynhonization eo High pefomane Flow ontol handled by potool Extenion Robutne to jitte & VT vaiation Initialization (oinident edge)

35 Teh Repot TR available fom Detail of thi wok Mino oetion to Table 1 and Fig. 6

37 Modeling in NuSMV NuSMV model :,,,, Clok Synhonou ompoition Reahability analyi fo finding Buffe oveflow : EF (pq.ount > 1) end intant EF (p.end = 1 &.lk = 18) Unafe end intant : mg violate SU-H ontaint 3 18T 19T 2

38 NuSMV analyi Automated analyi eult : Buffe oveflow: to : no buffe oveflow, n = 1 to : no buffe oveflow, n = 1 Deteting Send intant to : {0, 126, 234} to : {38, 152, 266} No unafe end intant No intefae equied!

39 Deteting Send intant with SU 0,a 1,b 1,{0,0},{0,0} 5,a 9,b 9,{0,0},{0,0} 1,a 2,b 9,{1,1},{0,0} 2,a 3,b 1,{1,0},{0,0} 4,a 8,b 1,{0,0},{0,0} 3,a 7,b 8,{0,0},{0,0} SU = 1 SU = 1 3,a 4,b 2,{0,0},{0,0} 2,a 6,b 7,{0,0},{0,0} 4,a 10,b 3,{0,0},{0,0} 1,a 5,b 6,{0,0},{0,0} 5,a 11,b 4,{0,0},{1,1} 0,a 4,b 5,{0,0},{1,0} Rev. tanition fie when : SU-ount = 0, token>0

Chapter 30: Magnetic Fields Due to Currents

Chapter 30: Magnetic Fields Due to Currents d Chapte 3: Magnetic Field Due to Cuent A moving electic chage ceate a magnetic field. One of the moe pactical way of geneating a lage magnetic field (.1-1 T) i to ue a lage cuent flowing though a wie.