Real-Time Systems. Multiprocessor scheduling. Multiprocessor scheduling. Multiprocessor scheduling
|
|
- Lee Williamson
- 5 years ago
- Views:
Transcription
1 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 executng a task are determned before system s put n msson ( off-lne ) Approach: Dynamc assgnment The processor(s) used for executng a task are determned durng system operaton on-lne Approach: Global schedulng Multprocessor schedulng Multprocessor schedulng How are tasks allowed to mgrate? No mgraton! Each nstance of a task must execute on the same processor Equvalent to multple unprocessor systems! Global schedulng Full mgraton! A task s allowed to execute on an arbtrary processor Mgraton can occur even durng executon of an nstance of a task (for example, after beng preempted) A fundamental lmt: (Andersson, Baruah & Jonsson, 00) The utlzaton guarantee bound for multprocessor schedulng (parttoned or global) usng statc task prortes cannot be hgher than / of the capacty of the processors. Hence, we should not expect to utlze more than half the processng capacty f hard real-tme constrants exst. A way to crcumvent ths lmt s to use p-far (prortes + tme quanta) schedulng and dynamc task prortes.
2 General characterstcs: Each processor has ts own queue for ready tasks Tasks are organzed n groups, and each task group s assgned to a specfc processor For example, usng a bn-packng algorthm When selected for executon, a task can only be dspatched to ts assgned processor Advantages: Mature schedulng framework Most unprocessor schedulng theory also applcable here Unprocessor resource-management protocols can be used Supported by automotve ndustry AUTOSAR prescrbes parttoned schedulng Dsadvantages: Cannot explot all unused executon tme Surplus capacty cannot be shared among processors Wll suffer from overly-pessmstc WCET dervaton Bn-packng algorthms: Basc dea: The problem concerns packng objects of varyng szes n boxes ( bns ) wth the objectve of mnmzng number of used boxes. Applcaton to multprocessor systems: Bns are represented by processors and objects by tasks. The decson whether a processor s full or not s derved from a utlzaton-based feasblty test. Assumptons: Independent, perodc tasks Preemptve, unprocessor schedulng (RM) Bn-packng algorthms: Rate-Monotonc-Frst-Ft (RMFF): (Dhall and Lu, 978) Let the processors be ndexed as μ,μ, Assgn the tasks n the order of ncreasng perods (that s, RM order). For each task, choose the lowest prevously-used j such that, together wth all tasks that have already been assgned to processor μ j, can be feasbly scheduled accordng to the utlzaton-based RM-feasblty test. Processors are added f needed for RM-schedulablty.
3 (ths page delberately left blank) Bn-packng algorthms: U RMFF The utlzaton guarantee bound for a system wth m processors usng RMFF schedulng s m( / ) U RMFF (Oh & Baker, 998) Note: ( / ) 0.4 Thus: task sets whose utlzaton do not exceed 4% of the total processor capacty s always RMFF-schedulable. Global schedulng General characterstcs: All ready tasks are kept n a common (global) queue that s shared among the processors Whenever a processor becomes dle, a task from the global queue s selected for executon on that processor. After beng preempted, a task may be dspatched to a processor other than the one that started executng the task. Global schedulng Advantages: Supported by most multprocessor operatng systems Wndows 7, Mac OS X, Lnux,... Effectve utlzaton of processng resources Unused processor tme can easly be reclamed, for example when a task does not execute ts full WCET. Dsadvantages: Few results from the unprocessor case can be used 3
4 The root of all evl n global schedulng: (Lu, 969) Few of the results obtaned for a sngle processor generalze drectly to the multple processor case; brngng n addtonal processors adds a new dmenson to the schedulng problem. The smple fact that a task can use only one processor even when several processors are free at the same tme adds a surprsng amount of dffculty to the schedulng of multple processors. Underlyng causes: Dhall s effect: Wth RM, DM and EDF, some low-utlzaton task sets can be unschedulable regardless of how many processors are used. Thus, any utlzaton guarantee bound would become so low that t would be useless n practce. Ths s n contrast to the unprocessor case where we have utlzaton guarantee bounds of 69.3% (RM) and 00% (EDF). Hard-to-fnd crtcal nstant: A crtcal nstant does not always occur when a task arrves at the same tme as all ts hgher-prorty tasks. Ths s n stark contrast to the unprocessor case! Dhall s effect: (Dhall & Lu, 978) (RM schedulng) { C, ε T } { C, ε T } { C3, ε T3 } { C, T + ε} Dhall s effect: Apples for RM, DM and EDF schedulng Least utlzaton of unschedulable task sets can be arbtrarly close to no matter how many processors are used. μ 4 4 msses ts deadlne U global m ε + ε + when ε 0 μ μ 3 0 ε + ε Consequence: New multprocessor prorty-assgnment schemes are needed! 4
5 Hard-to-fnd crtcal nstant: 3 μ μ (RM schedulng) response tme of 3 s maxmzed for second nstance, 3,,,3,4 3,,5 3,3,6,7 3,4,8,,,,,3,3,4,5,4 { C, T } { C, T 3} { C, T 4} Hard-to-fnd crtcal nstant: A crtcal nstant does not always occur when a task arrves at the same tme as all ts hgher-prorty tasks. Fndng the crtcal nstant s a very (NP-?) hard problem Note: recall that knowledge about the crtcal nstant s a fundamental property n unprocessor feasblty tests. Consequence: New methods for constructng effectve multprocessor feasblty tests are needed! New prorty-assgnment scheme Dhall s effect: (Dhall & Lu, 978) (RM schedulng) 4 { C, ε T } { C, ε T } { C3, ε T3 } { C, T + ε} msses ts deadlne How to avod Dhall s effect: Problem: RM, DM & EDF only account for task deadlnes! Actual computaton demands are not accounted for. Soluton: Dhall s effect can easly be avoded by lettng tasks wth hgh utlzaton receve hgher prorty: μ μ 4 4 μ μ μ 3 0 ε + ε μ 3 0 ε + ε 5
6 New prorty-assgnment scheme Example: RM-US[m/(3m-)] RM-US[m/(3m-)]: (Andersson, Baruah & Jonsson, 00) RM-US[m/(3m-)] assgns (statc) prortes to tasks accordng to the followng rule: If U > m/(3m ) then has the hghest prorty (tes broken arbtrarly) If U m/(3m ) then has RM prorty Clearly, tasks wth hgher utlzaton, U C / T, get hgher prorty. Problem: Assgn prortes accordng to RM-US[m/(3m-)], assumng the followng task set to be scheduled on a system wth m 3 processors: { C, T 7} { C, T 0} 3 { C3 9, T3 0} 4 { C4, T4 } { C, T 5} We solve ths on the blackboard! New feasblty tests New feasblty tests Processor utlzaton analyss for RM-US[m/(3m-)]: A suffcent condton for RM-US[m/(3m-)] schedulng on m dentcal processors s n C m U T 3m Queston: does RM-US[m/(3m-)] avod Dhall s effect? Processor utlzaton analyss for RM-US[m/(3m-)]: We observe that, regardless of the number of processors, the task set wll always meet ts deadlnes as long as no more than one thrd of the processng capacty s used: U RM US m m m [ /(3m )] lm m 3 m 3 RM-US[m/(3m-)] thus avods Dhall s effect snce we can always add more processors f deadlnes were mssed. Note that ths remedy was not possble wth tradtonal RM. 6
7 New feasblty tests Response-tme analyss for multprocessors: Uses the same prncple as the unprocessor case, where the response tme for a task conssts of: C I The task s unnterrupted executon tme (WCET) Interference from hgher-prorty tasks R C + I The dfference s that the calculaton of nterference now has to account for the fact that hgher-prorty tasks can execute n parallel on the processors. New feasblty tests Response-tme analyss for multprocessors: For the multprocessor case, wth n tasks and m processors, we observe two thngs:. Interference can only occur when n> m. { }. Interference can only affect tasks k : k > m snce the m hghest-prorty tasks wll always execute n parallel wthout contenton on the m processors. Consequently, nterference of a task s a functon of the executon overlap of ts hgher-prorty tasks. New feasblty tests New feasblty tests Response-tme analyss for multprocessors: The followng two observatons gve us the secret to analyzng the nterference of a task: Wth respect to the executon overlap t can be shown that the nterference s maxmzed when the hgher-prorty tasks completely overlap ther executon. Compared to the unprocessor case, one extra nstance of each hgher-prorty task must be accounted for n the nterference analyss. Response-tme analyss for multprocessors: The worst-case nterference term s R I Cj + Cj m j hp() T j where hp() s the set of tasks wth hgher prorty than. The worst-case response tme for a task s thus: R R C + Cj + Cj m j hp() T j 7
8 New feasblty tests Global schedulng Response-tme analyss for multprocessors: As before, an teratve approach can be used for fndng the worst-case response tme: n n R + R C + Cj + Cj m j hp() T j We now have a suffcent condton for statc-prorty schedulng on multprocessors: : R D State-of-the-art n global schedulng: Statc prortes: RM-US[m/(3m-)] crcumvents Dhall s effect and has a non-zero resource utlzaton guarantee bound of m/(3m-) 33.3%. In 003, Baker generalzed the RM-US results to DM. Dynamc prortes: In 00, Srnvasan & Baruah proposed the EDF-US[m/(m-)] scheme wth a correspondng non-zero resource utlzaton guarantee bound of m/(m-) 50%. Optmal multprocessor schedulng: Usng p-far (prortes + tme quanta) schedulng and dynamc prortes t s possble to acheve 00% resource utlzaton on a multprocessor. 8
Real-Time Systems. Lecture #14. Risat Pathan. Department of Computer Science and Engineering Chalmers University of Technology
Real-Time Systems Lecture #14 Risat Pathan Department of Computer Science and Engineering Chalmers University of Technology Real-Time Systems Specification Implementation Multiprocessor scheduling -- Partitioned
More informationEmbedded 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 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 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 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 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 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 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 informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationModule 9. Lecture 6. Duality in Assignment Problems
Module 9 1 Lecture 6 Dualty n Assgnment Problems In ths lecture we attempt to answer few other mportant questons posed n earler lecture for (AP) and see how some of them can be explaned through the concept
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 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 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 informationSimultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals
Smultaneous Optmzaton of Berth Allocaton, Quay Crane Assgnment and Quay Crane Schedulng Problems n Contaner Termnals Necat Aras, Yavuz Türkoğulları, Z. Caner Taşkın, Kuban Altınel Abstract In ths work,
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 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 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 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 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 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 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 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 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 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 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 informationLecture 4: November 17, Part 1 Single Buffer Management
Lecturer: Ad Rosén Algorthms for the anagement of Networs Fall 2003-2004 Lecture 4: November 7, 2003 Scrbe: Guy Grebla Part Sngle Buffer anagement In the prevous lecture we taled about the Combned Input
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 informationOn the Multicriteria Integer Network Flow Problem
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 5, No 2 Sofa 2005 On the Multcrtera Integer Network Flow Problem Vassl Vasslev, Marana Nkolova, Maryana Vassleva Insttute of
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 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 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 informationQuantifying the Exact Sub-Optimality of Non-Preemptive Scheduling
Quantfyng the Exact Sub-Optmalty of Non-Preemptve Schedulng Robert I. Davs 1, Abhlash Thekklakattl 2, Olver Gettngs 1, Radu Dobrn 2, and Saskumar Punnekkat 2 1 Real-Tme Systems Research Group, Unversty
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 informationOn Energy-Optimal Voltage Scheduling for Fixed-Priority Hard Real-Time Systems
On Energy-Optmal Voltage Schedulng for Fxed-Prorty Hard Real-Tme Systems HAN-SAEM YUN and JIHONG KIM Seoul Natonal Unversty We address the problem of energy-optmal voltage schedulng for fxed-prorty hard
More informationLecture Notes on Linear Regression
Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume
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 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 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 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 informationFor now, let us focus on a specific model of neurons. These are simplified from reality but can achieve remarkable results.
Neural Networks : Dervaton compled by Alvn Wan from Professor Jtendra Malk s lecture Ths type of computaton s called deep learnng and s the most popular method for many problems, such as computer vson
More informationStructure and Drive Paul A. Jensen Copyright July 20, 2003
Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.
More informationFREQUENCY DISTRIBUTIONS Page 1 of The idea of a frequency distribution for sets of observations will be introduced,
FREQUENCY DISTRIBUTIONS Page 1 of 6 I. Introducton 1. The dea of a frequency dstrbuton for sets of observatons wll be ntroduced, together wth some of the mechancs for constructng dstrbutons of data. Then
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 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 informationAssortment Optimization under MNL
Assortment Optmzaton under MNL Haotan Song Aprl 30, 2017 1 Introducton The assortment optmzaton problem ams to fnd the revenue-maxmzng assortment of products to offer when the prces of products are fxed.
More informationOverhead-Aware Compositional Analysis of Real-Time Systems
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 ompostonal
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 informationECE559VV Project Report
ECE559VV Project Report (Supplementary Notes Loc Xuan Bu I. MAX SUM-RATE SCHEDULING: THE UPLINK CASE We have seen (n the presentaton that, for downlnk (broadcast channels, the strategy maxmzng the sum-rate
More informationThe optimal delay of the second test is therefore approximately 210 hours earlier than =2.
THE IEC 61508 FORMULAS 223 The optmal delay of the second test s therefore approxmately 210 hours earler than =2. 8.4 The IEC 61508 Formulas IEC 61508-6 provdes approxmaton formulas for the PF for smple
More informationCS : Algorithms and Uncertainty Lecture 17 Date: October 26, 2016
CS 29-128: Algorthms and Uncertanty Lecture 17 Date: October 26, 2016 Instructor: Nkhl Bansal Scrbe: Mchael Denns 1 Introducton In ths lecture we wll be lookng nto the secretary problem, and an nterestng
More informationOutline. Communication. Bellman Ford Algorithm. Bellman Ford Example. Bellman Ford Shortest Path [1]
DYNAMIC SHORTEST PATH SEARCH AND SYNCHRONIZED TASK SWITCHING Jay Wagenpfel, Adran Trachte 2 Outlne Shortest Communcaton Path Searchng Bellmann Ford algorthm Algorthm for dynamc case Modfcatons to our algorthm
More informationA 2D Bounded Linear Program (H,c) 2D Linear Programming
A 2D Bounded Lnear Program (H,c) h 3 v h 8 h 5 c h 4 h h 6 h 7 h 2 2D Lnear Programmng C s a polygonal regon, the ntersecton of n halfplanes. (H, c) s nfeasble, as C s empty. Feasble regon C s unbounded
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 informationEconomics 101. Lecture 4 - Equilibrium and Efficiency
Economcs 0 Lecture 4 - Equlbrum and Effcency Intro As dscussed n the prevous lecture, we wll now move from an envronment where we looed at consumers mang decsons n solaton to analyzng economes full of
More informationSynchronization Protocols. Task Allocation Bin-Packing Heuristics: First-Fit Subtasks assigned in arbitrary order To allocate a new subtask T i,j
End-to-End Schedulng Framework 1. Tak allocaton: bnd tak to proceor 2. Synchronzaton protocol: enforce precedence contrant 3. Subdeadlne agnment 4. Schedulablty analy Tak Allocaton Bn-Packng eurtc: Frt-Ft
More informationKernel Methods and SVMs Extension
Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general
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 informationThe Schedulability Region of Two-Level Mixed-Criticality Systems based on EDF-VD
The Schedulablty Regon of Two-Level Mxed-Crtcalty Systems based on EDF-VD Drk Müller and Alejandro Masrur Department of Computer Scence TU Chemntz, Germany Abstract The algorthm Earlest Deadlne Frst wth
More informationMinimisation of the Average Response Time in a Cluster of Servers
Mnmsaton of the Average Response Tme n a Cluster of Servers Valery Naumov Abstract: In ths paper, we consder task assgnment problem n a cluster of servers. We show that optmal statc task assgnment s tantamount
More informationLecture 12: Classification
Lecture : Classfcaton g Dscrmnant functons g The optmal Bayes classfer g Quadratc classfers g Eucldean and Mahalanobs metrcs g K Nearest Neghbor Classfers Intellgent Sensor Systems Rcardo Guterrez-Osuna
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 informationEnergy and Feasibility Optimal Global Scheduling Framework on big.little platforms
Energy and Feasblty Optmal Global Schedulng Framework on bg.little platforms Hoon Sung Chwa, Jaebaek Seo, Hyuck Yoo Jnkyu Lee, Insk Shn Department of Computer Scence, KAIST, Republc of Korea Department
More informationErrors for Linear Systems
Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch
More informationComputing Correlated Equilibria in Multi-Player Games
Computng Correlated Equlbra n Mult-Player Games Chrstos H. Papadmtrou Presented by Zhanxang Huang December 7th, 2005 1 The Author Dr. Chrstos H. Papadmtrou CS professor at UC Berkley (taught at Harvard,
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 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 information= z 20 z n. (k 20) + 4 z k = 4
Problem Set #7 solutons 7.2.. (a Fnd the coeffcent of z k n (z + z 5 + z 6 + z 7 + 5, k 20. We use the known seres expanson ( n+l ( z l l z n below: (z + z 5 + z 6 + z 7 + 5 (z 5 ( + z + z 2 + z + 5 5
More informationEquilibrium Analysis of the M/G/1 Queue
Eulbrum nalyss of the M/G/ Queue Copyrght, Sanay K. ose. Mean nalyss usng Resdual Lfe rguments Secton 3.. nalyss usng an Imbedded Marov Chan pproach Secton 3. 3. Method of Supplementary Varables done later!
More informationAn Integrated OR/CP Method for Planning and Scheduling
An Integrated OR/CP Method for Plannng and Schedulng John Hooer Carnege Mellon Unversty IT Unversty of Copenhagen June 2005 The Problem Allocate tass to facltes. Schedule tass assgned to each faclty. Subect
More informationA Bayes Algorithm for the Multitask Pattern Recognition Problem Direct Approach
A Bayes Algorthm for the Multtask Pattern Recognton Problem Drect Approach Edward Puchala Wroclaw Unversty of Technology, Char of Systems and Computer etworks, Wybrzeze Wyspanskego 7, 50-370 Wroclaw, Poland
More informationTwo-Way and Multiple-Access Energy Harvesting Systems with Energy Cooperation
Two-Way and Multple-Access Energy Harvestng Systems wth Energy Cooperaton Berk Gurakan, Omur Ozel, Jng Yang 2, and Sennur Ulukus Department of Electrcal and Computer Engneerng, Unversty of Maryland, College
More informationprinceton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg
prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there
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 information11 Tail Inequalities Markov s Inequality. Lecture 11: Tail Inequalities [Fa 13]
Algorthms Lecture 11: Tal Inequaltes [Fa 13] If you hold a cat by the tal you learn thngs you cannot learn any other way. Mark Twan 11 Tal Inequaltes The smple recursve structure of skp lsts made t relatvely
More informationCIS526: Machine Learning Lecture 3 (Sept 16, 2003) Linear Regression. Preparation help: Xiaoying Huang. x 1 θ 1 output... θ M x M
CIS56: achne Learnng Lecture 3 (Sept 6, 003) Preparaton help: Xaoyng Huang Lnear Regresson Lnear regresson can be represented by a functonal form: f(; θ) = θ 0 0 +θ + + θ = θ = 0 ote: 0 s a dummy attrbute
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 informationPsychology 282 Lecture #24 Outline Regression Diagnostics: Outliers
Psychology 282 Lecture #24 Outlne Regresson Dagnostcs: Outlers In an earler lecture we studed the statstcal assumptons underlyng the regresson model, ncludng the followng ponts: Formal statement of assumptons.
More informationChapter - 2. Distribution System Power Flow Analysis
Chapter - 2 Dstrbuton System Power Flow Analyss CHAPTER - 2 Radal Dstrbuton System Load Flow 2.1 Introducton Load flow s an mportant tool [66] for analyzng electrcal power system network performance. Load
More informationLINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity
LINEAR REGRESSION ANALYSIS MODULE IX Lecture - 30 Multcollnearty Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur 2 Remedes for multcollnearty Varous technques have
More informationEnergy-Efficient Primary/Backup Scheduling Techniques for Heterogeneous Multicore Systems
Energy-Effcent Prmary/Backup Schedulng Technques for Heterogeneous Multcore Systems Abhshek Roy, Hakan Aydn epartment of Computer Scence George Mason Unversty Farfax, Vrgna 22030 aroy6@gmu.edu, aydn@cs.gmu.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 informationResource Reservation for Mixed Criticality Systems
Resource Reservaton for Mxed Crtcalty Systems Guseppe Lpar 1, Gorgo C. Buttazzo 2 1 LSV, ENS - Cachan, France 2 Scuola Superore Sant Anna, Italy Abstract. Ths paper presents a reservaton-based approach
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 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 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 informationAn Upper Bound on SINR Threshold for Call Admission Control in Multiple-Class CDMA Systems with Imperfect Power-Control
An Upper Bound on SINR Threshold for Call Admsson Control n Multple-Class CDMA Systems wth Imperfect ower-control Mahmoud El-Sayes MacDonald, Dettwler and Assocates td. (MDA) Toronto, Canada melsayes@hotmal.com
More informationMultiple Sound Source Location in 3D Space with a Synchronized Neural System
Multple Sound Source Locaton n D Space wth a Synchronzed Neural System Yum Takzawa and Atsush Fukasawa Insttute of Statstcal Mathematcs Research Organzaton of Informaton and Systems 0- Mdor-cho, Tachkawa,
More informationThe Minimum Universal Cost Flow in an Infeasible Flow Network
Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran
More informationClassification as a Regression Problem
Target varable y C C, C,, ; Classfcaton as a Regresson Problem { }, 3 L C K To treat classfcaton as a regresson problem we should transform the target y nto numercal values; The choce of numercal class
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 informationStatistics for Economics & Business
Statstcs for Economcs & Busness Smple Lnear Regresson Learnng Objectves In ths chapter, you learn: How to use regresson analyss to predct the value of a dependent varable based on an ndependent varable
More informationNUMERICAL DIFFERENTIATION
NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the
More informationLecture 10 Support Vector Machines. Oct
Lecture 10 Support Vector Machnes Oct - 20-2008 Lnear Separators Whch of the lnear separators s optmal? Concept of Margn Recall that n Perceptron, we learned that the convergence rate of the Perceptron
More informationEnergy-Aware Fault Tolerance in Fixed-Priority Real-Time Embedded Systems*
Energy-Aware Fault Tolerance n Fxed-Prorty Real-Tme Embedded Systems Yng Zang, Krsnendu Cakrabarty and Vsnu Swamnatan Department of Electrcal & Computer Engneerng Duke Unversty, Duram, NC 778, USA Abstract
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 informationE Tail Inequalities. E.1 Markov s Inequality. Non-Lecture E: Tail Inequalities
Algorthms Non-Lecture E: Tal Inequaltes If you hold a cat by the tal you learn thngs you cannot learn any other way. Mar Twan E Tal Inequaltes The smple recursve structure of sp lsts made t relatvely easy
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 informationP R. Lecture 4. Theory and Applications of Pattern Recognition. Dept. of Electrical and Computer Engineering /
Theory and Applcatons of Pattern Recognton 003, Rob Polkar, Rowan Unversty, Glassboro, NJ Lecture 4 Bayes Classfcaton Rule Dept. of Electrcal and Computer Engneerng 0909.40.0 / 0909.504.04 Theory & Applcatons
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 information