Aperiodic Task Scheduling
|
|
- Leona Washington
- 8 years ago
- Views:
Transcription
1 Aperiodic Task Scheduling Gerhard Fohler Mälardalen University, Sweden Real-Time Systems Gerhard Fohler 2005
2 Non Periodic Tasks So far periodic events and tasks what about others? Sporadic (aperiodic, but minimum interarrival time) worst case: all sporadic tasks arrive with highest frequency (with minimum time between arrivals) all other arrival patterns less demanding if we can schedule worst case, we can schedule all other worst case - minimum interarrival time - like periodic task assume sporadic tasks as periodic for schedulability test Real-Time Systems Gerhard Fohler
3 Aperiodic (no limitations on arrival times known) soft: without deadline not much to do from scheduling view firm: with deadline (worst case execution time needs to be known as well) usually all or nothing semantic: when we start task, we want that it runs until completion; else we don t start Real-Time Systems Gerhard Fohler
4 Background Services Fixed priority scheduling, rate monotonic What is the minimum we can do for aperiodic tasks in a periodically scheduled system? Background service: execute aperiodic tasks when no periodic ones are executing no disturbance of periodic tasks (and their feasibility) simple run-time mechanisms queue for periodics queue for aperiodics - FCFS no guarantees Real-Time Systems Gerhard Fohler
5 Polling Server Background service lives from left overs of periodic tasks, without guarantees If enough idle time, ok long response times, although faster service possible How can we provide that at least a certain amount of processing goes to aperiodic tasks? Server task periodic task, whose purpose is to service aperiodic requests as soon as possible period T s computation time C s is called capacity of the server Real-Time Systems Gerhard Fohler
6 Polling server algorithm at periods T s server becomes active and serves aperiodic requests with its capacity C s no aperiodic activities - not execute, waits for next period, capacity lost based on rate monotonic Lehozcky, Sha, Strosnider, Sprunt 987, 989 Real-Time Systems Gerhard Fohler
7 Example Polling Server two tasks, 2 C i T i server C s =2 T S =5 Real-Time Systems Gerhard Fohler
8 server Cs=2 TS=5 2 aper. c=2 c= c=2 c= no no aper cap time C s 2 Real-Time Systems Gerhard Fohler
9 Aperiodic Guarantee Aperiodic guarantee hard aperiodic task T a, C a, D a worst case: aperiodic request misses the server task has to wait until next instance if C a <= C s, aperiodic request completed within two server periods (one for waiting, one for executing) 2*T s <= D a arbitrary execution times: T s + C a /C s T s <= D a average response time not very good! Real-Time Systems Gerhard Fohler
10 Further FPS Server Algorithms Deferrable Server(Lehozcky, Sha, Strosnider 987, 995) lower bound for periodic tasks Priority exchange (Lehozcky, Sha, Strosnider 987) Sporadic server Sprunt, Sha, Lehozcky 989 replenishes capacity only after aperiodic execution optimum algorithm does not exist! Tia, Liu, Shankar 995 proof that with static priority assignment, no algorithm exists to minimize response time Real-Time Systems Gerhard Fohler
11 Dynamic Priority Servers EDF based Dynamic priority exchange server Spuri, Buttazzo 994, 996 like rate monotonic priority exchange, but for EDF Dynamic sporadic server Spuri, Buttazzo 994, 996 Earliest deadline late server Chetto, Chetto 989 Real-Time Systems Gerhard Fohler 2005
12 Total bandwidth server Spuri, Buttazzo 994, 996 response time dependent on server period: shorter periods have shorter response times but higher overhead how else shorter response times? change the deadline of the aperiodic to earlier time (its EDF here, so it will get serviced earlier) but make sure that total load of aperiodics does not exceed maximum value (bandwidth) U s Real-Time Systems Gerhard Fohler
13 How can we calculate minimum deadline for U S? assume we have all CPU for us: dl = C U U t C t+c 0.5 U S t C t+2*c Real-Time Systems Gerhard Fohler
14 k th aperiodic request arrival time r k computation time c k deadline d k server utilization U S d k = max( r k, d k- ) + C k /U s d 0 = 0 uses all bandwidth of server very simple run-time mechanism no extra server task schedulability U p + U s <= Sum of periodic load and bandwidth of server less or equal. Real-Time Systems Gerhard Fohler
15 Example Total Bandwidth Server periodic tasks (3,6), 2 (2,8) TBS U s = - U p = aper. dl = 3+/0.25=7 2 dl 3 = max(4,7)+/0.25= time dl 2 = 9+2/0.25=7 Real-Time Systems Gerhard Fohler
16 Total Bandwith Server - Comments based on U s not actual periodic load worst case c Real-Time Systems Gerhard Fohler
17 Total Bandwith Server - Comments TBS assigns deadlines based on maximum U s (not actual load) d k = max( r k, d k- ) + C k /U s, d 0 = 0 U s =0.25 aper. dl = 6+/0.25= time Real-Time Systems Gerhard Fohler
18 TB* Buttazzo, Sensini assigns deadlines d k first according to TBS then shortens, as much as periodics allow new d = f k k finishing time according to EDF schedule, including periodics apply recursively maintains schedulability, since order maintained complexity, many steps Real-Time Systems Gerhard Fohler
19 Constant Bandwidth Server Abeni and Buttazzo, 998 designed for multimedia applications sporadic (hard) tasks soft tasks: mean execution, interarrival times, not fixed periodic tasks assign maximum bandwidth of CPU to each soft task handles overload of aperiodics limited by assigned bandwidth might slow down, but not impair effect other tasks EDF based Real-Time Systems Gerhard Fohler
20 CBS Definitions task i sequence of jobs J i,j r i,j request, arrival time of the j th job of task I hard task (C i,t i ) C i worst case execution time T i minimum interarrival time deadline equal to next period: d i,j = r i,j + T i soft task (C i,t i ) C i mean execution time T i desired interarrival time soft deadline equal to next period: d i,j = r i,j + T i Real-Time Systems Gerhard Fohler
21 c S budget (Q S,T S ) Q S maximum budget T S period of server U S = Q S/ T S server bandwidth d S,k deadline associated to server initial d S,0 =0 job J i,j comes in, is served, assigned dynamic deadline d i,j equal to current server deadline d S,k job executes, server budget c s decreased Real-Time Systems Gerhard Fohler
22 c S =0: budget recharged to maximum Q S new server deadline: d s,k+ =d s,k +T S J i,j arrives, CBS active (jobs pending): put in queue J i,j arrives, CBS idle: c S (d s,k - r i,j )*U S : new deadline d s,k+ = r i,j + T S c S recharged to Q S else job served with last server deadline d s,k job finishes: next job in queue at any time, job assigned last deadline generated by server Real-Time Systems Gerhard Fohler
23 Example CBS (2,3) hard 2 soft c =3 c s (d s,0 - r )*U S :d s, =r +T S =9 c 2 =2 c s =<(23-7)*2/7=2/7 no new deadline server active - queue c 3 = CBS r r 2 r 3 c S = 0:d S,2 =d s, +T S =6 c S = 0:d S,3 =d s,2 +T S =23 (2,7) time Real-Time Systems Gerhard Fohler
24 limits impact harm by ill behaved aperiodics, e.g., exec time overrun various improvements several servers capacity exchange feedback control.. Real-Time Systems Gerhard Fohler
25 Articles TBS: Spuri, Buttazzo Efficient Aperiodic Service under Earliest Deadline Scheduling Proceedings of the 5th IEEE Real-Time System Symposium (RTSS 94), Portorico, pp. 2-2, December 994 CBS: L. Abeni and G. Buttazzo, "Integrating Multimedia Applications in Hard Real-Time Systems", Proceedings of the IEEE Real-Time Systems Symposium, Madrid, Spain, pp. 4-3, December 998. Real-Time Systems Gerhard Fohler
26 Schedulability Analysis First show that aperiodic load executed not exceeds U S of server Lemma: In each interval of time [t,t 2 ], if C ape is the total execution time demanded by aperiodic requests arrived at t or later and served with deadlines less than or equal to t 2, then Proof: by definition: C ape (t 2 - t ) U S C ape C k t rk, dk t 2 Real-Time Systems Gerhard Fohler
27 TB* uses periodic interference can now calculate it (formulae for completeness only) I f (t, d k s) = n i max 0, d s k next T i _ r ( t) i C i next_r i (t) time at which next instance of I after t starts Real-Time Systems Gerhard Fohler
28 TBS assigns deadlines in increasing order, therefore there must exist two aperiodic requests with indeces k and k 2 such that k C ape k k 2 k C k k k t 2 rk, d k t 2 k 2 C k C [ dk max( rk, dk k k k )] * U [ max( r, d k k k d )]* U 2 S S ( t t ) * 2 U S Real-Time Systems Gerhard Fohler
29 Proof main result: Theorem: Given a set of n periodic tasks with processor utilization U p and a TBS with processor utilization of U S, the whole set is schedulable by EDF if and only if U p + U S Proof: If: assume U p + U S plus overflow at time t overflow preceded by continuous utilization from a point t on (t < t), only instances of tasks ready at t or later and having deadlines less than or equal to t are run C total execution time demanded by these instances since there is overflow at t: t - t < C Real-Time Systems Gerhard Fohler
30 Real-Time Systems Gerhard Fohler we also know that ape i n i i C C T t t C * ' S i n i i U t t C T t t ) * ( * ' ' ) )*( ( ' U p U S t t it follows: U p +U S > # contradiction
31 only if: assume aperiodic request enters periodically with period T S and execution time C S =T S U S, then server behaves like periodic task total utilization of processor is then U p +U S if task set schedulable: U P +U S Real-Time Systems Gerhard Fohler
Resource Reservation & Resource Servers. Problems to solve
Resource Reservation & Resource Servers Problems to solve Hard-deadline tasks may be Periodic or Sporadic (with a known minimum arrival time) or Non periodic (how to deal with this?) Soft-deadline tasks
More informationImproved Handling of Soft Aperiodic Tasks in Offline Scheduled Real-Time Systems using Total Bandwidth Server
Improved Handling of Soft Aperiodic Tasks in Offline Scheduled Real-Time Systems using Total Bandwidth Server Gerhard Fohler, Tomas Lennvall Mälardalen University Västeras, Sweden gfr, tlv @mdh.se Giorgio
More informationScheduling Aperiodic and Sporadic Jobs in Priority- Driven Systems
Scheduling Aperiodic and Sporadic Jobs in Priority- Driven Systems Ingo Sander ingo@kth.se Liu: Chapter 7 IL2212 Embedded Software 1 Outline l System Model and Assumptions l Scheduling Aperiodic Jobs l
More informationReal-Time Scheduling (Part 1) (Working Draft) Real-Time System Example
Real-Time Scheduling (Part 1) (Working Draft) Insup Lee Department of Computer and Information Science School of Engineering and Applied Science University of Pennsylvania www.cis.upenn.edu/~lee/ CIS 41,
More information4. Fixed-Priority Scheduling
Simple workload model 4. Fixed-Priority Scheduling Credits to A. Burns and A. Wellings The application is assumed to consist of a fixed set of tasks All tasks are periodic with known periods This defines
More informationEfficient Scheduling of Sporadic, Aperiodic, and Periodic Tasks with Complex Constraints
Efficient Scheduling of Sporadic, Aperiodic, and Periodic Tasks with Complex Constraints Damir Isović and Gerhard Fohler Department of Computer Engineering Mälardalen University, Sweden dic,gfr@mdh.se
More informationPerformance of Algorithms for Scheduling Real-Time Systems with Overrun and Overload
Published in the Proceedings of the Eleventh Euromicro Conference on Real-Time Systems, 9-11 June 1999, held at University of York, England Performance of Algorithms for Scheduling Real-Time Systems with
More informationPredictable response times in event-driven real-time systems
Predictable response times in event-driven real-time systems Automotive 2006 - Security and Reliability in Automotive Systems Stuttgart, October 2006. Presented by: Michael González Harbour mgh@unican.es
More informationReal- Time Scheduling
Real- Time Scheduling Chenyang Lu CSE 467S Embedded Compu5ng Systems Readings Ø Single-Processor Scheduling: Hard Real-Time Computing Systems, by G. Buttazzo. q Chapter 4 Periodic Task Scheduling q Chapter
More informationPeriodic Task Scheduling
Periodic Task Scheduling Radek Pelánek Motivation and Assumptions Examples of Periodic Tasks sensory data acquisition control loops action planning system monitoring Motivation and Assumptions Simplifying
More information3. Scheduling issues. Common approaches /1. Common approaches /2. Common approaches /3. 2012/13 UniPD / T. Vardanega 23/01/2013. Real-Time Systems 1
Common approaches /1 3. Scheduling issues Clock-driven (time-driven) scheduling Scheduling decisions are made beforehand (off line) and carried out at predefined time instants The time instants normally
More informationAperiodic Task Scheduling
Aperiodic Task Scheduling Jian-Jia Chen (slides are based on Peter Marwedel) TU Dortmund, Informatik 12 Germany Springer, 2010 2014 年 11 月 19 日 These slides use Microsoft clip arts. Microsoft copyright
More informationReal-Time Scheduling 1 / 39
Real-Time Scheduling 1 / 39 Multiple Real-Time Processes A runs every 30 msec; each time it needs 10 msec of CPU time B runs 25 times/sec for 15 msec C runs 20 times/sec for 5 msec For our equation, A
More informationHARD REAL-TIME SCHEDULING: THE DEADLINE-MONOTONIC APPROACH 1. Department of Computer Science, University of York, York, YO1 5DD, England.
HARD REAL-TIME SCHEDULING: THE DEADLINE-MONOTONIC APPROACH 1 N C Audsley A Burns M F Richardson A J Wellings Department of Computer Science, University of York, York, YO1 5DD, England ABSTRACT The scheduling
More informationReal Time Scheduling Basic Concepts. Radek Pelánek
Real Time Scheduling Basic Concepts Radek Pelánek Basic Elements Model of RT System abstraction focus only on timing constraints idealization (e.g., zero switching time) Basic Elements Basic Notions task
More informationUsing EDF in Linux: SCHED DEADLINE. Luca Abeni luca.abeni@unitn.it
Using EDF in Linux: Luca Abeni luca.abeni@unitn.it Using Fixed Priorities in Linux SCHED FIFO and SCHED RR use fixed priorities They can be used for real-time tasks, to implement RM and DM Real-time tasks
More informationThe simple case: Cyclic execution
The simple case: Cyclic execution SCHEDULING PERIODIC TASKS Repeat a set of aperiodic tasks at a specific rate (cycle) 1 2 Periodic tasks Periodic tasks (the simplified case) Scheduled to run Arrival time
More informationHandling Sporadic Tasks in Real-time Systems - Combined Offline and Online Approach -
Handling Sporadic Tasks in Real-time Systems - Combined Offline and Online Approach - Damir Isović Department of Computer Engineering Mälardalen University, Sweden damir.isovic@mdh.se ZA MOJE RODITELJE
More information174: Scheduling Systems. Emil Michta University of Zielona Gora, Zielona Gora, Poland 1 TIMING ANALYSIS IN NETWORKED MEASUREMENT CONTROL SYSTEMS
174: Scheduling Systems Emil Michta University of Zielona Gora, Zielona Gora, Poland 1 Timing Analysis in Networked Measurement Control Systems 1 2 Introduction to Scheduling Systems 2 3 Scheduling Theory
More informationLecture Outline Overview of real-time scheduling algorithms Outline relative strengths, weaknesses
Overview of Real-Time Scheduling Embedded Real-Time Software Lecture 3 Lecture Outline Overview of real-time scheduling algorithms Clock-driven Weighted round-robin Priority-driven Dynamic vs. static Deadline
More informationAn Efficient Non-Preemptive Real-Time Scheduling
An Efficient Non-Preemptive Real-Time Scheduling Wenming Li, Krishna Kavi and Robert Akl Department of Computer Science and Engineering The University of North Texas Denton, Texas 7623, USA {wenming, kavi,
More informationA SIX-LEGGED ROBOT: REAL-TIME ISSUES AND ARCHITECTURE. Mauro Marinoni, Alessio Carlini, Giorgio Buttazzo
A SIX-LEGGED ROBOT: REAL-TIME ISSUES AND ARCHITECTURE Mauro Marinoni, Alessio Carlini, Giorgio Buttazzo University of Pavia, Italy Email: the.nino@libero.it, lbrgc@tin.it, buttazzo@unipv.it Abstract: Mobile
More informationLecture 3 Theoretical Foundations of RTOS
CENG 383 Real-Time Systems Lecture 3 Theoretical Foundations of RTOS Asst. Prof. Tolga Ayav, Ph.D. Department of Computer Engineering Task States Executing Ready Suspended (or blocked) Dormant (or sleeping)
More informationCommon Approaches to Real-Time Scheduling
Common Approaches to Real-Time Scheduling Clock-driven time-driven schedulers Priority-driven schedulers Examples of priority driven schedulers Effective timing constraints The Earliest-Deadline-First
More informationOperating System Aspects. Real-Time Systems. Resource Management Tasks
Operating System Aspects Chapter 2: Basics Chapter 3: Multimedia Systems Communication Aspects and Services Multimedia Applications and Communication Multimedia Transfer and Control Protocols Quality of
More informationReal-time Scheduling of Periodic Tasks (1) Advanced Operating Systems Lecture 2
Real-time Scheduling of Periodic Tasks (1) Advanced Operating Systems Lecture 2 Lecture Outline Scheduling periodic tasks The rate monotonic algorithm Definition Non-optimality Time-demand analysis...
More informationReal-Time Software. Basic Scheduling and Response-Time Analysis. René Rydhof Hansen. 21. september 2010
Real-Time Software Basic Scheduling and Response-Time Analysis René Rydhof Hansen 21. september 2010 TSW (2010e) (Lecture 05) Real-Time Software 21. september 2010 1 / 28 Last Time Time in a real-time
More informationPredictable response times in eventdriven real-time systems
Predictable response times in eventdriven real-time systems Artist2 Summer School in China 2008 Shanghai, July 2008 Michael González Harbour mgh@unican.es www.ctr.unican.es GRUPO DE COMPUTADORES Y TIEMPO
More informationSporadic Server Revisited
Sporadic Server Revisited Dario Faggioli, Marko Bertogna, Fabio Checconi Scuola Superiore Sant Anna, Pisa, Italy SAC, Sierre March 25th, 2010 Summary System Model Resource Reservation Original Sporadic
More informationModule 6. Embedded System Software. Version 2 EE IIT, Kharagpur 1
Module 6 Embedded System Software Version 2 EE IIT, Kharagpur 1 Lesson 30 Real-Time Task Scheduling Part 2 Version 2 EE IIT, Kharagpur 2 Specific Instructional Objectives At the end of this lesson, the
More informationSoft Real-Time Task Response Time Prediction in Dynamic Embedded Systems
Soft Real-Time Task Response Time Prediction in Dynamic Embedded Systems Cássia Yuri Tatibana, Carlos Montez and Rômulo Silva de Oliveira Universidade Federal de Santa Catarina, Pós-Graduação em Engenharia
More informationScheduling Sporadic Tasks with Shared Resources in Hard-Real-Time Systems
Scheduling Sporadic Tasks with Shared Resources in Hard-Real- Systems Kevin Jeffay * University of North Carolina at Chapel Hill Department of Computer Science Chapel Hill, NC 27599-3175 jeffay@cs.unc.edu
More informationQuality of Service su Linux: Passato Presente e Futuro
Quality of Service su Linux: Passato Presente e Futuro Luca Abeni luca.abeni@unitn.it Università di Trento Quality of Service su Linux:Passato Presente e Futuro p. 1 Quality of Service Time Sensitive applications
More informationIn Proceedings of the First IEEE Workshop on Real-Time Applications, New York, NY, May 1993.
In Proceedings of the First IEEE Workshop on Real-Time Applications, New York, NY, May 1993. Probabilistic Job Scheduling for Distributed Real-time Applications Azer Bestavros Dimitrios Spartiotis Computer
More informationAperiodic Task Scheduling for Real-Time Systems. Brinkley Sprunt
Aperiodic Task Scheduling for Real-Time Systems Ph.D. Dissertation Brinkley Sprunt Department of Electrical and Computer Engineering Carnegie Mellon University August 199 Ph.D. Dissertation Submitted in
More informationA Periodic Events - For the Non- Scheduling Server
6. Aperiodic events 6.1 Concepts and definitions 6.2 Polling servers 6.3 Sporadic servers 6.4 Analyzing aperiodic tasks 6.5 Modelling aperiodic events GRUPO DE COMPUTADORES Y TIEMPO REAL REAL-TIME SYSTEMS
More informationReal-Time Scheduling and Threads: Basics
Real-Time and Threads: Basics Luca Abeni luca.abeni@unitn.it RTS-LiKe 2014 Luca Abeni 1 / 44 Real-Time Applications Real-Time in Setting the The time when a result is produced matters A correct result
More informationPartition Scheduling in APEX Runtime Environment for Embedded Avionics Software
Partition Scheduling in APEX Runtime Environment for Embedded Avionics Software Yang-Hang Lee CISE Department, University of Florida Gainesville, FL 32611 Phone: (352) 392-1536 Fax: (352) 392-1220 Email:
More informationLec. 7: Real-Time Scheduling
Lec. 7: Real-Time Scheduling Part 1: Fixed Priority Assignment Vijay Raghunathan ECE568/CS590/ECE495/CS490 Spring 2011 Reading List: RM Scheduling 2 [Balarin98] F. Balarin, L. Lavagno, P. Murthy, and A.
More informationICS 143 - Principles of Operating Systems
ICS 143 - Principles of Operating Systems Lecture 5 - CPU Scheduling Prof. Nalini Venkatasubramanian nalini@ics.uci.edu Note that some slides are adapted from course text slides 2008 Silberschatz. Some
More informationImplementing a General Real-Time Scheduling Framework in the RED-Linux Real-Time Kernel
Implementing a General Real-Time Scheduling Framework in the RED-Linux Real-Time Kernel Yu-Chung Wang and Kwei-Jay Lin Department of Electrical and Computer Engineering University of California, Irvine
More informationPriority-Driven Scheduling
Priority-Driven Scheduling Advantages of Priority-Driven Scheduling Priority-driven scheduling is easy to implement. It does not require the information on the release times and execution times of the
More informationScheduling of the Distributed Thread Abstraction with Timing Constraints using RTSJ
Scheduling of the Distributed Thread Abstraction with Timing Constraints using RTSJ Patricia Della Méa Plentz, Romulo Silva de Oliveira, Carlos Montez LCMI - Automation and Systems Dept Federal Univers.
More informationSOFTWARE VERIFICATION RESEARCH CENTRE THE UNIVERSITY OF QUEENSLAND. Queensland 4072 Australia TECHNICAL REPORT. No. 02-19. Real-Time Scheduling Theory
SOFTWARE VERIFICATION RESEARCH CENTRE THE UNIVERSITY OF QUEENSLAND Queensland 4072 Australia TECHNICAL REPORT No. 02-19 Real-Time Scheduling Theory C. J. Fidge April 2002 Phone: +61 7 3365 1003 Fax: +61
More informationReal-time scheduling algorithms, task visualization
Rochester Institute of Technology RIT Scholar Works Theses Thesis/Dissertation Collections 2006 Real-time scheduling algorithms, task visualization Kevin Churnetski Follow this and additional works at:
More informationSchedulability analysis of distributed real-time systems
Schedulability analysis of real-time distributed systems Elements of a real-time system Schedulability analysis of distributed real-time systems By: Michael González Harbour mgh@unican.es http://www.ctr.unican.es
More informationIRIS: A new reclaiming algorithm for server-based real-time systems
IRIS: A new reclaiming algorithm for server-based real-time systems Luca Marzario and Giuseppe Lipari Scuola Sup. S.Anna, Pisa, Italy marzario, lipari@sssup.it Patricia Balbastre and Alfons Crespo Universidad
More informationEffective Scheduling Algorithm and Scheduler Implementation for use with Time-Triggered Co-operative Architecture
http://dx.doi.org/10.5755/j01.eee.20.6.7282 ELEKTRONIKA IR ELEKTROTECHNIKA, ISSN 1392 1215, VOL. 20, NO. 6, 2014 Effective Scheduling Algorithm and Scheduler Implementation for use with Time-Triggered
More informationExercises : Real-time Scheduling analysis
Exercises : Real-time Scheduling analysis Frank Singhoff University of Brest June 2013 Exercise 1 : Fixed priority scheduling and Rate Monotonic priority assignment Given a set of tasks defined by the
More informationREAL TIME OPERATING SYSTEMS. Lesson-18:
REAL TIME OPERATING SYSTEMS Lesson-18: Round Robin Time Slicing of tasks of equal priorities 1 1. Common scheduling models 2 Common scheduling models Cooperative Scheduling of ready tasks in a circular
More informationScheduling Real-time Tasks: Algorithms and Complexity
Scheduling Real-time Tasks: Algorithms and Complexity Sanjoy Baruah The University of North Carolina at Chapel Hill Email: baruah@cs.unc.edu Joël Goossens Université Libre de Bruxelles Email: joel.goossens@ulb.ac.be
More informationMulti-core real-time scheduling
Multi-core real-time scheduling Credits: Anne-Marie Déplanche, Irccyn, Nantes (many slides come from her presentation at ETR, Brest, September 2011) 1 Multi-core real-time scheduling! Introduction: problem
More informationAN APPROPRIATE ENGINEERING APPROACH
PREEMPTIVE PRIORITY BASED SCHEDULING: AN APPROPRIATE ENGINEERING APPROACH Alan Burns Real-Time Systems Research Group Department of Computer Science University of York, UK ABSTRACT Scheduling theories
More information2. is the number of processes that are completed per time unit. A) CPU utilization B) Response time C) Turnaround time D) Throughput
Import Settings: Base Settings: Brownstone Default Highest Answer Letter: D Multiple Keywords in Same Paragraph: No Chapter: Chapter 5 Multiple Choice 1. Which of the following is true of cooperative scheduling?
More informationHierarchical Real-Time Scheduling and Synchronization
Mälardalen University Press Licentiate Thesis No.94 Hierarchical Real-Time Scheduling and Synchronization Moris Behnam October 2008 School of Innovation, Design and Engineering Mälardalen University Västerås,
More informationGravitational task model based bandwidth compression algorithm for adaptive resource management
Gravitational task model based bandwidth compression algorithm for adaptive resource management Raphael Guerra 1, Gerhard Fohler 1 1 Chair for Real-Time Systems Technische Universität Kaiserslautern, Germany
More informationN. Audsley. A. Burns Department of Computer Science, University of York, UK. ABSTRACT
REAL-TIME SYSTEM SCHEDULING N Audsley A Burns Department of Computer Science, University of York, UK ABSTRACT Recent results in the application of scheduling theory to dependable real-time systems are
More informationOn-line Scheduling of Real-time Services for Cloud Computing
On-line Scheduling of Real-time Services for Cloud Computing Shuo Liu Gang Quan Electrical and Computer Engineering Department Florida International University Miami, FL, 33174 {sliu5, gang.quan}@fiu.edu
More informationOverview of Presentation. (Greek to English dictionary) Different systems have different goals. What should CPU scheduling optimize?
Overview of Presentation (Greek to English dictionary) introduction to : elements, purpose, goals, metrics lambda request arrival rate (e.g. 200/second) non-preemptive first-come-first-served, shortest-job-next
More informationClassification - Examples
Lecture 2 Scheduling 1 Classification - Examples 1 r j C max given: n jobs with processing times p 1,...,p n and release dates r 1,...,r n jobs have to be scheduled without preemption on one machine taking
More informationKeywords: Dynamic Load Balancing, Process Migration, Load Indices, Threshold Level, Response Time, Process Age.
Volume 3, Issue 10, October 2013 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Load Measurement
More informationCPU SCHEDULING (CONT D) NESTED SCHEDULING FUNCTIONS
CPU SCHEDULING CPU SCHEDULING (CONT D) Aims to assign processes to be executed by the CPU in a way that meets system objectives such as response time, throughput, and processor efficiency Broken down into
More informationPOWER-AWARE ONLINE DYNAMIC SCHEDULING FOR MULTIPLE FEASIBLE INTERVALS *
POWER-AWARE ONLINE DYNAMIC SCHEDULING FOR MULTIPLE FEASIBLE INTERVALS * Bo Liu, Fang Liu, Jian Lin and Albert MK Cheng Department of Computer Science University of Houston Houston, TX, 77204, USA http://www.cs.uh.edu
More informationReal-Time (Paradigms) (51)
Real-Time (Paradigms) (51) 5. Real-Time Communication Data flow (communication) in embedded systems : Sensor --> Controller Controller --> Actor Controller --> Display Controller Controller Major
More informationChapter 19: Real-Time Systems. Overview of Real-Time Systems. Objectives. System Characteristics. Features of Real-Time Systems
Chapter 19: Real-Time Systems System Characteristics Features of Real-Time Systems Chapter 19: Real-Time Systems Implementing Real-Time Operating Systems Real-Time CPU Scheduling VxWorks 5.x 19.2 Silberschatz,
More informationThe Matrix - A framework for real-time resource management for video streaming in networks of heterogenous devices
The Matrix - A framework for real-time resource management for video streaming in networks of heterogenous devices Larisa Rizvanovic Mälardalen University Department of Computer Science and Electronics
More informationScheduling. Yücel Saygın. These slides are based on your text book and on the slides prepared by Andrew S. Tanenbaum
Scheduling Yücel Saygın These slides are based on your text book and on the slides prepared by Andrew S. Tanenbaum 1 Scheduling Introduction to Scheduling (1) Bursts of CPU usage alternate with periods
More informationIntegrating job parallelism in real-time scheduling theory
Integrating job parallelism in real-time scheduling theory Sébastien Collette Liliana Cucu Joël Goossens Abstract We investigate the global scheduling of sporadic, implicit deadline, real-time task systems
More informationImplementing Real-Time services in MINIX
Implementing Real-Time services in MINIX Gabriel A. Wainer Departamento de Computación. Facultad de Ciencias Exactas y Naturales. Universidad de Buenos Aires. Pabellón I. Ciudad Universitaria. Argentina.
More informationDYNAMIC SCHEDULING STRATEGIES FOR AVIONICS MISSION COMPUTING. David L. Levine, Christopher D. Gill, and Douglas C. Schmidt
DYNAMIC SCHEDULING STRATEGIES FOR AVIONICS MISSION COMPUTING David L. Levine, Christopher D. Gill, and Douglas C. Schmidt flevine,cdgill,schmidtg@cs.wustl.edu Department of Computer Science, Washington
More informationScheduling Single Machine Scheduling. Tim Nieberg
Scheduling Single Machine Scheduling Tim Nieberg Single machine models Observation: for non-preemptive problems and regular objectives, a sequence in which the jobs are processed is sufficient to describe
More informationDP-FAIR: A Simple Model for Understanding Optimal Multiprocessor Scheduling
DP-FAIR: A Simple Model for Understanding Optimal Multiprocessor Scheduling Greg Levin, Shelby Funk, Caitlin Sadowski, Ian Pye, Scott Brandt Computer Science Department Department of Computer Science University
More informationHow To Compare Real Time Scheduling To A Scheduled Scheduler On Linux On A Computer System With A Visualization System
MS project proposal: A comparison of real-time scheduling algorithms using visualization of tasks and evaluation of real-time extensions to Linux Kevin Churnetski Computer Science-RIT 8/21/2003 Abstract:
More informationModular Real-Time Linux
Modular Real-Time Linux Shinpei Kato Department of Information and Computer Science, Keio University 3-14-1 Hiyoshi, Kohoku, Yokohama, Japan shinpei@ny.ics.keio.ac.jp Nobuyuki Yamasaki Department of Information
More informationCache-aware compositional analysis of real-time multicore virtualization platforms
DOI 10.1007/s11241-015-9223-2 Cache-aware compositional analysis of real-time multicore virtualization platforms Meng Xu 1 Linh Thi Xuan Phan 1 Oleg Sokolsky 1 Sisu Xi 2 Chenyang Lu 2 Christopher Gill
More informationEfficient Scheduling Of On-line Services in Cloud Computing Based on Task Migration
Efficient Scheduling Of On-line Services in Cloud Computing Based on Task Migration 1 Harish H G, 2 Dr. R Girisha 1 PG Student, 2 Professor, Department of CSE, PESCE Mandya (An Autonomous Institution under
More informationMaster thesis. Title: Real-Time Scheduling methods for High Performance Signal Processing Applications on Multicore platform
Master thesis School of Information Science, Computer and Electrical Engineering Master report, IDE 1260, August 2012 Subject: Master s Thesis in Embedded and Intelligent Systems Title: Real-Time Scheduling
More informationDesigning Fluctronic Real-Time Systems
Journal of Real-Time Systems, Special Issue on Control-Theoretical Approaches to Real-Time Computing Feedback Control Real-Time Scheduling: Framework, Modeling, and Algorithms * Chenyang Lu John A. Stankovic
More informationQuality of Service versus Fairness. Inelastic Applications. QoS Analogy: Surface Mail. How to Provide QoS?
18-345: Introduction to Telecommunication Networks Lectures 20: Quality of Service Peter Steenkiste Spring 2015 www.cs.cmu.edu/~prs/nets-ece Overview What is QoS? Queuing discipline and scheduling Traffic
More informationAn Optimized Load-balancing Scheduling Method Based on the WLC Algorithm for Cloud Data Centers
Journal of Computational Information Systems 9: 7 (23) 689 6829 Available at http://www.jofcis.com An Optimized Load-balancing Scheduling Method Based on the WLC Algorithm for Cloud Data Centers Lianying
More informationCPU Scheduling. Core Definitions
CPU Scheduling General rule keep the CPU busy; an idle CPU is a wasted CPU Major source of CPU idleness: I/O (or waiting for it) Many programs have a characteristic CPU I/O burst cycle alternating phases
More informationPartitioned EDF Scheduling for Multiprocessors using a C=D Scheme
Partitioned EDF Scheduling for Multiprocessors using a C=D Scheme A. Burns, R.I. Davis, P. Wang and F. Zhang Department of Computer Science, University of York, UK. Abstract An EDF-based task-splitting
More informationLinux Plumbers 2010. API for Real-Time Scheduling with Temporal Isolation on Linux
Linux Plumbers 2010 November 3rd, Boston API for Real-Time Scheduling with Temporal Isolation on Linux Tommaso Cucinotta, Cucinotta, Dhaval Giani, Dario Faggioli, Fabio Checconi Real-Time Systems Lab (RETIS)
More informationCommonly Used Approaches to Real-Time Scheduling
Integre Technical Publishing Co., Inc. Liu January 13, 2000 8:46 a.m. chap4 page 60 C H A P T E R 4 Commonly Used Approaches to Real-Time Scheduling This chapter provides a brief overview of three commonly
More informationDynamic Integrated Scheduling of Hard Real-Time, Soft Real-Time and Non-Real-Time Processes
Dynamic Integrated Scheduling of Hard Real-Time, Soft Real-Time and Non-Real-Time Processes Scott A. Brandt Scott Banachowski Caixue Lin Timothy Bisson Computer Science Department University of California,
More informationLoad Balancing and Switch Scheduling
EE384Y Project Final Report Load Balancing and Switch Scheduling Xiangheng Liu Department of Electrical Engineering Stanford University, Stanford CA 94305 Email: liuxh@systems.stanford.edu Abstract Load
More informationJob Scheduling Model
Scheduling 1 Job Scheduling Model problem scenario: a set of jobs needs to be executed using a single server, on which only one job at a time may run for theith job, we have an arrival timea i and a run
More informationRate-Based Resource Allocation Models for Embedded Systems *
Rate-Based Resource Allocation Models for Embedded Systems * Kevin Jeffay Department of Computer Science University of North Carolina at Chapel Hill Chapel Hill, NC 27599-3175 USA jeffay@cs.unc.edu Steve
More informationOnline Supplement for Maximizing throughput in zero-buffer tandem lines with dedicated and flexible servers by Mohammad H. Yarmand and Douglas G.
Online Supplement for Maximizing throughput in zero-buffer tandem lines with dedicated and flexible servers by Mohammad H Yarmand and Douglas G Down Appendix A Lemma 1 - the remaining cases In this appendix,
More informationCPU Scheduling. CPU Scheduling
CPU Scheduling Electrical and Computer Engineering Stephen Kim (dskim@iupui.edu) ECE/IUPUI RTOS & APPS 1 CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling
More informationA Survey of Real-Time Scheduling Tools TIK-Report No. 72 November 1998 Martin Naedele Abstract Based on the corresponding publications, a survey of tools for the evaluation of the timing behavior of real-time
More informationSchedulability Analysis and Utilization Bounds for Highly Scalable Real-Time Services
Schedulability Analysis and Utilization Bounds for Highly Scalable Real-Time Services Tarek F. Abdelzaher, Chenyang Lu Department of Computer Science, University of Virginia Charlottesville, VA 93 e-mail:fzaher,chenyangg@cs.virginia.edu
More informationHard Real-Time Reconfiguration Port Scheduling
Hard Real-Time Reconfiguration Port Scheduling Florian Dittmann and Stefan Frank Heinz Nixdorf Institute, University of Paderborn Fuerstenallee, 330 Paderborn, Germany {roichen, sfrank}@upb.de Abstract
More informationSolving Real-World Real-Time Scheduling Problems With RT_PREEMPT and Deadline-Based Scheduler Xi Wang Broadcom Corporation Questions, Comments: xiwang@broadcom.com peknap@yahoo.com Introduction Higher
More informationReal Time Network Server Monitoring using Smartphone with Dynamic Load Balancing
www.ijcsi.org 227 Real Time Network Server Monitoring using Smartphone with Dynamic Load Balancing Dhuha Basheer Abdullah 1, Zeena Abdulgafar Thanoon 2, 1 Computer Science Department, Mosul University,
More informationENERGY SAVING SCHEDULING FOR EMBEDDED REAL-TIME LINUX APPLICATIONS
ENERGY SAVING SCHEDULING FOR EMBEDDED REAL-TIME LINUX APPLICATIONS Claudio Scordino and Giuseppe Lipari Scuola Superiore Sant Anna Viale Rinaldo Piaggio, 34-56025 Pontedera - Pisa, Italy {scordino@gandalf.sssup.it,lipari@sssup.it}
More informationAdvanced Operating Systems (M) Dr Colin Perkins School of Computing Science University of Glasgow
Advanced Operating Systems (M) Dr Colin Perkins School of Computing Science University of Glasgow Rationale Radical changes to computing landscape; Desktop PC becoming irrelevant Heterogeneous, multicore,
More informationBatch Scheduling of Deteriorating Products
Decision Making in Manufacturing and Services Vol. 1 2007 No. 1 2 pp. 25 34 Batch Scheduling of Deteriorating Products Maksim S. Barketau, T.C. Edwin Cheng, Mikhail Y. Kovalyov, C.T. Daniel Ng Abstract.
More informationADAPTIVE LOAD BALANCING ALGORITHM USING MODIFIED RESOURCE ALLOCATION STRATEGIES ON INFRASTRUCTURE AS A SERVICE CLOUD SYSTEMS
ADAPTIVE LOAD BALANCING ALGORITHM USING MODIFIED RESOURCE ALLOCATION STRATEGIES ON INFRASTRUCTURE AS A SERVICE CLOUD SYSTEMS Lavanya M., Sahana V., Swathi Rekha K. and Vaithiyanathan V. School of Computing,
More informationOn-line scheduling algorithm for real-time multiprocessor systems with ACO
International Journal of Intelligent Information Systems 2015; 4(2-1): 13-17 Published online January 28, 2015 (http://www.sciencepublishinggroup.com/j/ijiis) doi: 10.11648/j.ijiis.s.2015040201.13 ISSN:
More information