(Elective - II) : Real Time Systems
(Elective - II) : Real Time Systems
Teaching Scheme : Lectures 4 Hours / ee! %ractical: & Hours/ ee! Examination Scheme: Theor" : 1## $ar!s Term or!: 5#$ar!s 'ral: 5# $ar!s
(nit 1 Intro)uction to *TS +e,inition o, *TS- Issues in real time com.uting /onstraintsStructure o, *TS- T".ical real time a..lications +igital /ontrol -0 Signal %rocessing /haracteri1ing *TS- %er,ormance measures o, *TS .ro.erties o, .er,ormance measure- %er,orma2ilit" cost ,unction an) har) )ea)line Estimating .rogram real time- 3nal"sis o, source co)e- .i.elining)e.en)encies0 (nit & Tas! 3ssignment an) sche)uling (ni.rocessor sche)uling algorithms4*$-E+5-I*ISTas! 3ssignment 3lgorithms4 *$-E)+5-$'S-536- %rece)ence con)itions- 5ault tolerance sche)ulingElements o, $ulti.rocessor sche)uling algorithm0 (nit 7 %rogramming Languages- Tools 8 +ata2ases Language /haracteristics- +ata t".ing- /ontrol structures- 5acilitating hierarchical )ecom.osition- %ac!ages- Error han)ling- 'verloa)ing 8 9enerics- (se o, %'SI: %rogramming 3%I in *TS0 6asic )e,inition o, )ata2ases- *eal Time versus 9eneral %ur.ose )ata2ases- $ain memor" )ata2ases- Transaction .riorities32orts/oncurrenc" control issues- T;o .hase a..roach to im.rove .re)icta2ilit"- $aintaining seriali1ation consistenc"- +ata2ases ,or har) *eal Time S"stems0 (nit 4 *eal Time /ommunication <et;or! to.ologies4 Sen)ing messages- <et;or! architecture issues%rotocol /ontention 2ase) - To!en 2ase) - Sto. 8 9o $ultiho. %rotocol- The %oole) 6us- Hierarchical *oun) *o2in - +ea)line 2ase)5ault tolerant *outing- $3/-*T L3<- /S$3 2ase) +/*- *eal Time communication ;ith .erio)ic an) a.erio)ic messages0 (nit 5 *eal Time '.erating S"stems Time services an) sche)uling mechanism- .rocessor *eserves an) *esource =ernel - '.en S"stems 3rchitecture- /a.a2ilities o, commercial *T'S- %re)icta2ilit" o, general .ur.ose 'S
(nit > 5ault Tolerance an) *elia2ilit" 5ault t".es- )etection- error containment- *e)un)anc"4 Har);areSo,t;are- Time - In,ormation re)un)anc"- +ata )iversit"- *eversal chec!s- $alicious or 6"1antine ,ailures- Integrate) ,ailure han)ling*elia2ilit" mo)els an) har);are re)un)anc" an) so,t;are error mo)els,ault tolerance s"nchroni1ation in har);are an) so,t;are0 '2?ectives :4 To get an overvie; o, )esign an) evaluation issues o, *TS- *eal Time /ommunication an) '.erating S"stems0
References :10 /0$0 =rishna - =ang 90Shin *eal Time S"stems $/ 9ra; Hill International E)ition &0 @ane 0S0Liu *eal Time S"stems- %earson E)ucation 3sia &##1 70 /0Sivaraman $urth" 8 90$animaran *esource $anagement in *eal Time S"stems 8 <et;or! $IT IS6<4 A14J&>A&4& 40 Stuart 6ennet *eal Time /om.uter /ontrol- 3n Intro)uction%earson E)ucation- 3sia &##70
Assignment List REAL TIME SYSTEMS BE (IT) 3ssignment 1 Tra,,ic Light /ontrol S"stem Due Date : !t" #e$ %%& 10 +esign an) )evelo. the co)e ,or controlling tra,,ic lights at an intersection0 /onsi)er an intersection ;ith t;o- t;o4;a" streets0 3 tra,,ic light ;ill normall" 2e green ,or 9 secon)s- "ello; ,or B secon)s an) re) ,or * secon)s0 +uring the night ,or a certain .erio) o, time- the intersection ;ill automaticall" sus.en) normal service an) its lights ;ill ,lash "ello;0 a0 +evelo. an o2?ect oriente) )esign0 20 (sing .rogramming language0 c0 $a!e suita2le assum.tions an) state them clearl"0 10 %er,ormance anal"sis an) *un time estimation o, the S"stem a0 +e,ine accom.lishment levels ,or the s"stem an) calculate its .er,orma2ilit"0 20 3nal"1e the source co)e to estimate the execution time o, )i,,erent mo)ules0 c0 $a!e suita2le assum.tions an) state them clearl"0 70 Exten) the .art one o, assignment 1- 2" a))ing .ush 2utton ;al! signals at the tra,,ic intersection0 3 .ush 2utton ;al! signal ;or!s as ,ollo;s: ;henever a .erson ;ants to cross a roa)- he .ushes the a..ro.riate 2utton on his si)e o, the roa) an) ;ithin a time .erio) - his ;al! signal turns green0 hile his signal is green- the tra,,ic on the remaining roa)s shoul) 2e allo;e) to continue as a..ro.riate0 There ;ill 2e A such 2uttons in our scenario0 40 Im.lement the t;o contention 2ase) .rotocols taught in class CDirtual Time /S$3C (DT/S$3 4 L) an) C in)o; %rotocolC0 /om.are their .er,ormances in terms o, the num2er o, .ac!ets that meet their )ea)lines0
In 2oth cases- !ee. the num2er o, no)es an) the seEuence o, .ac!ets (along ;ith their )ea)lines) same- so that their .er,ormances can 2e com.are)0 *un DT/S$3 ,or 7 )i,,erent values o, the virtual cloc! rate an) the ;in)o; .rotocol ,or 7 )i,,erent values o, the initial ;in)o; si1e0 $a!e suita2le assum.tions i, reEuire) an) state them clearl"0 The co)ing can 2e )one in an" language o, "our choice0
50 rite a re.ort on CHar) *eal4Time +ata2asesC0 +escri2e ho; "ou ;oul) construct a har) real4time )ata2ase- ;here missing o, even a single )ea)line is unacce.ta2le0 $ention the ,eatures "ou ;oul) .rovi)e an) ex.lain ho; "ou ;oul) im.lement them