termination suspend (swap-out) executing CPU Scheduling phases (non real-time) pre-emption or cycle done unblock ready, suspended
|
|
- Pamela Wilkerson
- 6 years ago
- Views:
Transcription
1 76 eal-tme & Embedded Sysems 7 Uwe. Zmmer - The Ausrala aoal Uversy 79 Deployme eal-tme Sysems A schedulg scheme provdes wo feaures: Orderg he use of resources (e.g. PUs, ewors) a lve sysem. Predcg he wors-case behavour of he sysem whe he schedulg algorhm s appled. The predco ca he be used: a comple-ru: o cofrm he overall emporal requremes of he applcao. a ru-: o perm accepace of addoal usagereservao requess. Uwe. Zmmer, The Ausrala aoal Uversy page 79 of 96 (chaper 7: up o page 8) 7 phases (real-) pre-empo or cycle doe bach ready creao admed dspach execug PU ermao ubloc Admace accordg o schedulably Dspachg ad Pre-Empo accordg o deadles, prores, or ules bloced bloc or sychroze Uwe. Zmmer, The Ausrala aoal Uversy page 7 of 96 (chaper 7: up o page 8) 77 efereces for hs chaper [Burs7] Ala Burs ad Ady Wellgs ocurre ad eal-tme Programmg Ada ambrdge Uversy Press (7) [Murhy] S Murhy, G Mamara esource Maageme eal Sysems ad ewors MIT Press, ambrdge, Massachues, odo, Eglad () Uwe. Zmmer, The Ausrala aoal Uversy page 77 of 96 (chaper 7: up o page 8) 7 Sac versus Dyamc eal-tme Sysems gd: All schedules are se off-le. Full predcably (may hgh egry real- sysems). Sac: Schedule relaos are sacally ordered off-le. Predcable respose o dsurbaces (may real- sysems). Dyamc: Schedules deped o ru- suao. More flexble, more effce (mos sof real- sysems). Uwe. Zmmer, The Ausrala aoal Uversy page 7 of 96 (chaper 7: up o page 8) 7 Assumpos A smple process model The umber of processes he sysem s fxed. All processes are perodc ad all perods are ow. All processes are depede. The as-swchg overhead s eglgble. All deadles are decal wh he process cycle s (perods). The wors case execuo s ow for all processes. All processes are released a oce. Ths model ca oly be appled o a specfc group of hard real- sysems. (Exesos o hs model wll be dscussed laer hs chaper). Uwe. Zmmer, The Ausrala aoal Uversy page 7 of 96 (chaper 7: up o page 8) 78 Movao eal-tme Sysems ocurrecy may lead o o-deermsm. o-deermsm may mae harder o predc he mg behavour. eal-tme- schemes reduce o-deermsm. Uwe. Zmmer, The Ausrala aoal Uversy page 78 of 96 (chaper 7: up o page 8) 7 phases (o real-) pre-empo or cycle doe bach ready creao admed dspach execug PU ermao ubloc susped (swap-ou) ready, suspeded susped (swap-ou) swap- bloced, suspeded ubloc swap-ou bloced bloc or sychroze Uwe. Zmmer, The Ausrala aoal Uversy page 7 of 96 (chaper 7: up o page 8) 7 eal- schedulg Tas se (6, 8) (, ), ), ) Uwe. Zmmer, The Ausrala aoal Uversy page 7 of 96 (chaper 7: up o page 8)
2 (6, 8) 7 Uwe. Zmmer, The Ausrala aoal Uversy = Maxmal ulzao eal- schedulg: Earles Deadle Frs Uwe. Zmmer, The Ausrala aoal Uversy page 7 of 96 (chaper 7: up o page 8) G ae moooc orderg s opmal ( he framewor of fxed prory schedulers): f a process se s schedulable uder a FPS-scheme, he s also schedulable uder FPS wh rae moooc prores., ) G Sac scheme, sce he order dspach order of processes s fxed ad calculaed off-le. Uwe. Zmmer, The Ausrala aoal Uversy, ) (, ) G Pre-empve scheme. A ru-: dspach he ruable process wh he hghes prory. page 7 of 96 (chaper 7: up o page 8) Uwe. Zmmer, The Ausrala aoal Uversy, ), ) (, ) page 7 of 96 (chaper 7: up o page 8) page 7 of 96 (chaper 7: up o page 8) G If deadles D are decal o cycle s T for each as he: The maxmal ulzao for EDF becomes: T # (suffce ad ecessary es) T, ),, ), ( (, ) (, (6, ( 66, 8) 7 page 77 of 96 (chaper 7: up o page 8) Avod uecessary as swches. Dspach by as d (ou of he currely qualfyg processes). Uwe. Zmmer, The Ausrala aoal Uversy Execue FPS schedule G Fals! Tas se Fxed Prory (FPS), rae moooc eal- schedulg: Fxed Prory (6, 8) 7 page 79 of 96 (chaper 7: up o page 8) G I he example: Wors case respose s are decal o cycle s. Uwe. Zmmer, The Ausrala aoal Uversy eal- schedulg: Fxed Prory page 78 of 96 (chaper 7: up o page 8) espose : Tme from schedule reques o process compleo. G If mulple deadles cocde, oher meas are eeded o selec a process,.e. T, ) Execue EDF schedule G Wors! eal- schedulg: Earles Deadle Frs eal- schedulg. Each process s assged a fxed prory accordg o s cycle : T T & P P 7 Uwe. Zmmer, The Ausrala aoal Uversy Gves a dea how crcal he schedule s. T, ) T, ),, ), ) (6, ( 6, 8) (, ) (, (, ) Wors case respose s Tmes o deadles page 76 of 96 (chaper 7: up o page 8) eal- schedulg: Earles Deadle Frs 79 Uwe. Zmmer, The Ausrala aoal Uversy eal- schedulg: Earles Deadle Frs page 7 of 96 (chaper 7: up o page 8) sce he dspached process s seleced a ru-, due o he curre deadles. G Dyamc scheme, (6, 8) 78 Uwe. Zmmer, The Ausrala aoal Uversy T, ),, ), ( 66, 8) (6, (, ( (, ) G Pre-empve scheme. a. ul fshes. b. ul aoher process deadle s foud earler he he curre oe.. Execue hs process 77, ) Earles Deadle Frs (EDF) Deadles. Deerme (oe of) he process(es) wh he earles deadle. eal- schedulg eal- schedulg 76 (, ) (6, 8) 7
3 , ) = page 7 of 96 (chaper 7: up o page 8) (6, 6) page 78 of 96 (chaper 7: up o page 8) G Ulzao es fals, schedulably o guaraeed. page 76 of 96 (chaper 7: up o page 8) G Ulzao es succeeds, schedulably guaraeed. T = = ( - ) U max = page 76 of 96 (chaper 7: up o page 8) G Ulzao es succeeds, schedulably guaraeed. T = = ( - ) U max Uwe. Zmmer, The Ausrala aoal Uversy U T, ),, ) (, ) (, = (6, ) 76 = page 76 of 96 (chaper 7: up o page 8) G Ulzao es succeeds, schedulably guaraeed. T = = ( - ) U max Uwe. Zmmer, The Ausrala aoal Uversy U, ), ) (, ) page 79 of 96 (chaper 7: up o page 8) G Ulzao es fals, schedulably o guaraeed. 6 T = =.87 >.779. ( - ) U max Uwe. Zmmer, The Ausrala aoal Uversy U, ) Execue FPS schedule G Wors!, ) Execue FPS schedule G Wors! (66, ) (6, 76 6 T = =.87 >.779. ( - ) U max (, ) Furher reduced as se = Uwe. Zmmer, The Ausrala aoal Uversy U T, ) page 76 of 96 (chaper 7: up o page 8) G Ulzao es fals, schedulably o guaraeed. Uwe. Zmmer, The Ausrala aoal Uversy 79 T = >.779. ( - ) U max eal- schedulg: Fxed Prory Uwe. Zmmer, The Ausrala aoal Uversy U 6 = eal- schedulg: Fxed Prory, ) U eal- schedulg: Fxed Prory page 77 of 96 (chaper 7: up o page 8) (, ) (6, ) G Ulzao es fals, schedulably o guaraeed. Uwe. Zmmer, The Ausrala aoal Uversy 76 6 T = =.87 >.779. ( - ) U max,,, ), ) (6, (66, 6) = Execue FPS schedule G Wors! 9 Execue FPS schedule G Wors! ((, (,, )) U umber of processes, ), ) (, ) educed as se (6, 8) eal- schedulg: Fxed Prory 78, ) T # ( - ) U max G Suffce, ye o ecessary es Uwe. Zmmer, The Ausrala aoal Uversy..6 page 7 of 96 (chaper 7: up o page 8) (, ) = wh he compuao ad T he legh of he perod for as ou of ass ad assumg ha he deadle D = T U Execue FPS schedule G Fals! Maxmal ulzao eal- schedulg: Fxed Prory eal- schedulg: Fxed Prory eal- schedulg: Fxed Prory 76 eal- schedulg: Fxed Prory 7 (6, 6) 77 Uwe. Zmmer, The Ausrala aoal Uversy, ) (, ), ) Execue FPS schedule G Fals! eal- schedulg: Fxed Prory (6, 8) 7 Maxmal uly
4 76 eal- schedulg: Fxed Prory Wors case respose s (6, ) (, ), ), ) for he hghes prory as: = Uwe. Zmmer, The Ausrala aoal Uversy page 76 of 96 (chaper 7: up o page 8) 766 eal- schedulg: Fxed Prory espose aalyss T = + e o $ > Fxed -po equao + ecurre form: = + f p $ wh: = > T + Ierae he recurre form ul: = + or > D Uwe. Zmmer, The Ausrala aoal Uversy page 766 of 96 (chaper 7: up o page 8) 769 eal- schedulg: Earles Deadle Frs espose aalyss () () a T a a a+ T- T = ; + E + * f p T, * > H T +! m max $ Fxed -po equao ecurre form: () + () a T a a a+ T- T = ; + E + * f p T, *, > H T +! m max $ wh: = a + + Ierae ul: () a = () a + or () a > a+ D Uwe. Zmmer, The Ausrala aoal Uversy page 769 of 96 (chaper 7: up o page 8) 76 eal- schedulg: Fxed Prory Wors case respose s (6, ) (, ), ), ) for ohers ass: = + I (erferece from hgher prory ass) Uwe. Zmmer, The Ausrala aoal Uversy page 76 of 96 (chaper 7: up o page 8) 767 eal- schedulg: Earles Deadle Frs espose aalyss The wors case for Earles Deadle Frs s o ecessarly whe all ass are released a oce! All possble release combaos a full hyper-cycle eed o be cosdered! The respose s are bouded by he cycle s as log as he maxmal ulzao s #. Oher ass eed o be cosdered oly, f her deadle s closer or equal o he curre as. Uwe. Zmmer, The Ausrala aoal Uversy page 767 of 96 (chaper 7: up o page 8) 77 eal- schedulg: Earles Deadle Frs espose aalyss () () a T a a a+ T- T = ; + E + * f p T, * > H T +! m max $ Fxed -po equao = max " () a - a, a! A where A = scm ( T ) Uwe. Zmmer, The Ausrala aoal Uversy page 77 of 96 (chaper 7: up o page 8) 76 eal- schedulg: Fxed Prory Wors case respose s (6, ) (, ), ), ) for ohers ass: = + e o $ > T Uwe. Zmmer, The Ausrala aoal Uversy page 76 of 96 (chaper 7: up o page 8) 768 eal- schedulg: Earles Deadle Frs espose aalyss () () a T a a a+ T- T = ; + E + * f p T, > H T +! m $ Uwe. Zmmer, The Ausrala aoal Uversy page 768 of 96 (chaper 7: up o page 8) 77 eal- schedulg: Fxed Prory Wors case respose s (6, ) (, ), ), ) = # ; = # ; = # 6 ; T # ( - ) = Uwe. Zmmer, The Ausrala aoal Uversy page 77 of 96 (chaper 7: up o page 8),,
5 ; = # T # = = T # T "^T, h, = "^6, 6h, ^, h, ^, h, Uwe. Zmmer, The Ausrala aoal Uversy "^T, h, = "^6, h, ^, h, ^, h, # ( - ) = Ulzao Tes > e ",,, ",,, o T $ " #,,, + espose Tmes ", T # max ", 6,, ", 8,, " 6,,, $ (a) - a.a! A page 778 of 96 (chaper 7: up o page 8) = espose Tmes ", Earles Deadle Frs Ulzao Tes G EDF ca hadle hgher (full) ulzao ha FPS. Uwe. Zmmer, The Ausrala aoal Uversy page 779 of 96 (chaper 7: up o page 8) G EDS: O() ulzao es respose aalyss: fxed po equao hyper-cycle G FPS: O() ulzao es respose aalyss: fxed po equao espose aalyss ad ulzao ess: G EDF: ay process ca mss s deadle G ad ca rgger a cascade of faled deadles. G FPS: processes wh lower prores wll always mss her deadles frs. Graceful degradao (resource s over-booed): G FPS s easer o mpleme ad mples less ru- overhead ; = 6 # Tass are perodc 78 Uwe. Zmmer, The Ausrala aoal Uversy = #, ) ; = # 6 Uwe. Zmmer, The Ausrala aoal Uversy Wors case execuo s are ow Pre-empve schedulg T # page 78 of 96 (chaper 7: up o page 8) Deadles are decal wh as s perod (D = T ) Tass are depede = page 777 of 96 (chaper 7: up o page 8) ; Wors case respose s eal- schedulg: Earles Deadle Frs page 77 of 96 (chaper 7: up o page 8) Smplsc Assumpos Fxed Prory, ) Fxed Prory Earles Deadle Frs page 776 of 96 (chaper 7: up o page 8) ; (, ) (6, ) espose Tme Aalyss ; = # GTesg all combaos a hyper-cycle: = max " (a) - a,a! A where A = scm ) eal-world Exeso 779 ; = 8 # Uwe. Zmmer, The Ausrala aoal Uversy = #, ) Wors case respose s eal- schedulg: omparso ; page 77 of 96 (chaper 7: up o page 8) ; = 6 # 6 eal- schedulg: Earles Deadle Frs Uwe. Zmmer, The Ausrala aoal Uversy T, ),, ), (, ( (, ) ( 66, 8) (6, 77 eal- schedulg: omparso "^T, h, = "^6, 8h, ^, h, ^, h, 778 ; = # Uwe. Zmmer, The Ausrala aoal Uversy = # (,, ),, ) T, ) (6, ( 6) ( (, ) (, ) (, Wors case respose s page 77 of 96 (chaper 7: up o page 8) Wors case respose s 776 Uwe. Zmmer, The Ausrala aoal Uversy ; = # ; = 9 6 ; T ( - ) = eal- schedulg: Earles Deadle Frs page 77 of 96 (chaper 7: up o page 8) = #, ) eal- schedulg: Earles Deadle Frs ; = # 6 ; T ( - ) = (6, (66, 8) 77 Uwe. Zmmer, The Ausrala aoal Uversy = #, ), ), ) (, ) (6, 8) Wors case respose s Wors case respose s ( ) (, eal- schedulg: Fxed Prory eal- schedulg: Fxed Prory 77 ( 6) (6, 77
6 G we wll roduce (brefly) cooperave schedulg Uwe. Zmmer, The Ausrala aoal Uversy page 787 of 96 (chaper 7: up o page 8) Seg a deferrable server as as a proxy for sporadc aperodc ass o hghes prory level., ) Uwe. Zmmer, The Ausrala aoal Uversy page 788 of 96 (chaper 7: up o page 8) G Hard real- ass are sll schedulable wh he server as deployg s full legh. T, ),,, ) -, ) - page 78 of 96 (chaper 7: up o page 8) FPS server as as ormal as (66, 7) ( (6, 788 Uwe. Zmmer, The Ausrala aoal Uversy Sporadc aperodc as se o lowes prory., ) Iroducg g a server as o hghes g p proryy page 78 of 96 (chaper 7: up o page 8) Sporadc ad Aperodc Processes Sporadc ad Aperodc Processes (6, 7) 787 Uwe. Zmmer, The Ausrala aoal Uversy, ), ) (, ) (6, 7) Iroducg g a sof real- as page 78 of 96 (chaper 7: up o page 8) G we wll roduce faul olera schedulg FPS for hard real- ass, ) G we wll roduce (brefly) cooperave schedulg Sporadc ad Aperodc Processes 78 Uwe. Zmmer, The Ausrala aoal Uversy G we wll roduce arbrary deadles G we wll roduce schedules for eracg ass Wors case execuo s are ow Pre-empve schedulg Tass are depede Sporadc ad Aperodc Processes page 78 of 96 (chaper 7: up o page 8) G we wll roduce faul olera schedulg G we wll roduce sporadc ad aperodc processes Deadles are decal wh as s perod (D = T ) (6, 7) 78 Uwe. Zmmer, The Ausrala aoal Uversy G we wll roduce arbrary deadles G we wll roduce schedules for eracg ass Wors case execuo s are ow Pre-empve schedulg Tass are depede Deadles are decal wh as s perod (D = T ) G we wll roduce sporadc ad aperodc processes G More ealsc Assumpos Tass are perodc G More ealsc Assumpos eal-world Exeso 78 eal-world Exeso Tass are perodc 78 - Uwe. Zmmer, The Ausrala aoal Uversy page 789 of 96 (chaper 7: up o page 8) Deferrable server as oly deployg f here are requess from he sporadc aperodc as. Sporadc as ulzg deferrable server page 786 of 96 (chaper 7: up o page 8) Sporadc ad Aperodc Processes G Schedule mus also wor wll less erferece. T, ) (,, ) ( 66, 7) (6, (, (, ) 789 G espose s for sporadc aperodc as ca be large. Uwe. Zmmer, The Ausrala aoal Uversy FPS lowes prory for sof real- as Sporadc ad Aperodc Processes page 78 of 96 (chaper 7: up o page 8) Sporadc aperodc as does o erfere wh hard real- ass. T, ), ) (6 (6, 7) (, ) ( 786 Uwe. Zmmer, The Ausrala aoal Uversy, ), ) Hard real- ass Sporadc ad Aperodc Processes (6, 7) 78
7 Sporadc as ulzg EDF server Sporadc ad Aperodc Processes page 79 of 96 (chaper 7: up o page 8) Tass wh D < T (Deadle earler ha cycle ) page 796 of 96 (chaper 7: up o page 8) Ay as se Q whch s schedulable by a FPS scheme W, s also schedulable uder DMPO. Deadle Moooc Prory Orderg (DMPO) ae Moooc Prory Orderg (MPO) Uwe. Zmmer, The Ausrala aoal Uversy emma: o: hage from: page 79 of 96 (chaper 7: up o page 8) Tass wh arbrary deadles I case of fxed prory schedulg (FPS): 796 Uwe. Zmmer, The Ausrala aoal Uversy G Swf respose s for he sporadc aperodc ass wh deadles pushed o her lms. T, ),, ), ((6, ( (6 66, 7)) (, (,, ) 79 Uwe. Zmmer, The Ausrala aoal Uversy G Mmal er-arrval-s owledge s employed. G Ierferece level less or equal o a deferrable server. A sporadc server oly repleshes afer a fxed afer s acual deployme. orad aad dc d Server Hard Sporadc, ),,, ) Sporadc as ulzg sporadc server Sporadc ad Aperodc Processes (( 66, 7) (6, ((, (, ), 79 ED ED ED Iroducg g a EDF server Sporadc ad Aperodc Processes eal-world Exeso page 79 of 96 (chaper 7: up o page 8) G we wll roduce (brefly) cooperave schedulg Uwe. Zmmer, The Ausrala aoal Uversy page 797 of 96 (chaper 7: up o page 8) G Wl: erferes oly oce wh G l = # D D & l D W: # D D # T & T meag ha erfered oly oce wh also: released oce, ad c. s schedulable Wl because: b. s schedulable Wl because Pl > P & l # # D & l # D a. All! Q wh P P or P P are uaffeced.. Wl schedules Q because:. Geerae Wl by swappg P ad P G _ P l P l _ D D G DMPO D T W Uwe. Zmmer, The Ausrala aoal Uversy W: D D # T & D T D T page 798 of 96 (chaper 7: up o page 8) Swap p wo p prores ou of W whch volae DMPO: Swap wo prores ou of W whch volae DMPO: page 79 of 96 (chaper 7: up o page 8) G we wll roduce faul olera schedulg Proof of DMPO opmaly 798 Uwe. Zmmer, The Ausrala aoal Uversy G we wll roduce arbrary deadles G we wll roduce schedules for eracg ass Wors case execuo s are ow Pre-empve schedulg Tass are depede Deadles are decal wh as s perod (D = T ) G we wll roduce sporadc ad aperodc processes G More ealsc Assumpos Tass are perodc 79 Uwe. Zmmer, The Ausrala aoal Uversy The EDF equvale o a deferrable server: a perodc server as wh a mmedae deadle., ), ) (6, 7) 79 Proof of DMPO opmaly page 79 of 96 (chaper 7: up o page 8)., are wo ass Q wh P P ad D D W G JDMPO 797 Uwe. Zmmer, The Ausrala aoal Uversy G Deadles explcly pushed o her lms durg he ED phases. ED Earles Deadle as (ED) for sporadc ass Sporadc ad Aperodc Processes page 79 of 96 (chaper 7: up o page 8) Earles Deadle as schedulg (whle sll eepg all deadles) whe sporadc aperodc ass are o be scheduled., ) (,,, ) ( 66, 7)) ( (6 (6, (, ( (, ) 79 Uwe. Zmmer, The Ausrala aoal Uversy G Pushes he hard real- ass o her deadles. Sar he sporadc aperodc ass o hgh prory ad demoe hem for he hard real- ass o complee (G dyamc schedulg scheme). T, ),, ) (, (, ) (, (, ) FPS wh dual prores Sporadc ad Aperodc Processes (6, 6 7) 7 (6, 79 orad o raaad dcc d Sporadc Hard Spo Server Hard Sporadc
8 799 Proof of DMPO opmaly Swap wo prores ou of W whch volae DMPO: W T T D D W: # D D # T & T erfered oly oce wh also: released oce, ad Uwe. Zmmer, The Ausrala aoal Uversy page 799 of 96 (chaper 7: up o page 8) 8 Proof of DMPO opmaly Swap all prores ou of W whch volae DMPO: Swap all, Q, wh _ P > P _ D > D W resulg all, Q wh P > P o have D < D osug he DMPO scheme Sce each swappg operao eep schedulably, he resulg DMPO scheme s also schedulable. Deadle moooc orderg s opmal: (f a process se s schedulable uder a FPS-scheme, he s also schedulable uder FPS wh deadle moooc prores.) Uwe. Zmmer, The Ausrala aoal Uversy page 8 of 96 (chaper 7: up o page 8) 8 eal-world Exeso More ealsc Assumpos Tass are perodc we wll roduce sporadc ad aperodc processes Deadles are decal wh as s perod (D = T ) Tass are depede Pre-empve schedulg Wors case execuo s are ow we wll roduce arbrary deadles we wll roduce schedules for eracg ass we wll roduce (brefly) cooperave schedulg we wll roduce faul olera schedulg Uwe. Zmmer, The Ausrala aoal Uversy page 8 of 96 (chaper 7: up o page 8) 8 Proof of DMPO opmaly Swap wo prores ou of W whch volae DMPO: W W' T T T T D D D D W: # D D # T & T erfered oly oce wh also: released oce, ad Wl: Uwe. Zmmer, The Ausrala aoal Uversy page 8 of 96 (chaper 7: up o page 8) 8 Tass wh arbrary deadles Tass wh D > T (Deadle laer ha cycle ) Assumpo: every as s released oly afer he former release of s compleed. I case ha > T for a specfc schedulg suao, he followg release of as s delayed by - T. Md ha > T cao hold for all release suaos, oherwse he as s o schedulable. The wors case respose ^ h mgh hus be loger ha T bu mus sll be shorer ha D. Uwe. Zmmer, The Ausrala aoal Uversy page 8 of 96 (chaper 7: up o page 8) 86 Idepede ass 8, 8), ) (6, ), ) Deadles decal o cycle s DMPO or MPO. Uwe. Zmmer, The Ausrala aoal Uversy page 86 of 96 (chaper 7: up o page 8) 8 Proof of DMPO opmaly Swap wo prores ou of W whch volae DMPO: W W' T T T T D D D D ' ' W: # D D # T & T erfered oly oce wh also: released oce, ad Wl: erferes oly oce wh l= # D D & l D Uwe. Zmmer, The Ausrala aoal Uversy page 8 of 96 (chaper 7: up o page 8) 8 Tass wh arbrary deadles Tass wh D > T (Deadle laer ha cycle ) Assumpo: every as s released oly afer he former release of s compleed. Sce he respose ca ow be poeally greaer ha he cycle T: more ha oe release q of he as eeds o be cosdered: ( q) = B+ q+ e ( q) T o where 6 q q) -( q- ) T # D ( > B s he blocg ; q s he umber of releases. = % ( q) - ( q - ) T q! " f q max, ad max ( q) qmax = ' q q # T Uwe. Zmmer, The Ausrala aoal Uversy page 8 of 96 (chaper 7: up o page 8) 87 Idepede ass 8, 8), ) (6, ), ) Schedulable uder DMPO or MPO. Uwe. Zmmer, The Ausrala aoal Uversy page 87 of 96 (chaper 7: up o page 8)
9 88 Tas depedeces 8, 8), ) (6, ), ) oc requess by wo ass. Uwe. Zmmer, The Ausrala aoal Uversy page 88 of 96 (chaper 7: up o page 8) 8 Prory herace Maxmal blocg for as : B = usage (,) r () r wh: deog he umber of crcal secos. usage (,) r beg a boolea fuco reurg for rue ad dcag he r s used by: a leas oe wh P < P ad a leas oe wh P $ P () r deog he wors case compuao crcal seco r Each as ca oly be bloced oce for each employed resource! Uwe. Zmmer, The Ausrala aoal Uversy page 8 of 96 (chaper 7: up o page 8) 8 Tas depedeces wh mulple locs 8, 8), ) (6, ), ) Uwe. Zmmer, The Ausrala aoal Uversy page 8 of 96 (chaper 7: up o page 8) 89 Tas depedeces 8, 8), ) (6, ), ) The lower prory as blocs he hgher prory as. (oe ha he blue as s uaffeced.) Prory verso Uwe. Zmmer, The Ausrala aoal Uversy page 89 of 96 (chaper 7: up o page 8) 8 Prory herace 8, 8), ) (6, ), ) The lower prory as s promoed o he prory of he bloced as. The as o prory s bloced due o prory herace. Uwe. Zmmer, The Ausrala aoal Uversy page 8 of 96 (chaper 7: up o page 8) 8 Tas depedeces wh mulple locs 8, 8), ) (6, ), ) by DMPOMPO resuls blocg for he hgher prory ass. Uwe. Zmmer, The Ausrala aoal Uversy page 8 of 96 (chaper 7: up o page 8) 8 Prory herace Tas hers prory P of as f:. P < P.. Tas has loced a resource Q.. Tas s bloced wag for he release of resource Q. Uwe. Zmmer, The Ausrala aoal Uversy page 8 of 96 (chaper 7: up o page 8) 8 Whou prory herace 8, 8), ) (6, ), ) The lower prory as blocs he hgher prory as. (oe ha he blue as s uaffeced.) Prory verso Uwe. Zmmer, The Ausrala aoal Uversy page 8 of 96 (chaper 7: up o page 8) 86 Tas depedeces wh mulple locs 8, 8), ) (6, ), ) by DMPOMPO wh prory herace does o mprove he resul. Uwe. Zmmer, The Ausrala aoal Uversy page 86 of 96 (chaper 7: up o page 8) r
10 87 rcular as depedeces 8, 8), ) (6, ), ) Uwe. Zmmer, The Ausrala aoal Uversy page 87 of 96 (chaper 7: up o page 8) 8 elg Prory Proocol 8, 8), ) (6, ), ) Avods he deadloc! Uwe. Zmmer, The Ausrala aoal Uversy page 8 of 96 (chaper 7: up o page 8) 8 eal-world Exeso More ealsc Assumpos Tass are perodc we wll roduce sporadc ad aperodc processes Deadles are decal wh as s perod (D = T ) Tass are depede Pre-empve schedulg Wors case execuo s are ow we wll roduce arbrary deadles we wll roduce schedules for eracg ass we wll roduce (brefly) cooperave schedulg we wll roduce faul olera schedulg Uwe. Zmmer, The Ausrala aoal Uversy page 8 of 96 (chaper 7: up o page 8) 88 rcular as depedeces 8, 8), ) (6, ), ) by DMPOMPO resuls deadloc. (Prory herace does o mae a dfferece for bloced ass.) Uwe. Zmmer, The Ausrala aoal Uversy page 88 of 96 (chaper 7: up o page 8) 8 Immedae celg prory proocol (POSIX, Ada, T-Java) Implcaos: Tass are dspached oly f all employed resources are avalable. Deadlocs are preveed (o hold ad wa). umber of coex swches are reduced. Uwe. Zmmer, The Ausrala aoal Uversy page 8 of 96 (chaper 7: up o page 8) 8 o pre-empve schedulg I pre-empve schedulg: Maxmal dvdual blocg s B ca be deermed for each as by employg a prory celg proocol. Maxmum overall blocg Bmax = max # B -. ooperave Every as s dvded o pre-empve blocs of # B max. All crcal secos are compleely eclosed a sgle bloc. Every as calls a de-schedulg roue a he ed of each bloc,.e. offerg a as swch. Uwe. Zmmer, The Ausrala aoal Uversy page 8 of 96 (chaper 7: up o page 8) 89 Immedae celg prory proocol (POSIX, Ada, T-Java) Each as has a sac prory P. Each resource has a sac celg prory : = max # employ ^ h$ P- wh employ (, ) beg a boolea fuco reurg for rue f as employs resource. Each as has a dyamc prory P D : P D = max # P, max # loced ^, h$ - - wh loced (, ) beg a boolea fuco reurg for rue f as holds resource. Uwe. Zmmer, The Ausrala aoal Uversy page 89 of 96 (chaper 7: up o page 8) 8 Immedae celg prory proocol (POSIX, Ada, T-Java) Maxmal blocg : B = max # usage(,) r $ () r - r = deog he umber of crcal secos. usage (,) r beg a boolea fuco reurg for rue ad dcag ha r s used by: a leas oe wh P < P. () r deog he wors case compuao crcal seco r Each as ca oly be bloced oce by oe lower prory as! Uwe. Zmmer, The Ausrala aoal Uversy page 8 of 96 (chaper 7: up o page 8) 8 o pre-empve schedulg ooperave Implcaos: umber of as swches s reduced. aches, pre-fechg, ad ppeles are more effce. Execuo s are (a b) easer o predc. Schedules are smpler. Ierdepede as ses are schedulable deadloc free by desg. Uwe. Zmmer, The Ausrala aoal Uversy page 8 of 96 (chaper 7: up o page 8),
11 86 o pre-empve schedulg ooperave espose s: = + F wh + B F = max f T p > wh F he execuo of he fal bloc. For he smplfed case of = = = F = Bmax : = + wh = + f T p > For he furher smplfed case of 6 T : = T : = + > Uwe. Zmmer, The Ausrala aoal Uversy page 86 of 96 (chaper 7: up o page 8) 89 Faul Tolerace Excepos ad ecoveres f Tas eeds exra PU- for error recovery or excepo hadlg ad he mmum er-arrval bewee fauls s T f : = B + + e T o + ) d T > max $ If error recovery s performed a he hghes prory: = B + + e T o + ) d T > max Uwe. Zmmer, The Ausrala aoal Uversy page 89 of 96 (chaper 7: up o page 8) 8 aguage suppor Ada provdes: Tas ad errup prores (sac, dyamc, acve). Tas arbues. Prorzed ery queues. Prory celg locg (IPP). Schedulers (FPS wh FIFO wh prores (pre-empve), oud ob, EDF). Tas execuo measuremes. Sporadc servers Ada does currely o provde: Uwe. Zmmer, The Ausrala aoal Uversy page 8 of 96 (chaper 7: up o page 8) 87 o pre-empve schedulg ooperave osderaos: ode bloc dvso eed o be doe horoughly. Addoal proeco agas msbehavg (o-cooperave) ass: Scheduler pre-emps ass (deferred pre-empo), whch fal o offer a de-schedule hemselves. Due o a ceral B max, addoal ass eed o be egeered o parcpae a specfc cooperave schedule. equres ha a value B max ca be acceped by all ass. Shor ad reacve ass are excluded or reaed separaely. Uwe. Zmmer, The Ausrala aoal Uversy page 87 of 96 (chaper 7: up o page 8) 8 eal-world Exeso More ealsc Assumpos Tass are perodc we wll roduce sporadc ad aperodc processes Deadles are decal wh as s perod (D = T ) Tass are depede Pre-empve schedulg Wors case execuo s are ow we wll roduce arbrary deadles we wll roduce schedules for eracg ass we wll roduce (brefly) cooperave schedulg we wll roduce faul olera schedulg Uwe. Zmmer, The Ausrala aoal Uversy page 8 of 96 (chaper 7: up o page 8) 8 Ada pacage Sysem s subype Ay_Prory s Ieger rage mplemeao-defed; subype Prory s Ay_Prory rage Ay_Prory Frs.. mplemeao-defed; subype Ierrup_Prory s Ay_Prory rage Prory as +.. Ay_Prory as; Defaul_Prory : cosa Prory := (Prory Frs + Prory as) ; ed Sysem; pacage Ada.Dyamc_Prores s procedure Se_Prory (Prory : Sysem.Ay_Prory; T : Ada.Tas_Idefcao.Tas_ID := Ada.Tas_Idefcao.urre_Tas); fuco Ge_Prory ( T : Ada.Tas_Idefcao.Tas_ID := Ada.Tas_Idefcao.urre_Tas) reur Sysem.Ay_Prory; ed Ada.Dyamc_Prores; Uwe. Zmmer, The Ausrala aoal Uversy page 8 of 96 (chaper 7: up o page 8) 88 eal-world Exeso More ealsc Assumpos Tass are perodc we wll roduce sporadc ad aperodc processes Deadles are decal wh as s perod (D = T ) Tass are depede Pre-empve schedulg Wors case execuo s are ow we wll roduce arbrary deadles we wll roduce schedules for eracg ass we wll roduce (brefly) cooperave schedulg we wll roduce faul olera schedulg Uwe. Zmmer, The Ausrala aoal Uversy page 88 of 96 (chaper 7: up o page 8) 8 Geeral schedulg mehods Some as ses ca be scheduled by roducg offses o he release s, ye Whou ay furher resrcos hs problem s P-hard By roducg furher assumpos abou cycle graulary ad assocaed deadles: Schedulably aalyss complexy ca be reduced o polyomal. e.g. esrc cycle s o powers of wo of a base. Uwe. Zmmer, The Ausrala aoal Uversy page 8 of 96 (chaper 7: up o page 8) 8 aguage suppor POSIX provdes: Threads ad errup prores (sac, dyamc, acve). Threads ca be sysem coeed or process coeed (prory schedulg uclear hs case). Prorzed message queues. Prory celg locg (IPP). Schedulers, prory based wh a leas: FIFO, oud-ob, Sporadc Server, possbly ohers. Tmers. Uwe. Zmmer, The Ausrala aoal Uversy page 8 of 96 (chaper 7: up o page 8) f f f f
12 8 Summary Basc real- schedulg Fxed Prory (FPS) wh ae Moooc (MPO) ad Deadle Moooc Prory Orderg (DMPO). Earles Deadle Frs (EDF). eal-world exesos Aperodc, sporadc, sof real- ass. Deadles dffere from perod. Sychrozed als (prory herace, prory celg proocols). ooperave ad deferred pre-empo schedulg. Faul olerace erms of excepo hadlg cosderaos. aguage suppor Ada, POSIX Uwe. Zmmer, The Ausrala aoal Uversy page 8 of 96 (chaper 7: up o page 8)
Real-Time Systems. Example: scheduling using EDF. Feasibility analysis for EDF. Example: scheduling using EDF
EDA/DIT6 Real-Tme Sysems, Chalmers/GU, 0/0 ecure # Updaed February, 0 Real-Tme Sysems Specfcao Problem: Assume a sysem wh asks accordg o he fgure below The mg properes of he asks are gve he able Ivesgae
More information10/04/2018. Definitions. The scheduling problem. Feasibility vs. schedulability. Complexity. Why do we care about complexity? P R
//8 Defos schedule s sad o be feasble f sasfes a se of cosras. as se s sad o be feasble, f here exss a algorhm ha geeraes a feasble schedule for. asse s sad o be schedulable wh a algorhm, f geeraes a feasble
More informationQueuing Theory: Memory Buffer Limits on Superscalar Processing
Cle/ Model of I/O Queug Theory: Memory Buffer Lms o Superscalar Processg Cle reques respose Devce Fas CPU s cle for slower I/O servces Buffer sores cle requess ad s a slower server respose rae Laecy Tme
More informationThe Poisson Process Properties of the Poisson Process
Posso Processes Summary The Posso Process Properes of he Posso Process Ierarrval mes Memoryless propery ad he resdual lfeme paradox Superposo of Posso processes Radom seleco of Posso Pos Bulk Arrvals ad
More informationCyclone. Anti-cyclone
Adveco Cycloe A-cycloe Lorez (963) Low dmesoal aracors. Uclear f hey are a good aalogy o he rue clmae sysem, bu hey have some appealg characerscs. Dscusso Is he al codo balaced? Is here a al adjusme
More information(1) Cov(, ) E[( E( ))( E( ))]
Impac of Auocorrelao o OLS Esmaes ECON 3033/Evas Cosder a smple bvarae me-seres model of he form: y 0 x The four key assumpos abou ε hs model are ) E(ε ) = E[ε x ]=0 ) Var(ε ) =Var(ε x ) = ) Cov(ε, ε )
More information14. Poisson Processes
4. Posso Processes I Lecure 4 we roduced Posso arrvals as he lmg behavor of Bomal radom varables. Refer o Posso approxmao of Bomal radom varables. From he dscusso here see 4-6-4-8 Lecure 4 " arrvals occur
More informationContinuous Time Markov Chains
Couous me Markov chas have seay sae probably soluos f a oly f hey are ergoc, us lke scree me Markov chas. Fg he seay sae probably vecor for a couous me Markov cha s o more ffcul ha s he scree me case,
More information8. Queueing systems lect08.ppt S Introduction to Teletraffic Theory - Fall
8. Queueg sysems lec8. S-38.45 - Iroduco o Teleraffc Theory - Fall 8. Queueg sysems Coes Refresher: Smle eleraffc model M/M/ server wag laces M/M/ servers wag laces 8. Queueg sysems Smle eleraffc model
More informationSolution set Stat 471/Spring 06. Homework 2
oluo se a 47/prg 06 Homework a Whe he upper ragular elemes are suppressed due o smmer b Le Y Y Y Y A weep o he frs colum o oba: A ˆ b chagg he oao eg ad ec YY weep o he secod colum o oba: Aˆ YY weep o
More informationQuantitative Portfolio Theory & Performance Analysis
550.447 Quaave Porfolo heory & Performace Aalyss Week February 4 203 Coceps. Assgme For February 4 (hs Week) ead: A&L Chaper Iroduco & Chaper (PF Maageme Evrome) Chaper 2 ( Coceps) Seco (Basc eur Calculaos)
More informationScheduling Motivation
76 eal-me & Embedded Systems 7 Uwe. Zmmer - he Australan Natonal Unversty 78 Motvaton n eal-me Systems Concurrency may lead to non-determnsm. Non-determnsm may make t harder to predct the tmng behavour.
More informationThe Mean Residual Lifetime of (n k + 1)-out-of-n Systems in Discrete Setting
Appled Mahemacs 4 5 466-477 Publshed Ole February 4 (hp//wwwscrporg/oural/am hp//dxdoorg/436/am45346 The Mea Resdual Lfeme of ( + -ou-of- Sysems Dscree Seg Maryam Torab Sahboom Deparme of Sascs Scece ad
More informationMidterm Exam. Tuesday, September hour, 15 minutes
Ecoomcs of Growh, ECON560 Sa Fracsco Sae Uvers Mchael Bar Fall 203 Mderm Exam Tuesda, Sepember 24 hour, 5 mues Name: Isrucos. Ths s closed boo, closed oes exam. 2. No calculaors of a d are allowed. 3.
More informationThe Linear Regression Of Weighted Segments
The Lear Regresso Of Weghed Segmes George Dael Maeescu Absrac. We proposed a regresso model where he depede varable s made o up of pos bu segmes. Ths suao correspods o he markes hroughou he da are observed
More informationQuantum Mechanics II Lecture 11 Time-dependent perturbation theory. Time-dependent perturbation theory (degenerate or non-degenerate starting state)
Pro. O. B. Wrgh, Auum Quaum Mechacs II Lecure Tme-depede perurbao heory Tme-depede perurbao heory (degeerae or o-degeerae sarg sae) Cosder a sgle parcle whch, s uperurbed codo wh Hamloa H, ca exs a superposo
More informationIMPROVED PORTFOLIO OPTIMIZATION MODEL WITH TRANSACTION COST AND MINIMAL TRANSACTION LOTS
Vol.7 No.4 (200) p73-78 Joural of Maageme Scece & Sascal Decso IMPROVED PORTFOLIO OPTIMIZATION MODEL WITH TRANSACTION COST AND MINIMAL TRANSACTION LOTS TIANXIANG YAO AND ZAIWU GONG College of Ecoomcs &
More informationSolution. The straightforward approach is surprisingly difficult because one has to be careful about the limits.
ose ad Varably Homewor # (8), aswers Q: Power spera of some smple oses A Posso ose A Posso ose () s a sequee of dela-fuo pulses, eah ourrg depedely, a some rae r (More formally, s a sum of pulses of wdh
More informationDetermination of Antoine Equation Parameters. December 4, 2012 PreFEED Corporation Yoshio Kumagae. Introduction
refeed Soluos for R&D o Desg Deermao of oe Equao arameers Soluos for R&D o Desg December 4, 0 refeed orporao Yosho Kumagae refeed Iroduco hyscal propery daa s exremely mpora for performg process desg ad
More informationFor the plane motion of a rigid body, an additional equation is needed to specify the state of rotation of the body.
The kecs of rgd bodes reas he relaoshps bewee he exeral forces acg o a body ad he correspodg raslaoal ad roaoal moos of he body. he kecs of he parcle, we foud ha wo force equaos of moo were requred o defe
More informationLecture 3 Topic 2: Distributions, hypothesis testing, and sample size determination
Lecure 3 Topc : Drbuo, hypohe eg, ad ample ze deermao The Sude - drbuo Coder a repeaed drawg of ample of ze from a ormal drbuo of mea. For each ample, compue,,, ad aoher ac,, where: The ac he devao of
More informationRedundancy System Fault Sampling Under Imperfect Maintenance
A publcao of CHEMICAL EGIEERIG TRASACTIOS VOL. 33, 03 Gues Edors: Erco Zo, Pero Barald Copyrgh 03, AIDIC Servz S.r.l., ISB 978-88-95608-4-; ISS 974-979 The Iala Assocao of Chemcal Egeerg Ole a: www.adc./ce
More informationθ = θ Π Π Parametric counting process models θ θ θ Log-likelihood: Consider counting processes: Score functions:
Paramerc coug process models Cosder coug processes: N,,..., ha cou he occurreces of a eve of eres for dvduals Iesy processes: Lelhood λ ( ;,,..., N { } λ < Log-lelhood: l( log L( Score fucos: U ( l( log
More informationQR factorization. Let P 1, P 2, P n-1, be matrices such that Pn 1Pn 2... PPA
QR facorzao Ay x real marx ca be wre as AQR, where Q s orhogoal ad R s upper ragular. To oba Q ad R, we use he Householder rasformao as follows: Le P, P, P -, be marces such ha P P... PPA ( R s upper ragular.
More informationThe ray paths and travel times for multiple layers can be computed using ray-tracing, as demonstrated in Lab 3.
C. Trael me cures for mulple reflecors The ray pahs ad rael mes for mulple layers ca be compued usg ray-racg, as demosraed Lab. MATLAB scrp reflec_layers_.m performs smple ray racg. (m) ref(ms) ref(ms)
More informationFORCED VIBRATION of MDOF SYSTEMS
FORCED VIBRAION of DOF SSES he respose of a N DOF sysem s govered by he marx equao of moo: ] u C] u K] u 1 h al codos u u0 ad u u 0. hs marx equao of moo represes a sysem of N smulaeous equaos u ad s me
More informationChapter 8. Simple Linear Regression
Chaper 8. Smple Lear Regresso Regresso aalyss: regresso aalyss s a sascal mehodology o esmae he relaoshp of a respose varable o a se of predcor varable. whe here s jus oe predcor varable, we wll use smple
More information-distributed random variables consisting of n samples each. Determine the asymptotic confidence intervals for
Assgme Sepha Brumme Ocober 8h, 003 9 h semeser, 70544 PREFACE I 004, I ed o sped wo semesers o a sudy abroad as a posgraduae exchage sude a he Uversy of Techology Sydey, Ausrala. Each opporuy o ehace my
More informationThe algebraic immunity of a class of correlation immune H Boolean functions
Ieraoal Coferece o Advaced Elecroc Scece ad Techology (AEST 06) The algebrac mmuy of a class of correlao mmue H Boolea fucos a Jgla Huag ad Zhuo Wag School of Elecrcal Egeerg Norhwes Uversy for Naoales
More informationFault Tolerant Computing. Fault Tolerant Computing CS 530 Probabilistic methods: overview
Probably 1/19/ CS 53 Probablsc mehods: overvew Yashwa K. Malaya Colorado Sae Uversy 1 Probablsc Mehods: Overvew Cocree umbers presece of uceray Probably Dsjo eves Sascal depedece Radom varables ad dsrbuos
More informationOverview. Worst-case response time analysis of real-time tasks under FPDS. Motivation for FPDS. Scheduling model for FPDS. Scheduling model for FPDS
Reder J. Brl, r..brl@tue.l TU/e Iformatca, System Archtecture ad Networg Reder J. Brl, r..brl@tue.l TU/e Iformatca, System Archtecture ad Networg Overvew Worst-case respose tme aalyss of real-tme tass
More informationLeast Squares Fitting (LSQF) with a complicated function Theexampleswehavelookedatsofarhavebeenlinearintheparameters
Leas Squares Fg LSQF wh a complcaed fuco Theeampleswehavelookedasofarhavebeelearheparameers ha we have bee rg o deerme e.g. slope, ercep. For he case where he fuco s lear he parameers we ca fd a aalc soluo
More informationReliability Analysis of Sparsely Connected Consecutive-k Systems: GERT Approach
Relably Aalyss of Sparsely Coece Cosecuve- Sysems: GERT Approach Pooa Moha RMSI Pv. L Noa-2131 poalovely@yahoo.com Mau Agarwal Deparme of Operaoal Research Uversy of Delh Delh-117, Ia Agarwal_maulaa@yahoo.com
More informationTime-Dependent Perturbation Theory
Tme-Depede Perurbao Theory Mchael Fowler 7/6/7 Iroduco: Geeral Formalsm We look a a Hamloa H H + V( ), wh V( ) some me-depede perurbao, so ow he wave fuco wll have perurbao-duced me depedece Our sarg po
More informationOptimal Eye Movement Strategies in Visual Search (Supplement)
Opmal Eye Moveme Sraeges Vsual Search (Suppleme) Jr Naemk ad Wlso S. Gesler Ceer for Percepual Sysems ad Deparme of Psychology, Uversy of exas a Aus, Aus X 787 Here we derve he deal searcher for he case
More informationGeneral Complex Fuzzy Transformation Semigroups in Automata
Joural of Advaces Compuer Research Quarerly pissn: 345-606x eissn: 345-6078 Sar Brach Islamc Azad Uversy Sar IRIra Vol 7 No May 06 Pages: 7-37 wwwacrausaracr Geeral Complex uzzy Trasformao Semgroups Auomaa
More informationLeast squares and motion. Nuno Vasconcelos ECE Department, UCSD
Leas squares ad moo uo Vascocelos ECE Deparme UCSD Pla for oda oda we wll dscuss moo esmao hs s eresg wo was moo s ver useful as a cue for recogo segmeao compresso ec. s a grea eample of leas squares problem
More informationInterval Estimation. Consider a random variable X with a mean of X. Let X be distributed as X X
ECON 37: Ecoomercs Hypohess Tesg Iervl Esmo Wh we hve doe so fr s o udersd how we c ob esmors of ecoomcs reloshp we wsh o sudy. The queso s how comforble re we wh our esmors? We frs exme how o produce
More informationPartial Molar Properties of solutions
Paral Molar Properes of soluos A soluo s a homogeeous mxure; ha s, a soluo s a oephase sysem wh more ha oe compoe. A homogeeous mxures of wo or more compoes he gas, lqud or sold phase The properes of a
More informationMathematical Formulation
Mahemacal Formulao The purpose of a fe fferece equao s o appromae he paral ffereal equao (PE) whle maag he physcal meag. Eample PE: p c k FEs are usually formulae by Taylor Seres Epaso abou a po a eglecg
More informationKey words: Fractional difference equation, oscillatory solutions,
OSCILLATION PROPERTIES OF SOLUTIONS OF FRACTIONAL DIFFERENCE EQUATIONS Musafa BAYRAM * ad Ayd SECER * Deparme of Compuer Egeerg, Isabul Gelsm Uversy Deparme of Mahemacal Egeerg, Yldz Techcal Uversy * Correspodg
More informationAML710 CAD LECTURE 12 CUBIC SPLINE CURVES. Cubic Splines Matrix formulation Normalised cubic splines Alternate end conditions Parabolic blending
CUIC SLINE CURVES Cubc Sples Marx formulao Normalsed cubc sples Alerae ed codos arabolc bledg AML7 CAD LECTURE CUIC SLINE The ame sple comes from he physcal srume sple drafsme use o produce curves A geeral
More informationBrownian Motion and Stochastic Calculus. Brownian Motion and Stochastic Calculus
Browa Moo Sochasc Calculus Xogzh Che Uversy of Hawa a Maoa earme of Mahemacs Seember, 8 Absrac Ths oe s abou oob decomoso he bascs of Suare egrable margales Coes oob-meyer ecomoso Suare Iegrable Margales
More informationFresnel Equations cont.
Lecure 12 Chaper 4 Fresel quaos co. Toal eral refleco ad evaesce waves Opcal properes of meals Laer: Famlar aspecs of he eraco of lgh ad maer Fresel quaos r 2 Usg Sell s law, we ca re-wre: r s s r a a
More informationReliability Analysis. Basic Reliability Measures
elably /6/ elably Aaly Perae faul Œ elably decay Teporary faul Œ Ofe Seady ae characerzao Deg faul Œ elably growh durg eg & debuggg A pace hule Challeger Lauch, 986 Ocober 6, Bac elably Meaure elably:
More informationReal-time Classification of Large Data Sets using Binary Knapsack
Real-me Classfcao of Large Daa Ses usg Bary Kapsack Reao Bru bru@ds.uroma. Uversy of Roma La Sapeza AIRO 004-35h ANNUAL CONFERENCE OF THE ITALIAN OPERATIONS RESEARCH Sepember 7-0, 004, Lecce, Ialy Oule
More informationFundamentals of Speech Recognition Suggested Project The Hidden Markov Model
. Projec Iroduco Fudameals of Speech Recogo Suggesed Projec The Hdde Markov Model For hs projec, s proposed ha you desg ad mpleme a hdde Markov model (HMM) ha opmally maches he behavor of a se of rag sequeces
More informationStabilization of LTI Switched Systems with Input Time Delay. Engineering Letters, 14:2, EL_14_2_14 (Advance online publication: 16 May 2007) Lin Lin
Egeerg Leers, 4:2, EL_4_2_4 (Advace ole publcao: 6 May 27) Sablzao of LTI Swched Sysems wh Ipu Tme Delay L L Absrac Ths paper deals wh sablzao of LTI swched sysems wh pu me delay. A descrpo of sysems sablzao
More informationComplete Identification of Isotropic Configurations of a Caster Wheeled Mobile Robot with Nonredundant/Redundant Actuation
486 Ieraoal Joural Sugbok of Corol Km Auomao ad Byugkwo ad Sysems Moo vol 4 o 4 pp 486-494 Augus 006 Complee Idefcao of Isoropc Cofguraos of a Caser Wheeled Moble Robo wh Noreduda/Reduda Acuao Sugbok Km
More informationInternational Journal Of Engineering And Computer Science ISSN: Volume 5 Issue 12 Dec. 2016, Page No.
www.jecs. Ieraoal Joural Of Egeerg Ad Compuer Scece ISSN: 19-74 Volume 5 Issue 1 Dec. 16, Page No. 196-1974 Sofware Relably Model whe mulple errors occur a a me cludg a faul correco process K. Harshchadra
More informationFully Fuzzy Linear Systems Solving Using MOLP
World Appled Sceces Joural 12 (12): 2268-2273, 2011 ISSN 1818-4952 IDOSI Publcaos, 2011 Fully Fuzzy Lear Sysems Solvg Usg MOLP Tofgh Allahvraloo ad Nasser Mkaelvad Deparme of Mahemacs, Islamc Azad Uversy,
More informationContinuous Indexed Variable Systems
Ieraoal Joural o Compuaoal cece ad Mahemacs. IN 0974-389 Volume 3, Number 4 (20), pp. 40-409 Ieraoal Research Publcao House hp://www.rphouse.com Couous Idexed Varable ysems. Pouhassa ad F. Mohammad ghjeh
More informationThe textbook expresses the stock price as the present discounted value of the dividend paid and the price of the stock next period.
ublc Affars 974 Meze D. Ch Fall Socal Sceces 748 Uversy of Wscos-Madso Sock rces, News ad he Effce Markes Hypohess (rev d //) The rese Value Model Approach o Asse rcg The exbook expresses he sock prce
More informationFALL HOMEWORK NO. 6 - SOLUTION Problem 1.: Use the Storage-Indication Method to route the Input hydrograph tabulated below.
Jorge A. Ramírez HOMEWORK NO. 6 - SOLUTION Problem 1.: Use he Sorage-Idcao Mehod o roue he Ipu hydrograph abulaed below. Tme (h) Ipu Hydrograph (m 3 /s) Tme (h) Ipu Hydrograph (m 3 /s) 0 0 90 450 6 50
More informationDynamic Voltage and Frequency Scaling Under a Precise Energy Model Considering Variable and Fixed Components of the System Power Dissipation
Dyamc Volage ad requecy Scalg Uder a recse Eergy Model Cosderg Varable ad xed Compoes of he Sysem ower Dsspao ABSRAC hs paper preses a dyamc volage ad frequecy scalg (DVS) echque ha mmzes he oal sysem
More informationVARIATIONAL ITERATION METHOD FOR DELAY DIFFERENTIAL-ALGEBRAIC EQUATIONS. Hunan , China,
Mahemacal ad Compuaoal Applcaos Vol. 5 No. 5 pp. 834-839. Assocao for Scefc Research VARIATIONAL ITERATION METHOD FOR DELAY DIFFERENTIAL-ALGEBRAIC EQUATIONS Hoglag Lu Aguo Xao Yogxag Zhao School of Mahemacs
More informationSolving Constrained Flow-Shop Scheduling. Problems with Three Machines
It J Cotemp Math Sceces, Vol 5, 2010, o 19, 921-929 Solvg Costraed Flow-Shop Schedulg Problems wth Three Maches P Pada ad P Rajedra Departmet of Mathematcs, School of Advaced Sceces, VIT Uversty, Vellore-632
More informationTo Estimate or to Predict
Raer Schwabe o Esmae or o Predc Implcaos o he esg or Lear Mxed Models o Esmae or o Predc - Implcaos o he esg or Lear Mxed Models Raer Schwabe, Marya Prus raer.schwabe@ovgu.de suppored by SKAVOE Germa ederal
More informationFinal Exam Applied Econometrics
Fal Eam Appled Ecoomercs. 0 Sppose we have he followg regresso resl: Depede Varable: SAT Sample: 437 Iclded observaos: 437 Whe heeroskedasc-cosse sadard errors & covarace Varable Coeffce Sd. Error -Sasc
More informationPeriodic Resource Reallocation in Two-Echelon Repairable Item Inventory Systems
-ASE-009-070 Perodc Resource Reallocao wo-echelo Reparable Iem Iveory Sysems Hoog Chu LAU, Je PAN, Huawe SON Absrac ve a exsg sock allocao a veory sysem, s ofe ecessary o perform reallocao over mulple
More informationCompetitive Facility Location Problem with Demands Depending on the Facilities
Aa Pacc Maageme Revew 4) 009) 5-5 Compeve Facl Locao Problem wh Demad Depedg o he Facle Shogo Shode a* Kuag-Yh Yeh b Hao-Chg Ha c a Facul of Bue Admrao Kobe Gau Uver Japa bc Urba Plag Deparme Naoal Cheg
More informationPTAS for Bin-Packing
CS 663: Patter Matchg Algorthms Scrbe: Che Jag /9/00. Itroducto PTAS for B-Packg The B-Packg problem s NP-hard. If we use approxmato algorthms, the B-Packg problem could be solved polyomal tme. For example,
More informationOutline. Queuing Theory Framework. Delay Models. Fundamentals of Computer Networking: Introduction to Queuing Theory. Delay Models.
Oule Fudaeals of Couer Neworg: Iroduco o ueug Theory eadg: Texboo chaer 3. Guevara Noubr CSG5, lecure 3 Delay Models Lle s Theore The M/M/ queug syse The M/G/ queug syse F3, CSG5 Fudaeals of Couer Neworg
More informationOutline. Computer Networks: Theory, Modeling, and Analysis. Delay Models. Queuing Theory Framework. Delay Models. Little s Theorem
Oule Couer Newors: Theory, Modelg, ad Aalyss Guevara Noubr COM35, lecure 3 Delay Models Lle s Theore The M/M/ queug syse The M/G/ queug syse F, COM35 Couer Newors Lecure 3, F, COM35 Couer Newors Lecure
More informationMoments of Order Statistics from Nonidentically Distributed Three Parameters Beta typei and Erlang Truncated Exponential Variables
Joural of Mahemacs ad Sascs 6 (4): 442-448, 200 SSN 549-3644 200 Scece Publcaos Momes of Order Sascs from Nodecally Dsrbued Three Parameers Bea ype ad Erlag Trucaed Expoeal Varables A.A. Jamoom ad Z.A.
More informationLinear Regression Linear Regression with Shrinkage
Lear Regresso Lear Regresso h Shrkage Iroduco Regresso meas predcg a couous (usuall scalar oupu from a vecor of couous pus (feaures x. Example: Predcg vehcle fuel effcec (mpg from 8 arbues: Lear Regresso
More informationChapter 14 Logistic Regression Models
Chapter 4 Logstc Regresso Models I the lear regresso model X β + ε, there are two types of varables explaatory varables X, X,, X k ad study varable y These varables ca be measured o a cotuous scale as
More informationarxiv: v2 [cs.lg] 19 Dec 2016
1 Sasfcg mul-armed bad problems Paul Reverdy, Vabhav Srvasava, ad Naom Ehrch Leoard arxv:1512.07638v2 [cs.lg] 19 Dec 2016 Absrac Sasfcg s a relaxao of maxmzg ad allows for less rsky decso makg he face
More informationCyclically Interval Total Colorings of Cycles and Middle Graphs of Cycles
Ope Joural of Dsree Mahemas 2017 7 200-217 hp://wwwsrporg/joural/ojdm ISSN Ole: 2161-7643 ISSN Pr: 2161-7635 Cylally Ierval Toal Colorgs of Cyles Mddle Graphs of Cyles Yogqag Zhao 1 Shju Su 2 1 Shool of
More informationVoltage Sensitivity Analysis in MV Distribution Networks
Proceedgs of he 6h WSEAS/IASME I. Cof. o Elecrc Power Sysems, Hgh olages, Elecrc Maches, Teerfe, Spa, December 6-8, 2006 34 olage Sesvy Aalyss M Dsrbuo Neworks S. CONTI, A.M. GRECO, S. RAITI Dparmeo d
More informationSquare law expression is non linear between I D and V GS. Need to operate in appropriate region for linear behaviour. W L
MOS Feld-Effec Trassrs (MOSFETs ecure # 4 MOSFET as a Amplfer k ( S Square law express s lear bewee ad. Need perae apprprae reg fr lear behaur. Cpyrgh 004 by Oxfrd Uersy Press, c. MOSFET as a Amplfer S
More informationModel for Optimal Management of the Spare Parts Stock at an Irregular Distribution of Spare Parts
Joural of Evromeal cece ad Egeerg A 7 (08) 8-45 do:0.765/6-598/08.06.00 D DAVID UBLIHING Model for Opmal Maageme of he pare ars ock a a Irregular Dsrbuo of pare ars veozar Madzhov Fores Research Isue,
More informationSYRIAN SEISMIC CODE :
SYRIAN SEISMIC CODE 2004 : Two sac mehods have bee ssued Syra buldg code 2004 o calculae he laeral sesmc forces he buldg. The Frs Sac Mehod: I s he same mehod he prevous code (995) wh few modfcaos. I s
More informationSome Probability Inequalities for Quadratic Forms of Negatively Dependent Subgaussian Random Variables
Joural of Sceces Islamc epublc of Ira 6(: 63-67 (005 Uvers of ehra ISSN 06-04 hp://scecesuacr Some Probabl Iequales for Quadrac Forms of Negavel Depede Subgaussa adom Varables M Am A ozorga ad H Zare 3
More informationRegression Approach to Parameter Estimation of an Exponential Software Reliability Model
Amerca Joural of Theorecal ad Appled Sascs 06; 5(3): 80-86 hp://www.scecepublshggroup.com/j/ajas do: 0.648/j.ajas.060503. ISSN: 36-8999 (Pr); ISSN: 36-9006 (Ole) Regresso Approach o Parameer Esmao of a
More informationENGINEERING solutions to decision-making problems are
3788 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 62, NO. 8, AUGUST 2017 Sasfcg Mul-Armed Bad Problems Paul Reverdy, Member, IEEE, Vabhav Srvasava, ad Naom Ehrch Leoard, Fellow, IEEE Absrac Sasfcg s a
More informationComplementary Tree Paired Domination in Graphs
IOSR Joural of Mahemacs (IOSR-JM) e-issn: 2278-5728, p-issn: 239-765X Volume 2, Issue 6 Ver II (Nov - Dec206), PP 26-3 wwwosrjouralsorg Complemeary Tree Pared Domao Graphs A Meeaksh, J Baskar Babujee 2
More informationLaboratory I.10 It All Adds Up
Laboratory I. It All Adds Up Goals The studet wll work wth Rema sums ad evaluate them usg Derve. The studet wll see applcatos of tegrals as accumulatos of chages. The studet wll revew curve fttg sklls.
More informationThe textbook expresses the stock price as the present discounted value of the dividend paid and the price of the stock next period.
coomcs 435 Meze. Ch Fall 07 Socal Sceces 748 Uversy of Wscos-Madso Sock rces, News ad he ffce Markes Hypohess The rese Value Model Approach o Asse rcg The exbook expresses he sock prce as he prese dscoued
More informationFault Tolerant Computing. Fault Tolerant Computing CS 530 Reliability Analysis
Probably /4/6 CS 5 elably Aaly Yahwa K. Malaya Colorado Sae very Ocober 4, 6 elably Aaly: Oule elably eaure: elably, avalably, Tra. elably, T M MTTF ad (, MTBF Bac Cae Sgle u wh perae falure, falure rae
More informationEE 6885 Statistical Pattern Recognition
EE 6885 Sascal Paer Recogo Fall 005 Prof. Shh-Fu Chag hp://.ee.columba.edu/~sfchag Lecure 8 (/8/05 8- Readg Feaure Dmeso Reduco PCA, ICA, LDA, Chaper 3.8, 0.3 ICA Tuoral: Fal Exam Aapo Hyväre ad Erkk Oja,
More informationSupplement Material for Inverse Probability Weighted Estimation of Local Average Treatment Effects: A Higher Order MSE Expansion
Suppleme Maeral for Iverse Probably Weged Esmao of Local Average Treame Effecs: A Hger Order MSE Expaso Sepe G. Doald Deparme of Ecoomcs Uversy of Texas a Aus Yu-C Hsu Isue of Ecoomcs Academa Sca Rober
More information1 Notes on Little s Law (l = λw)
Copyrigh c 26 by Karl Sigma Noes o Lile s Law (l λw) We cosider here a famous ad very useful law i queueig heory called Lile s Law, also kow as l λw, which assers ha he ime average umber of cusomers i
More informationChapter 3: Maximum-Likelihood & Bayesian Parameter Estimation (part 1)
Aoucemes Reags o E-reserves Proec roosal ue oay Parameer Esmao Bomercs CSE 9-a Lecure 6 CSE9a Fall 6 CSE9a Fall 6 Paer Classfcao Chaer 3: Mamum-Lelhoo & Bayesa Parameer Esmao ar All maerals hese sles were
More informationSolving fuzzy linear programming problems with piecewise linear membership functions by the determination of a crisp maximizing decision
Frs Jo Cogress o Fuzzy ad Iellge Sysems Ferdows Uversy of Mashhad Ira 9-3 Aug 7 Iellge Sysems Scefc Socey of Ira Solvg fuzzy lear programmg problems wh pecewse lear membershp fucos by he deermao of a crsp
More informationBig O Notation for Time Complexity of Algorithms
BRONX COMMUNITY COLLEGE of he Ciy Uiversiy of New York DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE CSI 33 Secio E01 Hadou 1 Fall 2014 Sepember 3, 2014 Big O Noaio for Time Complexiy of Algorihms Time
More informationECONOMETRIC THEORY. MODULE VIII Lecture - 26 Heteroskedasticity
ECONOMETRIC THEORY MODULE VIII Lecture - 6 Heteroskedastcty Dr. Shalabh Departmet of Mathematcs ad Statstcs Ida Isttute of Techology Kapur . Breusch Paga test Ths test ca be appled whe the replcated data
More informationSeasonal Harvests and Commodity Prices: Some analytical results. Clare Kelly 1 Centre for Applied Microeconometrics, University of Copenhagen, and
Seasoal Harvess ad Commody Prces: Some aalycal resuls Clare Kelly Cere for Appled Mcroecoomercs, Uversy of Copeage, ad Gauer Lao Scool of Maageme ad Ecoomcs, Quee's Uversy Belfas, ad CRESTENSAI, Rees,
More informationSimulation Output Analysis
Smulato Output Aalyss Summary Examples Parameter Estmato Sample Mea ad Varace Pot ad Iterval Estmato ermatg ad o-ermatg Smulato Mea Square Errors Example: Sgle Server Queueg System x(t) S 4 S 4 S 3 S 5
More informationEfficient Estimators for Population Variance using Auxiliary Information
Global Joural of Mahemacal cece: Theor ad Praccal. IN 97-3 Volume 3, Number (), pp. 39-37 Ieraoal Reearch Publcao Houe hp://www.rphoue.com Effce Emaor for Populao Varace ug Aular Iformao ubhah Kumar Yadav
More informationPractice Final Exam (corrected formulas, 12/10 11AM)
Ecoomc Meze. Ch Fall Socal Scece 78 Uvery of Wco-Mado Pracce Fal Eam (correced formula, / AM) Awer all queo he (hree) bluebook provded. Make cera you wre your ame, your ude I umber, ad your TA ame o all
More information4. Runge-Kutta Formula For Differential Equations
NCTU Deprme o Elecrcl d Compuer Egeerg 5 Sprg Course by Pro. Yo-Pg Ce. Ruge-Ku Formul For Derel Equos To solve e derel equos umerclly e mos useul ormul s clled Ruge-Ku ormul
More informationCS 268: Packet Scheduling
Pace Schedulng Decde when and wha pace o send on oupu ln - Usually mplemened a oupu nerface CS 68: Pace Schedulng flow Ion Soca March 9, 004 Classfer flow flow n Buffer managemen Scheduler soca@cs.bereley.edu
More informationNOTE ON SIMPLE AND LOGARITHMIC RETURN
Appled udes Agrbusess ad Commerce AAC Ceer-r ublshg House, Debrece DOI:.94/AAC/27/-2/6 CIENIFIC AE NOE ON IME AND OGAIHMIC EUN aa Mskolcz Uversy of Debrece, Isue of Accoug ad Face mskolczpaa@gmal.com Absrac:
More informationIntegral Equations and their Relationship to Differential Equations with Initial Conditions
Scece Refleco SR Vol 6 wwwscecereflecocom Geerl Leers Mhemcs GLM 6 3-3 Geerl Leers Mhemcs GLM Wese: hp://wwwscecereflecocom/geerl-leers--mhemcs/ Geerl Leers Mhemcs Scece Refleco Iegrl Equos d her Reloshp
More informationBianchi Type II Stiff Fluid Tilted Cosmological Model in General Relativity
Ieraoal Joural of Mahemacs esearch. IN 0976-50 Volume 6, Number (0), pp. 6-7 Ieraoal esearch Publcao House hp://www.rphouse.com Bach ype II ff Flud led Cosmologcal Model Geeral elay B. L. Meea Deparme
More information4. THE DENSITY MATRIX
4. THE DENSTY MATRX The desy marx or desy operaor s a alerae represeao of he sae of a quaum sysem for whch we have prevously used he wavefuco. Alhough descrbg a quaum sysem wh he desy marx s equvale o
More informationFourth Order Runge-Kutta Method Based On Geometric Mean for Hybrid Fuzzy Initial Value Problems
IOSR Joural of Mahemacs (IOSR-JM) e-issn: 2278-5728, p-issn: 29-765X. Volume, Issue 2 Ver. II (Mar. - Apr. 27), PP 4-5 www.osrjourals.org Fourh Order Ruge-Kua Mehod Based O Geomerc Mea for Hybrd Fuzzy
More informationLearning of Graphical Models Parameter Estimation and Structure Learning
Learg of Grahal Models Parameer Esmao ad Sruure Learg e Fukumzu he Isue of Sasal Mahemas Comuaoal Mehodology Sasal Iferee II Work wh Grahal Models Deermg sruure Sruure gve by modelg d e.g. Mxure model
More informationA note on Turán number Tk ( 1, kn, )
A oe o Turá umber T (,, ) L A-Pg Beg 00085, P.R. Cha apl000@sa.com Absrac: Turá umber s oe of prmary opcs he combaorcs of fe ses, hs paper, we wll prese a ew upper boud for Turá umber T (,, ). . Iroduco
More information