Overhead-Aware Compositional Analysis of Real-Time Systems
|
|
- Randell Beasley
- 5 years ago
- Views:
Transcription
1 Overhead-Aware ompostonal Analyss of Real-Tme Systems Lnh T.X. Phan, Meng Xu, Jaewoo Lee, nsup Lee, Oleg Sokolsky PRESE enter Department of omputer and nformaton Scence Unversty of Pennsylvana
2 ompostonal Schedulng Analyss Root omponent 0 Large scale System Scheduler W 0 = {, } Open SA Lmted resource Real-tme embedded systems omponent-based desgn Modularty Reusablty Scalablty Portablty nterface RM nterface ntegrated from small systems Workload Leaf omponent Non-leaf omponent Workload W W SA: ompostonal Schedulng Analyss 3 4
3 Explct Deadlne Perodc Model EDP resource model Γ = ( Π, Θ, ) Π : Perod Θ : Executon tme : Deadlne Γ = ( Π0, Θ0, 0) 0 Γ = (0,6,6) W 0 Γ = ( Π, Θ, ) W ' Γ (,, ) = Π Θ ' W RM a) ompute EDP nterface of leaf component b) ompute EDP nterface of non-leaf component 3
4 ssues n Exstng SA,,..., 5 deadlne met 0 :(5,4.5,4.5) 0 W = {(5,4,5),(0,.0,0)} 0 n theory b) Scenaro n theory : (5,4,4) :(0,.0,.0) RM W = {(5,4,5)} W = {(500,,500 ),...} n practce,,..., 5 deadlne mssed a) Exstng SA s an nterrupt Servce Routne to release a task's job n each perod. 4 s c) Scenaro n practce nterface s Explct Deadlne Perodc (EDP) resource model here.
5 Strawman Soluton : nflatng WET Wth One Release rel s the tme t takes for an. 0 :(5,4.5,4.5) 0 W 0 = {(5,4,5),(0,.0,0)} e ' = e + rel : (5, 4.54,4.54 ) 0 0 W ={(5,4.0,5),(0,.04,0)} 0 rel = 0.0 : (5,4,4) :(0,.0,.0 ) RM W = {5,4,5} W = {(500,,500 ),...} : (5, RM 4.0,4.0) :(0,.04,. 04 ) W = {5, 4.0, 5 )} W = {500,.0, 500),...} a) Overhead-free SA b) SA after WET nflated wth one Unsafe! Schedulable n theory, not schedulable n practce. 5
6 Strawman Soluton : nflatng WET Wth Total Release s? n s the number of tasks n the whole system. 0 :(5,4.5,4.5) 0 e ' = e + n j = p p j rel : (5, 6.63,5) 0 0 W 0 = {(5,4,5),(0,.0,0)} W 0 = {(5,5,5), (0,4.08,0)} rel = 0.0 : (5,4,4) :(0,.0,.0 ) RM a) Overhead-free SA W = {5,4,5} W = {(500,,500 ),...} : (5, RM 5,5 ) : (0, 4.08,4. 08 ) W = {5, 5.0, 5 )} W ={500, 4, 500),...} b) SA after WET nflated wth one mpossble to get n n a compostonal settng! Because the task nformaton wthn one component s hdden from another component. 6
7 ontrbutons Overhead-aware schedulablty analyss ntroduce an overhead-aware schedulablty test for one component Overhead-aware nterface Defne a new nterface to ncorporate platform overheads Overhead-aware nterface computaton Propose a method to compute each component's nterface Evaluaton on an expermental platform llustrate the applcablty and benefts of our overheadaware analyss 7
8 Overheads sch cxs RPD ( tch, ptck ) Schedule overhead ontext swtch overhead ache related preempton delay of task Tck overhead nflatable overheads rel Release overhead Non-nflatable overheads Focus on non-nflatable overhead accountng n compostonal schedulng analyss. Apply exstng approach for nflatable overheads. 8
9 nflatable Overhead Accountng a) Release event overheads relev preev e ' = p = = tck sch sch e e + e ' = p tck + + tck relev cxs b) Preempton event overheads cxs p + tck tck preev + c) Tck event overheads nflated WET RPD p tck () () (3) (4) [] cpu j cpu rel (a) Release event related overhead sch sch cxs RPD e (b) Preempton event related overhead c) Tck overhead cxs e [] B. B. Brandenburg. Schedulng and Lockng n Multprocessor Real-Tme Operatng Systems. PhD thess, The Unversty of North arolna at hapel Hll, 0. 9
10 nflatable Overhead-Aware Analyss =, A : omponent has task set, scheduled under schedulng polcy A. A component =, A s schedulable by a resource R n the presence of nflatable overheads f ' ts nflated workload s schedulable by R under A n the absence of overheads. Proof s n the paper. 0
11 Overheads sch cxs RPD ( tch, ptck ) Schedule overhead ontext swtch overhead ache related preempton delay of task Tck overhead nflatable overheads rel Release overhead Non-nflatable overheads
12 Non-nflatable Overhead Accountng hallenge Release execute ASAP when t s nvoked Release cannot be delayed by tasks or scheduled Release delay can accumulate,...,, 5 deadlne mssed s Release property
13 Non-nflatable Overhead Accountng Modelng release s n a compostonal manner Release s modeled n a hgher prorty ntracomponent Workload modeled n a lower prorty component Scheduled by FP Request bound functon of release same perod of ts task rel executon tme no deadlne 3 =, = rbf = rbf where rbf = t p rel The nterface for release s s ()
14 Non-nflatable Overhead-Aware Analyss A component =, A s schedulable by a resource R n the presence of ntra-component release s overhead f =, A s schedulable by a resource R' n the absence of overheads, where R' s the remanng resource after servces release s overhead frst. R sbf R' = sbf rem R, def = max{ sbf 0 t' t R ( t') rbf ( t')} () Proof s n the paper. 4
15 Non-nflatable Overhead-Aware Analyss Schedulable Example =, = {(0,,0),(0,,0),(0,,0),(0,5,0)} rel = 0. 0 rbf t t t t = 0.0( ) t t = 0.04( + ) 0 0 () 5
16 Non-nflatable Overhead-Aware Analyss Unschedulable Example =, =,,..., } { 0 t 5 t 500 rel = 0.0 rbf = 0.0( + 00 ) = (5,4,5) =... 0 = (500,,500) 6
17 ontrbutons Overhead-aware schedulablty analyss ntroduce an overhead-aware schedulablty test for one component Overhead-aware nterface Defne a new nterface to ncorporate platform overheads Overhead-aware nterface computaton ntroduce a method to compute each component's nterface Evaluaton on an expermental platform llustrate the applcablty and benefts of our overheadaware analyss 7
18 Overhead-Aware SA: nterface Representaton nterface: =, = rbf = rbf where Example: Workload nterface; Resource model for workload wth nflatable overheads nterface; Resource model for release s overhead rbf =, = t p rel 8 =, nterface representaton '= {(0,,0),(0,,0),(0,,0),(0,5,0)} rel = 0. 0 = ( 0,6,6), rbf rbf = 0.0( ) = 0.04( + ) t 0 () t 0 t 0 t 0 t 0 t 0
19 an we use exstng nterface models to specfy? 9
20 an we use exstng nterface models for Suppose Γ = ( Π, Θ, ) Example: uses EDP model FP? : (,0.906,) =, = {,,..., 5} = (5,4,5) = = (500,,500 ) 5 = rel = 0.0 s schedulable n analyss But not schedulable n practce! So cannot use EDP model! 0,,..., s (,0.006,) :(5,4.5,5 ) 5 : Release = {,..., 5} a) Scenaro n analyss deadlne mssed b) Scenaro n practce
21 Reason why exstng nterfaces do not work Release s property Execute ASAP when nvoked Not delayed by tasks Resource model for Amortze s requrement to each perod s are "scheduled" Worst-case release delay no longer exsts amortzaton problem: s amortzed to each perod.,,,..., s,..., s 5 5 deadlne mssed a) Scenaro n practce deadlne met b) Scenaro n analyss
22 Overhead-Aware SA: nterface Representaton nterface: =, =, = rbf = rbf where Workload nterface: resource model for workload wth nflatable overheads nterface: resource model for release nterference rbf t = p rel nterface representaton
23 ontrbutons Overhead-aware schedulablty analyss ntroduce an overhead-aware schedulablty test for one component Overhead-aware nterface Defne a new nterface to ncorporate platform overheads Overhead-aware nterface computaton ntroduce a method to compute each component's nterface Evaluaton on an expermental platform llustrate the applcablty and benefts of our overheadaware analyss 3
24 Overhead-Aware nterface omputaton ompute leaf components' nterface ompute non-leaf components' nterface Example to llustrate W 0 0 W = { = (00,0,00), = (00,0,00)} W = { 3 = (00,0,00), 4 = (00,50,00)} W W RM rel = 0.0 sch = 0. 0 cxs = 0.0 RPD 0. 0 )= tck (, p ) = (0.0, tck Overhead value 4
25 ompute Leaf omponent's nterface Step /4: ompute the nflated WET e nflate nflatable overheads e + e ' = p relev tck + tck preev p tck ' e ' e W W = (00,0,00) = (00,0,00 ) = (00,0,00) 3 4 = (00,50,00) ' = ' = 3 ' = 4 ' = (00,,00) (00,,00) (00,,00) (00,5,00) W ' W ' 5
26 ompute Leaf omponent's nterface Step /4: Generate a bandwdth-optmal EDP nterface = Γ ' = ( Π, Θ, ) as the workload nterface for the nflated workload 0 W ' =, = (0,3.,3. ) W 0 W ' =, = (0,3.,3.) =, =, W ' ' W RM 6
27 ompute Leaf omponent's nterface Step 3/4: ompute the = rbf (t) that bounds the ntra-component release nterference overheads = rbf = rbf, wth rbf t = p rel ' = ' = (00,,00) (00,,00) rel =0.0 = (00,0.0) = (00,0.0) = rbf = t ' = 4 ' = (00,,00) (00,5,00) 3 = (00,0.0) 4 = (00,0.0) = rbf = t
28 ompute Leaf omponent's nterface Step 4/4: The overhead-aware nterface of =, Γ ' = = rbf, where and s 0 = W ' W 0, =, ' W RM =, =, = (0,3.,3.) = rbf = = (0,3.,3.) = rbf t t =
29 Overhead-Aware nterface omputaton ompute leaf components' nterface ompute non-leaf components' nterface = 0 0, 0 0 = (0,3.,3.) W 0 =, = rbf = t =, = W ', ' W RM =, = (0,3.,3.) = rbf = t
30 ompute Non-leaf omponents' nterface Suppose = W = {,..., n}, A where =, and =, omposton =... n n = = = 0 0, W nterface = (0,3.,3.) = (0,3.,3.) nterface Task T = (0,3.,0) T = (0,3.,0) =, =, W ' ' W RM 0 = (0,6.3,6.3) 30
31 ompute Non-leaf omponents' nterface Suppose = W = {,..., n}, A where =, and =, omposton =... n n = = = t, 0 = rbf ' = W 0 t = rbf ' = =, =, W ' ' W RM 0 t t = rbf ' = ( + )
32 ompute Non-leaf omponents' nterface Suppose = W = {,..., n}, A where =, and =, omposton =... n n = = =, W = (0,6.3,6.3) 0 t t = rbf ' = ( + ) =, =, W ' ' W RM 3
33 ontrbutons Overhead-aware schedulablty analyss ntroduce an overhead-aware schedulablty test for one component Overhead-aware nterface Defne a new nterface to ncorporate platform overheads Overhead-aware nterface computaton ntroduce a method to compute each component's nterface Evaluaton on an expermental platform llustrate the applcablty and benefts of our overheadaware analyss Proof of correctness of the overhead-aware compostonal analyss s n the paper. 33
34 Evaluaton on an Expermental Platform EDP approach Not consder any platform overheads Baselne approach nflatng each task's WET by all types of overheads, ncludng the release s overheads e + e ' = relev p tck + preev tck + e rel p tck where relev sch cxs preev sch cxs RPD = +, = + +, e rel = j p p j rel and 34
35 Evaluaton Setup Task's perod Task's utlzaton # of Guest Doman Hardware Software unformly n [0ms, 00ms] unform unformly n [0.0%,0.5%] lght bmodal medum bmodal heavy bmodal Doman perod Task 8/9 n [0.0%,0.5%] and /9 n [0.5,0%] 6/9 n [0.0%,0.5%] and 3/9 n [0.5,0%] 4/9 n [0.0%,0.5%] and 5/9 n [0.5,0%] Doman 64ms Platform Schedulng Dell Optplex-980 quad-core processor RT-Xen 0.3 DM Doman 0 Pn to core0 Doman & Pn to core Overhead Value p rel sch cxs RPD tck tck = 3.77 µ s = = µ s = µ s = 39. µ s 4.77 µ s = ms. Overhead value s measured by feather trace on LTMUS on the same hardware. 35
36 Safe and Detect More Schedulable Task Set Fg. Fracton of schedulable task sets vs. workload utlzaton 36
37 Save Resource Bandwdth Fg. Resource bandwdth requrement 37
38 Save Resource Bandwdth Under Dfferent Load Fg. 4 Resource bandwdth requrement under dfferent load stuatons 38
39 oncluson ontrbutons: Overhead-aware schedulablty analyss for one component Overhead-aware nterface Overhead-aware nterface computaton Evaluaton on an expermental platform Future work consder practcal component overhead overhead-aware SA on multcore platform 39
40 Thank you! 40
Embedded Systems. 4. Aperiodic and Periodic Tasks
Embedded Systems 4. Aperodc and Perodc Tasks Lothar Thele 4-1 Contents of Course 1. Embedded Systems Introducton 2. Software Introducton 7. System Components 10. Models 3. Real-Tme Models 4. Perodc/Aperodc
More informationLast Time. Priority-based scheduling. Schedulable utilization Rate monotonic rule: Keep utilization below 69% Static priorities Dynamic priorities
Last Tme Prorty-based schedulng Statc prortes Dynamc prortes Schedulable utlzaton Rate monotonc rule: Keep utlzaton below 69% Today Response tme analyss Blockng terms Prorty nverson And solutons Release
More informationReal-Time Systems. Multiprocessor scheduling. Multiprocessor scheduling. Multiprocessor scheduling
Real-Tme Systems Multprocessor schedulng Specfcaton Implementaton Verfcaton Multprocessor schedulng -- -- Global schedulng How are tasks assgned to processors? Statc assgnment The processor(s) used for
More informationTwo Methods to Release a New Real-time Task
Two Methods to Release a New Real-tme Task Abstract Guangmng Qan 1, Xanghua Chen 2 College of Mathematcs and Computer Scence Hunan Normal Unversty Changsha, 410081, Chna qqyy@hunnu.edu.cn Gang Yao 3 Sebel
More informationEDF Scheduling for Identical Multiprocessor Systems
EDF Schedulng for dentcal Multprocessor Systems Maro Bertogna Unversty of Modena, taly As Moore s law goes on Number of transstor/chp doubles every 18 to 24 mm heatng becomes a problem Power densty (W/cm
More informationReal-Time Operating Systems M. 11. Real-Time: Periodic Task Scheduling
Real-Tme Operatng Systems M 11. Real-Tme: Perodc Task Schedulng Notce The course materal ncludes sldes downloaded from:! http://codex.cs.yale.edu/av/os-book/! and! (sldes by Slberschatz, Galvn, and Gagne,
More informationResource-Efficient Scheduling Of Multiprocessor Mixed-Criticality Real-Time Systems
Unversty of Pennsylvana ScholarlyCommons Publcly Accessble Penn Dssertatons 2017 Resource-Effcent Schedulng Of Multprocessor Mxed-Crtcalty Real-Tme Systems Jaewoo Lee Unversty of Pennsylvana, jaewoo@cs.upenn.edu
More informationImproved Worst-Case Response-Time Calculations by Upper-Bound Conditions
Improved Worst-Case Response-Tme Calculatons by Upper-Bound Condtons Vctor Pollex, Steffen Kollmann, Karsten Albers and Frank Slomka Ulm Unversty Insttute of Embedded Systems/Real-Tme Systems {frstname.lastname}@un-ulm.de
More informationResource Allocation with a Budget Constraint for Computing Independent Tasks in the Cloud
Resource Allocaton wth a Budget Constrant for Computng Independent Tasks n the Cloud Wemng Sh and Bo Hong School of Electrcal and Computer Engneerng Georga Insttute of Technology, USA 2nd IEEE Internatonal
More informationPartitioned Scheduling of Multi-Modal Mixed- Criticality Real-Time Systems on Multiprocessor Platforms
Unversty of Pennsylvana ScholarlyCommons Departmental Papers (CIS) Department of Computer & Informaton Scence 4-2014 Parttoned Schedulng of Mult-Modal Mxed- Crtcalty Real-Tme Systems on Multprocessor Platforms
More informationAN EXTENDIBLE APPROACH FOR ANALYSING FIXED PRIORITY HARD REAL-TIME TASKS
AN EXENDIBLE APPROACH FOR ANALYSING FIXED PRIORIY HARD REAL-IME ASKS K. W. ndell 1 Department of Computer Scence, Unversty of York, England YO1 5DD ABSRAC As the real-tme computng ndustry moves away from
More informationMixed-Criticality Scheduling with I/O
Mxed-Crtcalty Schedulng wth I/O Erc Mssmer, Katherne Mssmer and Rchard West Computer Scence Department Boston Unversty Boston, USA Emal: mssmer,kzhao,rchwest}@cs.bu.edu Abstract Ths paper addresses the
More informationClock-Driven Scheduling (in-depth) Cyclic Schedules: General Structure
CPSC-663: Real-me Systems n-depth Precompute statc schedule o-lne e.g. at desgn tme: can aord expensve algorthms. Idle tmes can be used or aperodc jobs. Possble mplementaton: able-drven Schedulng table
More informationOptimal Static Partition Configuration in ARINC653 System
JOURNAL OF ELECTRONIC SCIENCE AND TECHNOLOGY, VOL. 9, NO. 4, DECEMBER 7 Optmal Statc rtton Confguraton n ARINC6 System Sheng-Ln Gu, Le Luo, Sen-Sen Tang, and Yang Meng Abstract ARINC6 systems, whch have
More informationCache-Aware Compositional Analysis of Real- Time Multicore Virtualization Platforms
University of Pennsylvania ScholarlyCommons Departmental Papers (CIS) Department of Computer & Information Science 12-2013 Cache-Aware Compositional Analysis of Real- Time Multicore Virtualization Platforms
More informationPartitioned Scheduling of Multi-Modal Mixed-Criticality Real-Time Systems on Multiprocessor Platforms
Parttoned Schedulng of Mult-Modal Mxed-Crtcalty Real-Tme Systems on Multprocessor Platforms Donso de Nz SEI, Carnege Mellon Unversty Lnh T.X. Phan Unversty of Pennsylvana Abstract Real-tme systems are
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 informationGlobal EDF Scheduling for Parallel Real-Time Tasks
Washngton Unversty n St. Lous Washngton Unversty Open Scholarshp Engneerng and Appled Scence Theses & Dssertatons Engneerng and Appled Scence Sprng 5-15-2014 Global EDF Schedulng for Parallel Real-Tme
More informationParallel Real-Time Scheduling of DAGs
Washngton Unversty n St. Lous Washngton Unversty Open Scholarshp All Computer Scence and Engneerng Research Computer Scence and Engneerng Report Number: WUCSE-013-5 013 Parallel Real-Tme Schedulng of DAGs
More informationarxiv: v3 [cs.os] 12 Mar 2016
Mxed-Crtcalty Schedulng wth I/O Erc Mssmer, Katherne Zhao and Rchard West Computer Scence Department Boston Unversty Boston, MA 02215 Emal: mssmer,kzhao,rchwest}@cs.bu.edu arxv:1512.07654v3 [cs.os] 12
More informationImproving the Quality of Control of Periodic Tasks Scheduled by FP with an Asynchronous Approach
Improvng the Qualty of Control of Perodc Tasks Scheduled by FP wth an Asynchronous Approach P. Meumeu Yoms, L. George, Y. Sorel, D. de Rauglaudre AOSTE Project-team INRIA Pars-Rocquencourt Le Chesnay,
More informationKeynote: RTNS Getting ones priorities right
Keynote: RTNS 2012 Gettng ones prortes rght Robert Davs Real-Tme Systems Research Group, Unversty of York rob.davs@york.ac.uk What s ths talk about? Fxed Prorty schedulng n all ts guses Pre-emptve, non-pre-emptve,
More informationTask Scheduling with Self-Suspensions in Soft Real-Time Multiprocessor Systems
ask Schedulng wth Self-Suspensons n Soft Real-me Multprocessor Systems Cong Lu and James H. Anderson Department of Computer Scence, Unversty of North Carolna at Chapel Hll Abstract Job release Job deadlne
More informationQuantifying the Sub-optimality of Uniprocessor Fixed Priority Pre-emptive Scheduling for Sporadic Tasksets with Arbitrary Deadlines
Quantfyng the Sub-optmalty of Unprocessor Fxed Prorty Pre-emptve Schedulng for Sporadc Tasksets wth Arbtrary Deadlnes Robert Davs, Sanjoy Baruah, Thomas Rothvoss, Alan Burns To cte ths verson: Robert Davs,
More informationPartitioned Mixed-Criticality Scheduling on Multiprocessor Platforms
Parttoned Mxed-Crtcalty Schedulng on Multprocessor Platforms Chuanca Gu 1, Nan Guan 1,2, Qngxu Deng 1 and Wang Y 1,2 1 Northeastern Unversty, Chna 2 Uppsala Unversty, Sweden Abstract Schedulng mxed-crtcalty
More informationUsing non-preemptive regions and path modification to improve schedulability of real-time traffic over priority-based NoCs
Real-Tme Syst (2017) 53:886 915 DOI 10.1007/s11241-017-9276-5 Usng non-preemptve regons and path modfcaton to mprove schedulablty of real-tme traffc over prorty-based NoCs Meng Lu 1 Matthas Becker 1 Mors
More informationA Real-Time Multicast Routing Scheme for Multi-Hop Switched Fieldbuses
A Real-Tme ultcast Routng Scheme for ult-op Swtched Feldbuses Lxong Chen* Xue Lu Qxn Wang Yufe Wang *Dept. of ECE School of CS cgll Unv. Dept. of Computng The ong Kong Polytechnc Unv. arch 30 2011 Content
More informationParametric Utilization Bounds for Fixed-Priority Multiprocessor Scheduling
2012 IEEE 26th Internatonal Parallel and Dstrbuted Processng Symposum Parametrc Utlzaton Bounds for Fxed-Prorty Multprocessor Schedulng Nan Guan 1,2, Martn Stgge 1, Wang Y 1,2 and Ge Yu 2 1 Uppsala Unversty,
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationImproving the Sensitivity of Deadlines with a Specific Asynchronous Scenario for Harmonic Periodic Tasks scheduled by FP
Improvng the Senstvty of Deadlnes wth a Specfc Asynchronous Scenaro for Harmonc Perodc Tasks scheduled by FP P. Meumeu Yoms, Y. Sorel, D. de Rauglaudre AOSTE Project-team INRIA Pars-Rocquencourt Le Chesnay,
More informationReal-Time Scheduling of Parallel Tasks under a General DAG Model
Washngton Unversty n St. Lous Washngton Unversty Open Scholarshp All Computer Scence and Engneerng Research Computer Scence and Engneerng Report Number: WUCSE-01-14 01 Real-Tme Schedulng of Parallel Tasks
More informationEnergy-Efficient Scheduling Fixed-Priority tasks with Preemption Thresholds on Variable Voltage Processors
Energy-Effcent Schedulng Fxed-Prorty tasks wth Preempton Thresholds on Varable Voltage Processors XaoChuan He, Yan Ja Insttute of Network Technology and Informaton Securty School of Computer Scence Natonal
More informationHandling Overload (G. Buttazzo, Hard Real-Time Systems, Ch. 9) Causes for Overload
PS-663: Real-Te Systes Handlng Overloads Handlng Overload (G Buttazzo, Hard Real-Te Systes, h 9) auses for Overload Bad syste desgn eg poor estaton of worst-case executon tes Sultaneous arrval of unexpected
More informationUtilization-Based Scheduling of Flexible Mixed-Criticality Real-Time Tasks
1 Utlzaton-Based Schedulng of Flexble Mxed-Crtcalty Real-Tme Tasks Gang Chen, Nan Guan, D Lu, Qngqang He, Ka Huang, Todor Stefanov, Wang Y arxv:1711.00100v1 [cs.dc] 29 Sep 2017 Abstract Mxed-crtcalty models
More informationOffline Equivalence: A Non-Preemptive Scheduling Technique for Resource-Constrained Embedded Real-Time Systems
Offlne Equvalence: A Non-Preemptve Schedulng Technque for Resource-Constraned Embedded Real-Tme Systems Mtra Nasr Björn B. Brandenburg Max Planck Insttute for Software Systems (MPI-SWS) Abstract We consder
More informationVariability-Driven Module Selection with Joint Design Time Optimization and Post-Silicon Tuning
Asa and South Pacfc Desgn Automaton Conference 2008 Varablty-Drven Module Selecton wth Jont Desgn Tme Optmzaton and Post-Slcon Tunng Feng Wang, Xaoxa Wu, Yuan Xe The Pennsylvana State Unversty Department
More informationLimited Preemptive Scheduling for Real-Time Systems: a Survey
Lmted Preemptve Schedulng for Real-Tme Systems: a Survey Gorgo C. Buttazzo, Fellow Member, IEEE, Marko Bertogna, Senor Member, IEEE, and Gang Yao Abstract The queston whether preemptve algorthms are better
More informationEfficient Feasibility Analysis for Real-Time Systems with EDF scheduling*
Effcent Feasblty Analyss for Real-Tme Systems wth EF schedulng* Karsten Albers, Frank Slomka epartment of omputer Scence Unversty of Oldenburg Ammerländer Heerstraße 114-118 26111 Oldenburg, Germany {albers,
More informationNumerical Heat and Mass Transfer
Master degree n Mechancal Engneerng Numercal Heat and Mass Transfer 06-Fnte-Dfference Method (One-dmensonal, steady state heat conducton) Fausto Arpno f.arpno@uncas.t Introducton Why we use models and
More informationDynamic Scheduling and Control-Quality Optimization of Self-Triggered Control Applications
Dynamc Schedulng and Control-Qualty Optmzaton of Self-Trggered Control Applcatons Sam, Sohel; Eles, Petru; Peng, Zebo; Tabuada, Paulo; Cervn, Anton 200 Lnk to publcaton Ctaton for publshed verson (APA):
More informationResource Sharing. CSCE 990: Real-Time Systems. Steve Goddard. Resources & Resource Access Control (Chapter 8 of Liu)
CSCE 990: Real-Tme Systems Resource Sharng Steve Goddard goddard@cse.unl.edu http://www.cse.unl.edu/~goddard/courses/realtmesystems Resources & Resource Access Control (Chapter 8 of Lu) Real-Tme Systems
More informationEEL 6266 Power System Operation and Control. Chapter 3 Economic Dispatch Using Dynamic Programming
EEL 6266 Power System Operaton and Control Chapter 3 Economc Dspatch Usng Dynamc Programmng Pecewse Lnear Cost Functons Common practce many utltes prefer to represent ther generator cost functons as sngle-
More informationWorst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption
Real-Tme Syst (2009) 42: 63 119 DOI 10.1007/s11241-009-9071-z Worst-case response tme analyss of real-tme tasks under fxed-prorty schedulng wth deferred preempton Render J. Brl Johan J. Lukken Wm F.J.
More informationTokyo Institute of Technology Periodic Sequencing Control over Multi Communication Channels with Packet Losses
oyo Insttute of echnology Fujta Laboratory oyo Insttute of echnology erodc Sequencng Control over Mult Communcaton Channels wth acet Losses FL6-7- /8/6 zwrman Gusrald oyo Insttute of echnology Fujta Laboratory
More informationPreDVS: Preemptive Dynamic Voltage Scaling for Real-time Systems using Approximation Scheme
PreDVS: Preemptve Dynamc Voltage Scalng for Real-tme Systems usng Approxmaton Scheme Wexun Wang and Prabhat Mshra Department of Computer and Informaton Scence and Engneerng Unversty of Florda, Ganesvlle,
More informationModeling Structured Event Streams in System Level Performance Analysis
Modelng Structured Event Streams n System Level Performance Analyss Smon Perathoner Lothar hele obas Ren Ka Lampka Computer Engneerng and Networks Laboratory EH Zurch, Swtzerland {perathoner, thele, lampka}@tk.ee.ethz.ch
More informationFixed-Priority Multiprocessor Scheduling with Liu & Layland s Utilization Bound
Fxed-Prorty Multprocessor Schedulng wth Lu & Layland s Utlzaton Bound Nan Guan, Martn Stgge, Wang Y and Ge Yu Department of Informaton Technology, Uppsala Unversty, Sweden Department of Computer Scence
More informationPartitioned EDF Scheduling in Multicore systems with Quality of Service constraints
Parttoned EDF Schedulng n Multcore systems wth Qualty of Servce constrants Nadne Abdallah, Audrey Queudet, Marylne Chetto, Rafc Hage Chehade To cte ths verson: Nadne Abdallah, Audrey Queudet, Marylne Chetto,
More informationProcrastination Scheduling for Fixed-Priority Tasks with Preemption Thresholds
Procrastnaton Schedulng for Fxed-Prorty Tasks wth Preempton Thresholds XaoChuan He, Yan Ja Insttute of Network Technology and Informaton Securty School of Computer Scence Natonal Unversty of Defense Technology
More informationFixed-Priority Multiprocessor Scheduling with Liu & Layland s Utilization Bound
Fxed-Prorty Multprocessor Schedulng wth Lu & Layland s Utlzaton Bound Nan Guan, Martn Stgge, Wang Y and Ge Yu Department of Informaton Technology, Uppsala Unversty, Sweden Department of Computer Scence
More informationInstantaneous Utilization Based Scheduling Algorithms for Real Time Systems Radhakrishna Naik 1, R.R.Manthalkar 2 Pune University 1, SGGS Nanded 2
Radhakrshna Nak et al, / (IJSIT) Internatonal Journal of omputer Scence and Informaton Technologes, Vol. (),, 654-66 Instantaneous tlzaton Based Schedulng Algorthms for Real Tme Systems Radhakrshna Nak,
More informationSupplementary Notes for Chapter 9 Mixture Thermodynamics
Supplementary Notes for Chapter 9 Mxture Thermodynamcs Key ponts Nne major topcs of Chapter 9 are revewed below: 1. Notaton and operatonal equatons for mxtures 2. PVTN EOSs for mxtures 3. General effects
More informationSchedulability Analysis of Task Sets with Upper- and Lower-Bound Temporal Constraints
Schedulablty Analyss of Task Sets wth Upper- and Lower-Bound Temporal Constrants The MIT Faculty has made ths artcle openly avalable. Please share how ths access benefts you. Your story matters. Ctaton
More informationCache-Aware Compositional Analysis of Real- Time Multicore Virtualization Platforms
University of Pennsylvania ScholarlyCommons Departmental Papers (CIS) Department of Computer & Information Science -25 Cache-Aware Compositional Analysis of Real- Time Multicore Virtualization Platforms
More informationSingle-Facility Scheduling over Long Time Horizons by Logic-based Benders Decomposition
Sngle-Faclty Schedulng over Long Tme Horzons by Logc-based Benders Decomposton Elvn Coban and J. N. Hooker Tepper School of Busness, Carnege Mellon Unversty ecoban@andrew.cmu.edu, john@hooker.tepper.cmu.edu
More informationComputer Control: Task Synchronisation in Dynamic Priority Scheduling
Computer Control: Task Synchronsaton n Dynamc Prorty Schedulng Sérgo Adrano Fernandes Lopes Department of Industral Electroncs Engneerng School Unversty of Mnho Campus de Azurém 4800 Gumarães - PORTUGAL
More informationSchedulability Analysis of Preemptive and Nonpreemptive EDF on Partial Runtime-Reconfigurable FPGAs
Schedulablty Analyss of Preemptve and Nonpreemptve EDF on Partal Runtme-Reconfgurable FPGAs 56 NAN GUAN and QINGXU DENG Northeastern Unversty, Chna ZONGHUA GU Hong Kong Unversty of Scence and Technology,
More informationThe strict priority scheduler
6. SP and GPS schedulers Pag. The strct prorty scheduler The strct prorty scheduler s very smple and effcent In the followng, we wll carry out the analyss of ths scheduler to determne the formulas for
More information829. An adaptive method for inertia force identification in cantilever under moving mass
89. An adaptve method for nerta force dentfcaton n cantlever under movng mass Qang Chen 1, Mnzhuo Wang, Hao Yan 3, Haonan Ye 4, Guola Yang 5 1,, 3, 4 Department of Control and System Engneerng, Nanng Unversty,
More informationOn the Scheduling of Mixed-Criticality Real-Time Task Sets
On the Schedulng of Mxed-Crtcalty Real-Tme Task Sets Donso de Nz, Karthk Lakshmanan, and Ragunathan (Raj) Rajkumar Carnege Mellon Unversty, Pttsburgh, PA - 15232 Abstract The functonal consoldaton nduced
More informationImprovements in the configuration of Posix b scheduling
Improvements n the confguraton of Posx 1003.1b schedulng Matheu Grener, Ncolas Navet To cte ths verson: Matheu Grener, Ncolas Navet. Improvements n the confguraton of Posx 1003.1b schedulng. Ncolas Navet
More informationOn the Throughput of Clustered Photolithography Tools:
On the hroughput of lustered Photolthography ools: Wafer Advancement and Intrnsc Equpment Loss Maruth Kumar Mutnur James R. Morrson, Ph.D. September 23, 2007 Presentaton Outlne Motvaton Model : Synchronous
More informationA Simple Inventory System
A Smple Inventory System Lawrence M. Leems and Stephen K. Park, Dscrete-Event Smulaton: A Frst Course, Prentce Hall, 2006 Hu Chen Computer Scence Vrgna State Unversty Petersburg, Vrgna February 8, 2017
More informationCOMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
Avalable onlne at http://sck.org J. Math. Comput. Sc. 3 (3), No., 6-3 ISSN: 97-537 COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
More informationBayesian Learning. Smart Home Health Analytics Spring Nirmalya Roy Department of Information Systems University of Maryland Baltimore County
Smart Home Health Analytcs Sprng 2018 Bayesan Learnng Nrmalya Roy Department of Informaton Systems Unversty of Maryland Baltmore ounty www.umbc.edu Bayesan Learnng ombnes pror knowledge wth evdence to
More informationJoint Scheduling and Power-Allocation for Interference Management in Wireless Networks
Jont Schedulng and Power-Allocaton for Interference Management n Wreless Networks Xn Lu *, Edwn K. P. Chong, and Ness B. Shroff * * School of Electrcal and Computer Engneerng Purdue Unversty West Lafayette,
More informationMixed-criticality Scheduling with Memory Bandwidth Regulation
Mxed-crtcalty Schedulng wth Memory Bandwdth Regulaton Muhammad Al Awan, Pedro F. Souto, Konstantnos Bletsas, Benny Akesson, Eduardo Tovar CISTER/INESC-TEC and ISEP/IPP, Porto, Portugal Unversty of Porto,
More informationMinimizing Cache Overhead via Loaded Cache Blocks and Preemption Placement
Mnmzng Cache Overhead va Loaded Cache Blocks and Preempton Placement John Cavccho, Corey Tessler, and Nathan Fsher Wayne State Unversty {ba6444, corey.tessler, fshern}@wayne.edu Abstract Schedulablty analyss
More informationQuantifying the Sub-optimality of Uniprocessor Fixed Priority Non-Pre-emptive Scheduling
Quantfyng the Sub-optmalty of Unprocessor Fxed Prorty Non-Pre-emptve Schedulng Robert I Davs Real-Tme Systems Research Group, Department of Computer Scence, Unversty of York, York, UK robdavs@csyorkacuk
More information3D Estimates of Analysis and Short-Range Forecast Error Variances
3D Estmates of Analyss and Short-Range Forecast Error Varances Je Feng, Zoltan Toth Global Systems Dvson, ESRL/OAR/NOAA, Boulder, CO, USA Malaquas Peña Envronmental Modelng Center, NCEP/NWS/NOAA, College
More informationCritical sections. Using semaphores. Using semaphores. Using semaphores. How long is blocking time? 17/10/2016. Problems caused by mutual exclusion
rtcal sectons Problems caused by mutual excluson crtcal secton wat(s) x = ; y = 5; sgnal(s) wrte global memory buffer nt x; nt y; read wat(s) a = x+; b = y+; c = x+y; crtcal secton sgnal(s) Usng semaphores
More informationConcepts for Wireless Ad Hoc
Bandwdth and Avalable Bandwdth oncepts for Wreless Ad Hoc Networks Marco A. Alzate Unversdad Dstrtal, Bogotá Néstor M. Peña Unversdad de los Andes, Bogotá Mguel A. abrador Unversty of South Florda, Tampa
More informationAn Admission Control Algorithm in Cloud Computing Systems
An Admsson Control Algorthm n Cloud Computng Systems Authors: Frank Yeong-Sung Ln Department of Informaton Management Natonal Tawan Unversty Tape, Tawan, R.O.C. ysln@m.ntu.edu.tw Yngje Lan Management Scence
More informationn α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0
MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector
More informationRegulation No. 117 (Tyres rolling noise and wet grip adhesion) Proposal for amendments to ECE/TRANS/WP.29/GRB/2010/3
Transmtted by the expert from France Informal Document No. GRB-51-14 (67 th GRB, 15 17 February 2010, agenda tem 7) Regulaton No. 117 (Tyres rollng nose and wet grp adheson) Proposal for amendments to
More informationCHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE
CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng
More informationAssignment 5. Simulation for Logistics. Monti, N.E. Yunita, T.
Assgnment 5 Smulaton for Logstcs Mont, N.E. Yunta, T. November 26, 2007 1. Smulaton Desgn The frst objectve of ths assgnment s to derve a 90% two-sded Confdence Interval (CI) for the average watng tme
More informationTwo-Phase Low-Energy N-Modular Redundancy for Hard Real-Time Multi-Core Systems
1 Two-Phase Low-Energy N-Modular Redundancy for Hard Real-Tme Mult-Core Systems Mohammad Saleh, Alreza Ejlal, and Bashr M. Al-Hashm, Fellow, IEEE Abstract Ths paper proposes an N-modular redundancy (NMR)
More informationScheduling within Temporal Partitions: Response-time Analysis and Server Design
chedulng wthn Temporal Parttons: Response-tme Analyss and erver Desgn Lus Almeda LE-IEETA/DET Unversdade de Avero Avero, Portugal lda@det.ua.pt Paulo Pedreras LE-IEETA/DET Unversdade de Avero Avero, Portugal
More informationSimulated Power of the Discrete Cramér-von Mises Goodness-of-Fit Tests
Smulated of the Cramér-von Mses Goodness-of-Ft Tests Steele, M., Chaselng, J. and 3 Hurst, C. School of Mathematcal and Physcal Scences, James Cook Unversty, Australan School of Envronmental Studes, Grffth
More informationAging model for a 40 V Nch MOS, based on an innovative approach F. Alagi, R. Stella, E. Viganò
Agng model for a 4 V Nch MOS, based on an nnovatve approach F. Alag, R. Stella, E. Vganò ST Mcroelectroncs Cornaredo (Mlan) - Italy Agng modelng WHAT IS AGING MODELING: Agng modelng s a tool to smulate
More informationPerformance-Energy Trade-off in Multi-Server Queueing Systems with Setup Delay
Performance-Energy Trade-off n Mlt-Server Qeeng Systems wth Setp Delay Saml Aalto Aalto Unversty, Fnland LCCC Clod Comptng Workshop 7 9 May 2014 Lnd, Sweden Co-operaton wth Esa Hyytä, Pas Lassla, Mskr
More informationFUZZY GOAL PROGRAMMING VS ORDINARY FUZZY PROGRAMMING APPROACH FOR MULTI OBJECTIVE PROGRAMMING PROBLEM
Internatonal Conference on Ceramcs, Bkaner, Inda Internatonal Journal of Modern Physcs: Conference Seres Vol. 22 (2013) 757 761 World Scentfc Publshng Company DOI: 10.1142/S2010194513010982 FUZZY GOAL
More informationAnalysis and Implementation of Global Preemptive Fixed-Priority Scheduling with Dynamic Cache Allocation*
Analysis and Implementation of Global Preemptive Fixed-Priority Scheduling with Dynamic Cache Allocation* Meng Xu Linh Thi Xuan Phan Hyon-Young Choi Insup Lee University of Pennsylvania Abstract We introduce
More informationA FAST HEURISTIC FOR TASKS ASSIGNMENT IN MANYCORE SYSTEMS WITH VOLTAGE-FREQUENCY ISLANDS
Shervn Haamn A FAST HEURISTIC FOR TASKS ASSIGNMENT IN MANYCORE SYSTEMS WITH VOLTAGE-FREQUENCY ISLANDS INTRODUCTION Increasng computatons n applcatons has led to faster processng. o Use more cores n a chp
More informationOutline. EEC 686/785 Modeling & Performance Evaluation of Computer Systems. Lecture k r Factorial Designs with Replication
EEC 66/75 Modelng & Performance Evaluaton of Computer Systems Lecture 3 Department of Electrcal and Computer Engneerng Cleveland State Unversty wenbng@eee.org (based on Dr. Ra Jan s lecture notes) Outlne
More informationUsing Traffic Regulation to Meet End-to-End Deadlines in ATM Networks
IEEE TRANSACTIONS ON COMPUTERS, VOL. 48, NO. 9, SEPTEMBER 1999 917 Usng Traffc Regulaton to Meet End-to-End Deadlnes n ATM Networks Amtava Raha, Sanjay Kamat, Xaohua Ja, Member, IEEE Computer Socety, and
More informationQueueing Networks II Network Performance
Queueng Networks II Network Performance Davd Tpper Assocate Professor Graduate Telecommuncatons and Networkng Program Unversty of Pttsburgh Sldes 6 Networks of Queues Many communcaton systems must be modeled
More informationNP-Completeness : Proofs
NP-Completeness : Proofs Proof Methods A method to show a decson problem Π NP-complete s as follows. (1) Show Π NP. (2) Choose an NP-complete problem Π. (3) Show Π Π. A method to show an optmzaton problem
More informationComputation of Higher Order Moments from Two Multinomial Overdispersion Likelihood Models
Computaton of Hgher Order Moments from Two Multnomal Overdsperson Lkelhood Models BY J. T. NEWCOMER, N. K. NEERCHAL Department of Mathematcs and Statstcs, Unversty of Maryland, Baltmore County, Baltmore,
More informationEmbedded Systems Development
Embedded Systems Development Leture eal-tme Shedulng Dr. Danel Kästner AbsInt Angewandte Informat GmbH aestner@absnt.om Leture Evaluaton Please do leture evaluaton Deadlne tomorrow! http://www.lx.un-saarland.de
More informationPredictable Execution Model: Concept and Implementation
Predctable Executon Model: Concept and Implementaton Rodolfo Pellzzon, Emlano Bett, Stanley Bak, Gang Yao, John Crswell and Marco Caccamo Unversty of Illnos at Urbana-Champagn, IL, USA, {rpellz2, ebett,
More informationModeling and Simulation of a Hexapod Machine Tool for the Dynamic Stability Analysis of Milling Processes. C. Henninger, P.
Smpack User Meetng 27 Modelng and Smulaton of a Heapod Machne Tool for the Dynamc Stablty Analyss of Mllng Processes C. Hennnger, P. Eberhard Insttute of Engneerng project funded by the DFG wthn the framework
More informationPlanning and Scheduling to Minimize Makespan & Tardiness. John Hooker Carnegie Mellon University September 2006
Plannng and Schedulng to Mnmze Makespan & ardness John Hooker Carnege Mellon Unversty September 2006 he Problem Gven a set of tasks, each wth a deadlne 2 he Problem Gven a set of tasks, each wth a deadlne
More informationComments on a secure dynamic ID-based remote user authentication scheme for multiserver environment using smart cards
Comments on a secure dynamc ID-based remote user authentcaton scheme for multserver envronment usng smart cards Debao He chool of Mathematcs tatstcs Wuhan nversty Wuhan People s Republc of Chna Emal: hedebao@63com
More informationModeling of Risk Treatment Measurement Model under Four Clusters Standards (ISO 9001, 14001, 27001, OHSAS 18001)
Avalable onlne at www.scencedrect.com Proceda Engneerng 37 (202 ) 354 358 The Second SREE Conference on Engneerng Modelng and Smulaton Modelng of Rsk Treatment Measurement Model under Four Clusters Standards
More informationWinter 2008 CS567 Stochastic Linear/Integer Programming Guest Lecturer: Xu, Huan
Wnter 2008 CS567 Stochastc Lnear/Integer Programmng Guest Lecturer: Xu, Huan Class 2: More Modelng Examples 1 Capacty Expanson Capacty expanson models optmal choces of the tmng and levels of nvestments
More informationA Weighted Utility Framework for Mining Association Rules
A Weghted Utlty Framework for Mnng Assocaton Rules M Sulaman Khan 1, 2, Maybn Muyeba 1, Frans Coenen 2 1 School of Computng, Lverpool Hope Unversty, UK 2 Department of Computer Scence, Unversty of Lverpool,
More informationFINAL REPORT. To: The Tennessee Department of Transportation Research Development and Technology Program
FINAL REPORT To: The Tennessee Department of Transportaton Research Development and Technology Program Project #: Truck Congeston Mtgaton through Freght Consoldaton n Volatle Mult-tem Supply Chans Prepared
More informationEstimation: Part 2. Chapter GREG estimation
Chapter 9 Estmaton: Part 2 9. GREG estmaton In Chapter 8, we have seen that the regresson estmator s an effcent estmator when there s a lnear relatonshp between y and x. In ths chapter, we generalzed the
More information