Paper Presentation. Amo Guangmo Tong. University of Taxes at Dallas January 24, 2014
|
|
- Mervyn Moody
- 5 years ago
- Views:
Transcription
1 Paper Presentation Amo Guangmo Tong University of Taxes at Dallas January 24, 2014 Amo Guangmo Tong (UTD) January 24, / 30
2 Overview 1 Tardiness Bounds under Global EDF Scheduling on a Multiprocessor 2 An O(m) Analysis Technique for Supporting Real-Time Self-Suspending Task Systems Amo Guangmo Tong (UTD) January 24, / 30
3 Tardiness Bounds under Global EDF Scheduling on a Multiprocessor Tardiness Bounds under Global EDF Scheduling on a Multiprocessor UmaMaheswari C. Devi and James H. Anderson Amo Guangmo Tong (UTD) January 24, / 30
4 Tardiness Bounds under Global EDF Scheduling on a Multiprocessor Abstact The major topic in this paper is the scheduling of soft real-time sporadic task systems on a multiprocessor. This paper derives the tardiness bound under preemptive or non-preemptive global earliest-deadline-first (EDF) schedule when the total utilization is less than or even equal to the number of processors. Amo Guangmo Tong (UTD) January 24, / 30
5 System Model Soft real-time system T n sporadic tasks T n m identical processors,m > 1 minimum inter-arrival time or period, p i > 0 execution cost e i < p i relative deadline D i = p i utilization u i = e i /p i U sum = u i m U max (k) denotes the subset of k tasks with highest utilizations in T E max (k) denotes the subset of k tasks with highest executions in T Amo Guangmo Tong (UTD) January 24, / 30
6 Schedule Algorithms Processor Sharing(PS) schedule In a PS schedule, each job of T i is allocated a fraction u i of a processor at each instant. Every job will complete executing exactly at its deadline. As long as U sum = u i m, a valid PS schedule exists. Earliest-Deadline-First(EDF) schedule In a EDF schedule, the job with earlier deadline has higher priority. Non-preemptive Earliest-Deadline-First(NP-EDF) schedule In a NP-EDF schedule, the job with earlier deadline has higher priority and a job cannot be paused until its completion. Amo Guangmo Tong (UTD) January 24, / 30
7 LAG(T, t) For any given soft real-time system T A(PS, T i, t) denotes the allocation of resource to task T i within the interval [0, t] under PS schedule; A(EDF, T i, t) denotes the allocation of resource to task T i within interval [0, t] under EDF schedule. lag(t i, t) = A(PS, T i, t) A(EDF, T i, t) LAG(T, t) = i n lag(t i, t) Amo Guangmo Tong (UTD) January 24, / 30
8 How to derive the tardiness bound of job T i,j Step 1 Let t d = d i,j denotes the deadline of T i,j. Notice that jobs with lower priority have no influence on the schedule of jobs with higher priority. We ignore the jobs with priority lower than T i,j. In this case, LAG(T, t d ) represents the workload remaining to be done after t d in order to finish all the execution. Intuitively, the tardiness bound of T i,j is directly related to LAG(T, t d ) Amo Guangmo Tong (UTD) January 24, / 30
9 How to derive the tardiness bound of job T i,j Step 2 Lemma 1 Let the tardiness of T k with a deadline less than t d be at most x + e k, where x 0, for all 1 i n under the EDF schedule for system T on m processors. If LAG(T, t d ) mx + e i. Then, the tardiness of T i,j is at most x + e i. We denote mx + e i as Lower Bound. Amo Guangmo Tong (UTD) January 24, / 30
10 How to derive the tardiness bound of job T i,j Step 3 Lemma 2 Let the tardiness of T k with a deadline less than t d be at most x + e k, where x 0, for all 1 i n under the EDF schedule for system T on m processors. And U sum m. Then LAG(T, t d ) x T i U max (m 1) u i + T i E max (m 1) e i We denote x T i U max (m 1) u i + T i E max (m 1) e i as Upper Bound. Amo Guangmo Tong (UTD) January 24, / 30
11 How to derive the tardiness bound of job T i,j Step 4 Let the UpperBound not more than LowerBound (x T i U max (m 1) u i + T i E max (m 1) e i) (mx + e i ) Solve this inequation. Then, x [ ( T i E max (m 1) e i) e min m T i U max (m 1) u ], i in which case the condition in Lemma 1 can be satisfied. According to the Lemma 1, the tardiness of job T i,j in task T i is at most [ ( T i E max (m 1) e i) e min m T i U max (m 1) u ] + e i. By induction, the tardiness i bound of all of the jobs in task T i is [ ( T i E max (m 1) e i) e min m T i U max (m 1) u ] + e i. i Amo Guangmo Tong (UTD) January 24, / 30
12 Conclusion The tardiness bounds under global EDF for task T i in a sporadic real-time systems on multiprocessors is [ ( T i E max (m 1) e i) e min m T i U max (m 1) u ] + e i, when the total utilization of a task i system is not more than the number of processors, m, which means the resource can be fully utilized in the long run. The tardiness bound under non-preemptive global EDF can be derived by the similar framework with slight difference in the prove of UpperBound. Amo Guangmo Tong (UTD) January 24, / 30
13 Strength Multiprocessor Multiprocessor-based design has been used widely in the present-day applications. For example, virtual-reality systems, systems that track people and machines, and signal-processing systems such as synthetic-aperture. In this case, the previous theories on uniprocessor are insufficient. Soft real-time system Then, not all real-time systems require that the deadline of job has to be met. In other words, such as in multimedia and gaming systems, we can tolerant tardiness as long as it is bounded with limitation. Non-preemptive Finally, this paper derives a tardiness bound under non-preemptive global EDF, which provides a theory foundation for the case in practice that tasks cannot be paused before completion. Amo Guangmo Tong (UTD) January 24, / 30
14 An O(m) Analysis Technique for Supporting Real-Time Self-Suspending Task Systems An O(m) Analysis Technique for Supporting Real-Time Self-Suspending Task Systems Liu Cong and James H. Anderson Amo Guangmo Tong (UTD) January 24, / 30
15 An O(m) Analysis Technique for Supporting Real-Time Self-Suspending Task Systems Abstact This paper considers soft real-time self-suspending task systems under the preemptive global EDF and derives a new schedulability test with O(m) suspension-related utilization loss. Similar to the first paper, this paper also analyze the tardiness bound by using the allocation difference between PS schedule and EDF schedule Amo Guangmo Tong (UTD) January 24, / 30
16 System Model Soft real-time Self-Suspending system T Self-suspending: jobs alternate between computation and suspension phase n sporadic tasks T n m identical processors,m > 1 minimum inter-arrival time or period, p i > 0 execution cost e i ; suspension costs i ; e i + s i < p i relative deadline D i = p i utilization u i = e i /p i ; suspension ratio v i = s i /p i ; u = u i + v i U sum = u i m Amo Guangmo Tong (UTD) January 24, / 30
17 Schedule Algorithms Processor Sharing(PS) schedule In a PS schedule, each job of T i is allocated a fraction u i of a processor at each instant. Every job will complete executing exactly at its deadline. As long as U sum = u i m, a valid PS schedule exists. Earliest-Deadline-First(EDF) schedule In a EDF schedule, the job with earlier deadline has higher priority. Amo Guangmo Tong (UTD) January 24, / 30
18 How to deal with suspension In the first paper, the critical point is if t is non-busy time instant there are at most m-1, tasks have tardy jobs at t. Otherwise, t cannot be non-busy. However, when it comes to self-suspending system, there could be at most n tasks have tardy jobs at a non-busy instant t. Amo Guangmo Tong (UTD) January 24, / 30
19 How to deal with suspension Convert all the suspension into execution? Then, e i = e i + s i. To guarantee a valid PS schedule, we need U sum = U sum + i n s i p i m It works but pessimistic, because resource will be wasted severely Amo Guangmo Tong (UTD) January 24, / 30
20 How to deal with suspension If,by converting at most m tasks suspensions into execution at any instant t in PS, we can guarantee that any non-busy instant t in EDF there are at most m 1 tasks have tardy jobs. In this case, to guarantee a valid PS schedule, we need U sum + V max(m) v i m It works better but how to convert the suspension into execution? Amo Guangmo Tong (UTD) January 24, / 30
21 Transformation Consider processor M k. Let t f be the finish time of the system. From t f to the left, let t h denote the first encountered non-busy time instant on M k where at least one task T i has an tardy job T i,v suspending at t h. Let v c denote the minimum job index of T i such that all job from T i,v c to T i,v are tardy. Then [A 1 k, B1 k ] = [r i,v c, t h + 1]. In this way, from r i,v c we can get [A 2 k, B2 k ]. Until time 0, we will get [Aq k, Bq k ] transformation intervals respect to M k. Note that each job in a transformation interval has its release time and deadline time within the interval. Move Switch Convert Do the same things to all processors. Amo Guangmo Tong (UTD) January 24, / 30
22 Transformation Check At any non-busy time instant t [0, t f ] in the transformed schedule, at most m 1 tasks can have enabled tardy jobs with deadlines at or before t. A valid PS schedule exists when U sum + V max(m) v i m. We denote the new schedule as PS and EDF Amo Guangmo Tong (UTD) January 24, / 30
23 LAG(T, t) For any given soft real-time system T A(PS, T i, t) denotes the allocation of resource to task T i within the interval [0, t] under PS schedule; A(EDF, T i, t) denotes the allocation of resource to task T i within interval [0, t] under EDF schedule. lag(t i, t) = A(PS, T i, t) A(EDF, T i, t) LAG(T, t) = i n lag(t i, t) Amo Guangmo Tong (UTD) January 24, / 30
24 How to derive the tardiness bound of job T i,j Step 1 Let t d = d i,j denotes the deadline of T i,j. Notice that jobs with lower priority have no influence on the schedule of jobs with higher priority. We ignore the jobs with priority lower than T i,j. In this case, LAG(T, t d ) represents the workload remaining to be done after t d in order to finish all the execution. Intuitively, the tardiness bound of T i,j is directly related to LAG(T, t d ) Amo Guangmo Tong (UTD) January 24, / 30
25 How to derive the tardiness bound of job T i,j Step 2 Lemma 1 Let the tardiness of T k with a deadline less than t d be at most x + e k + s k, where x 0, for all 1 i n under the EDF schedule for system T on m processors. If LAG(T, t d ) mx. Then, the tardiness of T i,j is at most x + e i + s i. We denote mx as Lower Bound. Amo Guangmo Tong (UTD) January 24, / 30
26 How to derive the tardiness bound of job T i,j Step 3 Lemma 2 Let the tardiness of T k with a deadline less than t d be at most x + e k + s k, where x 0, for all 1 i n under the EDF schedule for system T on m processors. And U sum m. Let E denotes the largest value of the expression τ i τ (e i + s i ) + τ i ψ u e i, where ψ denotes any set of m 1 tasks. Let U m 1 be the sum of the m 1 largest u i Then LAG(T, t d ) x U m 1 + E We denote x U m 1 + E as Upper Bound. Amo Guangmo Tong (UTD) January 24, / 30
27 How to derive the tardiness bound of job T i,j Step 4 Let the UpperBound not more than LowerBound x U m 1 + E (mx + e i + s i ). Solve this inequation. Then, x [ E e i s i m U m 1 ], in which case, the condition in Lemma 1 can be satisfied. Amo Guangmo Tong (UTD) January 24, / 30
28 Conclusion The tardiness bounds under global EDF for task T i in a sporadic real-time systems on multiprocessors is [ E e i s i m U m 1 ] + e i, when the total utilization of a task system is not more than the number of processors, m, which means the resource can be fully utilized in the long run. The tardiness bound under non-preemptive global EDF can be derived by the similar framework with slight difference in the prove of UpperBound. Amo Guangmo Tong (UTD) January 24, / 30
29 Strength Suspension As the paper says, suspension delays may occur in many systems due to the cases such as the interaction with external devices and resource sharing. Then this paper derives an tardiness bound with O(m) utilization loss. This result is much better than the previous result in that when the number of tasks is very large then the O(n) utilization loss can be highly significant. Amo Guangmo Tong (UTD) January 24, / 30
30 The End Amo Guangmo Tong (UTD) January 24, / 30
Paper Presentation. Amo Guangmo Tong. University of Taxes at Dallas February 11, 2014
Paper Presentation Amo Guangmo Tong University of Taxes at Dallas gxt140030@utdallas.edu February 11, 2014 Amo Guangmo Tong (UTD) February 11, 2014 1 / 26 Overview 1 Techniques for Multiprocessor Global
More informationTardiness Bounds under Global EDF Scheduling on a Multiprocessor
Tardiness ounds under Global EDF Scheduling on a Multiprocessor UmaMaheswari C. Devi and James H. Anderson Department of Computer Science The University of North Carolina at Chapel Hill Abstract This paper
More informationAn O(m) Analysis Technique for Supporting Real-Time Self-Suspending Task Systems
An O(m) Analysis Technique for Supporting Real-Time Self-Suspending Task Systems Cong Liu and James H. Anderson Department of Computer Science, University of North Carolina at Chapel Hill Abstract In many
More informationOn the Soft Real-Time Optimality of Global EDF on Multiprocessors: From Identical to Uniform Heterogeneous
On the Soft Real-Time Optimality of Global EDF on Multiprocessors: From Identical to Uniform Heterogeneous Kecheng Yang and James H. Anderson Department of Computer Science, University of North Carolina
More informationTardiness Bounds under Global EDF Scheduling on a. Multiprocessor
Tardiness Bounds under Global EDF Scheduling on a Multiprocessor UmaMaheswari C. Devi and James H. Anderson Department of Computer Science The University of North Carolina at Chapel Hill Abstract We consider
More informationLecture 13. Real-Time Scheduling. Daniel Kästner AbsInt GmbH 2013
Lecture 3 Real-Time Scheduling Daniel Kästner AbsInt GmbH 203 Model-based Software Development 2 SCADE Suite Application Model in SCADE (data flow + SSM) System Model (tasks, interrupts, buses, ) SymTA/S
More informationScheduling Stochastically-Executing Soft Real-Time Tasks: A Multiprocessor Approach Without Worst-Case Execution Times
Scheduling Stochastically-Executing Soft Real-Time Tasks: A Multiprocessor Approach Without Worst-Case Execution Times Alex F. Mills Department of Statistics and Operations Research University of North
More informationSupporting Read/Write Applications in Embedded Real-time Systems via Suspension-aware Analysis
Supporting Read/Write Applications in Embedded Real-time Systems via Suspension-aware Analysis Guangmo Tong and Cong Liu Department of Computer Science University of Texas at Dallas ABSTRACT In many embedded
More informationTardiness Bounds for FIFO Scheduling on Multiprocessors
Tardiness Bounds for FIFO Scheduling on Multiprocessors Hennadiy Leontyev and James H. Anderson Department of Computer Science, University of North Carolina at Chapel Hill leontyev@cs.unc.edu, anderson@cs.unc.edu
More informationTask Models and Scheduling
Task Models and Scheduling Jan Reineke Saarland University June 27 th, 2013 With thanks to Jian-Jia Chen at KIT! Jan Reineke Task Models and Scheduling June 27 th, 2013 1 / 36 Task Models and Scheduling
More informationEmbedded Systems Development
Embedded Systems Development Lecture 3 Real-Time Scheduling Dr. Daniel Kästner AbsInt Angewandte Informatik GmbH kaestner@absint.com Model-based Software Development Generator Lustre programs Esterel programs
More informationEmbedded Systems 15. REVIEW: Aperiodic scheduling. C i J i 0 a i s i f i d i
Embedded Systems 15-1 - REVIEW: Aperiodic scheduling C i J i 0 a i s i f i d i Given: A set of non-periodic tasks {J 1,, J n } with arrival times a i, deadlines d i, computation times C i precedence constraints
More informationAndrew Morton University of Waterloo Canada
EDF Feasibility and Hardware Accelerators Andrew Morton University of Waterloo Canada Outline 1) Introduction and motivation 2) Review of EDF and feasibility analysis 3) Hardware accelerators and scheduling
More informationNon-Preemptive and Limited Preemptive Scheduling. LS 12, TU Dortmund
Non-Preemptive and Limited Preemptive Scheduling LS 12, TU Dortmund 09 May 2017 (LS 12, TU Dortmund) 1 / 31 Outline Non-Preemptive Scheduling A General View Exact Schedulability Test Pessimistic Schedulability
More informationSchedulability analysis of global Deadline-Monotonic scheduling
Schedulability analysis of global Deadline-Monotonic scheduling Sanjoy Baruah Abstract The multiprocessor Deadline-Monotonic (DM) scheduling of sporadic task systems is studied. A new sufficient schedulability
More informationAperiodic Task Scheduling
Aperiodic Task Scheduling Jian-Jia Chen (slides are based on Peter Marwedel) TU Dortmund, Informatik 12 Germany Springer, 2010 2017 年 11 月 29 日 These slides use Microsoft clip arts. Microsoft copyright
More informationClosing the Loop for the Selective Conversion Approach: A Utilization-based Test for Hard Real-Time Suspending Task Systems
216 IEEE Real-Time Systems Symposium Closing the Loop for the Selective Conversion Approach: A Utilization-based Test for Hard Real-Time Suspending Task Systems Zheng Dong and Cong Liu Department of Computer
More informationA Note on Modeling Self-Suspending Time as Blocking Time in Real-Time Systems
A Note on Modeling Self-Suspending Time as Blocking Time in Real-Time Systems Jian-Jia Chen 1, Wen-Hung Huang 1, and Geoffrey Nelissen 2 1 TU Dortmund University, Germany Email: jian-jia.chen@tu-dortmund.de,
More informationScheduling Lecture 1: Scheduling on One Machine
Scheduling Lecture 1: Scheduling on One Machine Loris Marchal 1 Generalities 1.1 Definition of scheduling allocation of limited resources to activities over time activities: tasks in computer environment,
More informationOn the Soft Real-Time Optimality of Global EDF on Uniform Multiprocessors
On the Soft Real-Time Optimality of Global EDF on Uniform Multiprocessors Kecheng Yang and James H Anderson Department of Computer Science, University of North Carolina at Chapel Hill Abstract It has long
More informationTardiness Bounds for EDF Scheduling on Multi-Speed Multicore Platforms
Tardiness Bounds for EDF Scheduling on Multi-Speed Multicore Platforms Hennadiy Leontyev and James H. Anderson Department of Computer Science, University of North Carolina at Chapel Hill Abstract Multicore
More informationScheduling Lecture 1: Scheduling on One Machine
Scheduling Lecture 1: Scheduling on One Machine Loris Marchal October 16, 2012 1 Generalities 1.1 Definition of scheduling allocation of limited resources to activities over time activities: tasks in computer
More informationThe Concurrent Consideration of Uncertainty in WCETs and Processor Speeds in Mixed Criticality Systems
The Concurrent Consideration of Uncertainty in WCETs and Processor Speeds in Mixed Criticality Systems Zhishan Guo and Sanjoy Baruah Department of Computer Science University of North Carolina at Chapel
More informationCPU SCHEDULING RONG ZHENG
CPU SCHEDULING RONG ZHENG OVERVIEW Why scheduling? Non-preemptive vs Preemptive policies FCFS, SJF, Round robin, multilevel queues with feedback, guaranteed scheduling 2 SHORT-TERM, MID-TERM, LONG- TERM
More informationThe Partitioned Dynamic-priority Scheduling of Sporadic Task Systems
The Partitioned Dynamic-priority Scheduling of Sporadic Task Systems Abstract A polynomial-time algorithm is presented for partitioning a collection of sporadic tasks among the processors of an identical
More informationRate-monotonic scheduling on uniform multiprocessors
Rate-monotonic scheduling on uniform multiprocessors Sanjoy K. 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 informationReal-Time and Embedded Systems (M) Lecture 5
Priority-driven Scheduling of Periodic Tasks (1) Real-Time and Embedded Systems (M) Lecture 5 Lecture Outline Assumptions Fixed-priority algorithms Rate monotonic Deadline monotonic Dynamic-priority algorithms
More informationReal-time scheduling of sporadic task systems when the number of distinct task types is small
Real-time scheduling of sporadic task systems when the number of distinct task types is small Sanjoy Baruah Nathan Fisher Abstract In some real-time application systems, there are only a few distinct kinds
More informationReal-time operating systems course. 6 Definitions Non real-time scheduling algorithms Real-time scheduling algorithm
Real-time operating systems course 6 Definitions Non real-time scheduling algorithms Real-time scheduling algorithm Definitions Scheduling Scheduling is the activity of selecting which process/thread should
More informationBursty-Interference Analysis Techniques for. Analyzing Complex Real-Time Task Models
Bursty-Interference Analysis Techniques for lemma 3 Analyzing Complex Real- Task Models Cong Liu Department of Computer Science The University of Texas at Dallas Abstract Due to the recent trend towards
More informationSystem Model. Real-Time systems. Giuseppe Lipari. Scuola Superiore Sant Anna Pisa -Italy
Real-Time systems System Model Giuseppe Lipari Scuola Superiore Sant Anna Pisa -Italy Corso di Sistemi in tempo reale Laurea Specialistica in Ingegneria dell Informazione Università di Pisa p. 1/?? Task
More informationReal-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 informationAn Optimal k-exclusion Real-Time Locking Protocol Motivated by Multi-GPU Systems
An Optimal k-exclusion Real-Time Locking Protocol Motivated by Multi-GPU Systems Glenn A. Elliott and James H. Anderson Department of Computer Science, University of North Carolina at Chapel Hill Abstract
More informationOptimal Utilization Bounds for the Fixed-priority Scheduling of Periodic Task Systems on Identical Multiprocessors. Sanjoy K.
Optimal Utilization Bounds for the Fixed-priority Scheduling of Periodic Task Systems on Identical Multiprocessors Sanjoy K. Baruah Abstract In fixed-priority scheduling the priority of a job, once assigned,
More informationNon-preemptive Fixed Priority Scheduling of Hard Real-Time Periodic Tasks
Non-preemptive Fixed Priority Scheduling of Hard Real-Time Periodic Tasks Moonju Park Ubiquitous Computing Lab., IBM Korea, Seoul, Korea mjupark@kr.ibm.com Abstract. This paper addresses the problem of
More informationMultiprocessor Scheduling II: Global Scheduling. LS 12, TU Dortmund
Multiprocessor Scheduling II: Global Scheduling Prof. Dr. Jian-Jia Chen LS 12, TU Dortmund 28, June, 2016 Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 1 / 42 Global Scheduling We will only focus on identical
More informationarxiv: v3 [cs.ds] 23 Sep 2016
Evaluate and Compare Two Utilization-Based Schedulability-Test Framewors for Real-Time Systems arxiv:1505.02155v3 [cs.ds] 23 Sep 2016 Jian-Jia Chen and Wen-Hung Huang Department of Informatics TU Dortmund
More informationNetworked Embedded Systems WS 2016/17
Networked Embedded Systems WS 2016/17 Lecture 2: Real-time Scheduling Marco Zimmerling Goal of Today s Lecture Introduction to scheduling of compute tasks on a single processor Tasks need to finish before
More informationEmbedded Systems 14. Overview of embedded systems design
Embedded Systems 14-1 - Overview of embedded systems design - 2-1 Point of departure: Scheduling general IT systems In general IT systems, not much is known about the computational processes a priori The
More informationSuspension-Aware Analysis for Hard Real-Time Multiprocessor Scheduling
Suspension-Aware Analysis for Hard Real-Time Multiprocessor Scheduling Cong Liu and James H. Anderson Department of Computer Science, University of North Carolina at Chapel Hill Abstract In many real-time
More informationEDF Scheduling. Giuseppe Lipari May 11, Scuola Superiore Sant Anna Pisa
EDF Scheduling Giuseppe Lipari http://feanor.sssup.it/~lipari Scuola Superiore Sant Anna Pisa May 11, 2008 Outline 1 Dynamic priority 2 Basic analysis 3 FP vs EDF 4 Processor demand bound analysis Generalization
More information2.1 Task and Scheduling Model. 2.2 Definitions and Schedulability Guarantees
Fixed-Priority Scheduling of Mixed Soft and Hard Real-Time Tasks on Multiprocessors Jian-Jia Chen, Wen-Hung Huang Zheng Dong, Cong Liu TU Dortmund University, Germany The University of Texas at Dallas,
More informationAn Optimal Real-Time Scheduling Algorithm for Multiprocessors
An Optimal Real-Time Scheduling Algorithm for Multiprocessors Hyeonjoong Cho, Binoy Ravindran, and E. Douglas Jensen ECE Dept., Virginia Tech Blacksburg, VA 24061, USA {hjcho,binoy}@vt.edu The MITRE Corporation
More informationCIS 4930/6930: Principles of Cyber-Physical Systems
CIS 4930/6930: Principles of Cyber-Physical Systems Chapter 11 Scheduling Hao Zheng Department of Computer Science and Engineering University of South Florida H. Zheng (CSE USF) CIS 4930/6930: Principles
More informationModule 5: CPU Scheduling
Module 5: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Algorithm Evaluation 5.1 Basic Concepts Maximum CPU utilization obtained
More informationChapter 6: CPU Scheduling
Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Algorithm Evaluation 6.1 Basic Concepts Maximum CPU utilization obtained
More informationA New Sufficient Feasibility Test for Asynchronous Real-Time Periodic Task Sets
A New Sufficient Feasibility Test for Asynchronous Real-Time Periodic Task Sets Abstract The problem of feasibility analysis for asynchronous periodic task sets (ie where tasks can have an initial offset
More informationThe FMLP + : An Asymptotically Optimal Real-Time Locking Protocol for Suspension-Aware Analysis
The FMLP + : An Asymptotically Optimal Real-Time Locking Protocol for Suspension-Aware Analysis Björn B. Brandenburg Max Planck Institute for Software Systems (MPI-SWS) Abstract Multiprocessor real-time
More informationAS computer hardware technology advances, both
1 Best-Harmonically-Fit Periodic Task Assignment Algorithm on Multiple Periodic Resources Chunhui Guo, Student Member, IEEE, Xiayu Hua, Student Member, IEEE, Hao Wu, Student Member, IEEE, Douglas Lautner,
More informationEDF Scheduling. Giuseppe Lipari CRIStAL - Université de Lille 1. October 4, 2015
EDF Scheduling Giuseppe Lipari http://www.lifl.fr/~lipari CRIStAL - Université de Lille 1 October 4, 2015 G. Lipari (CRIStAL) Earliest Deadline Scheduling October 4, 2015 1 / 61 Earliest Deadline First
More informationMultiprocessor Real-Time Scheduling Considering Concurrency and Urgency
Multiprocessor Real-Time Scheduling Considering Concurrency Urgency Jinkyu Lee, Arvind Easwaran, Insik Shin Insup Lee Dept. of Computer Science, KAIST, South Korea IPP-HURRAY! Research Group, Polytechnic
More informationStatic priority scheduling
Static priority scheduling Michal Sojka Czech Technical University in Prague, Faculty of Electrical Engineering, Department of Control Engineering November 8, 2017 Some slides are derived from lectures
More informationNon-Work-Conserving Non-Preemptive Scheduling: Motivations, Challenges, and Potential Solutions
Non-Work-Conserving Non-Preemptive Scheduling: Motivations, Challenges, and Potential Solutions Mitra Nasri Chair of Real-time Systems, Technische Universität Kaiserslautern, Germany nasri@eit.uni-kl.de
More informationScheduling Algorithms for Multiprogramming in a Hard Realtime Environment
Scheduling Algorithms for Multiprogramming in a Hard Realtime Environment C. Liu and J. Layland Journal of the ACM, 20(1):46--61, January 1973. 2 Contents 1. Introduction and Background 2. The Environment
More informationSegment-Fixed Priority Scheduling for Self-Suspending Real-Time Tasks
Segment-Fixed Priority Scheduling for Self-Suspending Real-Time Tasks Junsung Kim, Björn Andersson, Dionisio de Niz, and Raj Rajkumar Carnegie Mellon University 2/31 Motion Planning on Self-driving Parallel
More informationUniprocessor Mixed-Criticality Scheduling with Graceful Degradation by Completion Rate
Uniprocessor Mixed-Criticality Scheduling with Graceful Degradation by Completion Rate Zhishan Guo 1, Kecheng Yang 2, Sudharsan Vaidhun 1, Samsil Arefin 3, Sajal K. Das 3, Haoyi Xiong 4 1 Department of
More informationTask Reweighting under Global Scheduling on Multiprocessors
ask Reweighting under Global Scheduling on Multiprocessors Aaron Block, James H. Anderson, and UmaMaheswari C. Devi Department of Computer Science, University of North Carolina at Chapel Hill March 7 Abstract
More informationA 2-Approximation Algorithm for Scheduling Parallel and Time-Sensitive Applications to Maximize Total Accrued Utility Value
A -Approximation Algorithm for Scheduling Parallel and Time-Sensitive Applications to Maximize Total Accrued Utility Value Shuhui Li, Miao Song, Peng-Jun Wan, Shangping Ren Department of Engineering Mechanics,
More informationMultiprocessor Scheduling I: Partitioned Scheduling. LS 12, TU Dortmund
Multiprocessor Scheduling I: Partitioned Scheduling Prof. Dr. Jian-Jia Chen LS 12, TU Dortmund 22/23, June, 2015 Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 1 / 47 Outline Introduction to Multiprocessor
More informationThe preemptive uniprocessor scheduling of mixed-criticality implicit-deadline sporadic task systems
The preemptive uniprocessor scheduling of mixed-criticality implicit-deadline sporadic task systems Sanjoy Baruah 1 Vincenzo Bonifaci 2 3 Haohan Li 1 Alberto Marchetti-Spaccamela 4 Suzanne Van Der Ster
More informationTDDI04, K. Arvidsson, IDA, Linköpings universitet CPU Scheduling. Overview: CPU Scheduling. [SGG7] Chapter 5. Basic Concepts.
TDDI4 Concurrent Programming, Operating Systems, and Real-time Operating Systems CPU Scheduling Overview: CPU Scheduling CPU bursts and I/O bursts Scheduling Criteria Scheduling Algorithms Multiprocessor
More informationLoad Regulating Algorithm for Static-Priority Task Scheduling on Multiprocessors
Technical Report No. 2009-7 Load Regulating Algorithm for Static-Priority Task Scheduling on Multiprocessors RISAT MAHMUD PATHAN JAN JONSSON Department of Computer Science and Engineering CHALMERS UNIVERSITY
More informationClock-driven scheduling
Clock-driven scheduling Also known as static or off-line scheduling Michal Sojka Czech Technical University in Prague, Faculty of Electrical Engineering, Department of Control Engineering November 8, 2017
More informationAnalysis Techniques for Supporting Harmonic Real-Time Tasks with Suspensions
Analysis Techniques for Supporting Harmonic Real-Time Tass with Suspensions Cong Liu, Jian-Jia Chen, Liang He, Yu Gu The University of Texas at Dallas, USA Karlsruhe Institute of Technology (KIT), Germany
More informationRUN-TIME EFFICIENT FEASIBILITY ANALYSIS OF UNI-PROCESSOR SYSTEMS WITH STATIC PRIORITIES
RUN-TIME EFFICIENT FEASIBILITY ANALYSIS OF UNI-PROCESSOR SYSTEMS WITH STATIC PRIORITIES Department for Embedded Systems/Real-Time Systems, University of Ulm {name.surname}@informatik.uni-ulm.de Abstract:
More informationarxiv: v1 [cs.os] 6 Jun 2013
Partitioned scheduling of multimode multiprocessor real-time systems with temporal isolation Joël Goossens Pascal Richard arxiv:1306.1316v1 [cs.os] 6 Jun 2013 Abstract We consider the partitioned scheduling
More informationEFFICIENT DESIGN, ANALYSIS, AND IMPLEMENTATION OF COMPLEX MULTIPROCESSOR REAL-TIME SYSTEMS
EFFICIENT DESIGN, ANALYSIS, AND IMPLEMENTATION OF COMPLEX MULTIPROCESSOR REAL-TIME SYSTEMS Cong Liu A dissertation submitted to the faculty of the University of North Carolina at Chapel Hill in partial
More informationA New Task Model and Utilization Bound for Uniform Multiprocessors
A New Task Model and Utilization Bound for Uniform Multiprocessors Shelby Funk Department of Computer Science, The University of Georgia Email: shelby@cs.uga.edu Abstract This paper introduces a new model
More informationPredictability of Least Laxity First Scheduling Algorithm on Multiprocessor Real-Time Systems
Predictability of Least Laxity First Scheduling Algorithm on Multiprocessor Real-Time Systems Sangchul Han and Minkyu Park School of Computer Science and Engineering, Seoul National University, Seoul,
More informationAn EDF-based Scheduling Algorithm for Multiprocessor Soft Real-Time Systems
An EDF-based Scheduling Algorithm for Multiprocessor Soft Real-Time Systems James H. Anderson, Vasile Bud, and UmaMaheswari C. Devi Department of Computer Science The University of North Carolina at Chapel
More informationEDF and RM Multiprocessor Scheduling Algorithms: Survey and Performance Evaluation
1 EDF and RM Multiprocessor Scheduling Algorithms: Survey and Performance Evaluation Omar U. Pereira Zapata, Pedro Mejía Alvarez CINVESTAV-IPN, Sección de Computación Av. I.P.N. 258, Zacatenco, México,
More informationCompositional Analysis Techniques For Multiprocessor Soft Real-Time Scheduling
Compositional Analysis Techniques For Multiprocessor Soft Real-Time Scheduling Hennadiy Leontyev A dissertation submitted to the faculty of the University of North Carolina at Chapel Hill in partial fulfillment
More informationEDF Feasibility and Hardware Accelerators
EDF Feasibility and Hardware Accelerators Andrew Morton University of Waterloo, Waterloo, Canada, arrmorton@uwaterloo.ca Wayne M. Loucks University of Waterloo, Waterloo, Canada, wmloucks@pads.uwaterloo.ca
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...!2
More informationScheduling Periodic Real-Time Tasks on Uniprocessor Systems. LS 12, TU Dortmund
Scheduling Periodic Real-Time Tasks on Uniprocessor Systems Prof. Dr. Jian-Jia Chen LS 12, TU Dortmund 08, Dec., 2015 Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 1 / 38 Periodic Control System Pseudo-code
More informationMultiprocessor EDF and Deadline Monotonic Schedulability Analysis
Multiprocessor EDF and Deadline Monotonic Schedulability Analysis Ted Baker Department of Computer Science Florida State University Tallahassee, FL 32306-4530 http://www.cs.fsu.edu/ baker Overview 1. question
More informationOptimal Semi-Partitioned Scheduling in Soft Real-Time Systems
Optimal Semi-Partitioned Scheduling in Soft Real-Time Systems James H. Anderson 1, Benjamin N. Casses 1, UmaMaheswari C. Devi 2, and Jeremy P. Erickson 1 1 Dept. of Computer Science, University of North
More informationLecture 6. Real-Time Systems. Dynamic Priority Scheduling
Real-Time Systems Lecture 6 Dynamic Priority Scheduling Online scheduling with dynamic priorities: Earliest Deadline First scheduling CPU utilization bound Optimality and comparison with RM: Schedulability
More informationPartitioned scheduling of sporadic task systems: an ILP-based approach
Partitioned scheduling of sporadic task systems: an ILP-based approach Sanjoy K. Baruah The University of North Carolina Chapel Hill, NC. USA Enrico Bini Scuola Superiore Santa Anna Pisa, Italy. Abstract
More informationCSE 380 Computer Operating Systems
CSE 380 Computer Operating Systems Instructor: Insup Lee & Dianna Xu University of Pennsylvania, Fall 2003 Lecture Note 3: CPU Scheduling 1 CPU SCHEDULING q How can OS schedule the allocation of CPU cycles
More informationControlling Preemption for Better Schedulability in Multi-Core Systems
2012 IEEE 33rd Real-Time Systems Symposium Controlling Preemption for Better Schedulability in Multi-Core Systems Jinkyu Lee and Kang G. Shin Dept. of Electrical Engineering and Computer Science, The University
More informationReal-Time Systems. Event-Driven Scheduling
Real-Time Systems Event-Driven Scheduling Marcus Völp, Hermann Härtig WS 2013/14 Outline mostly following Jane Liu, Real-Time Systems Principles Scheduling EDF and LST as dynamic scheduling methods Fixed
More informationThere are three priority driven approaches that we will look at
Priority Driven Approaches There are three priority driven approaches that we will look at Earliest-Deadline-First (EDF) Least-Slack-Time-first (LST) Latest-Release-Time-first (LRT) 1 EDF Earliest deadline
More informationSchedulability and Optimization Analysis for Non-Preemptive Static Priority Scheduling Based on Task Utilization and Blocking Factors
Schedulability and Optimization Analysis for Non-Preemptive Static Priority Scheduling Based on Task Utilization and Blocking Factors Georg von der Brüggen, Jian-Jia Chen, Wen-Hung Huang Department of
More informationReal-Time Systems. LS 12, TU Dortmund
Real-Time Systems Prof. Dr. Jian-Jia Chen LS 12, TU Dortmund April 24, 2014 Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 1 / 57 Organization Instructor: Jian-Jia Chen, jian-jia.chen@cs.uni-dortmund.de
More informationNATCOR: Stochastic Modelling
NATCOR: Stochastic Modelling Queueing Theory II Chris Kirkbride Management Science 2017 Overview of Today s Sessions I Introduction to Queueing Modelling II Multiclass Queueing Models III Queueing Control
More informationMulti-core Real-Time Scheduling for Generalized Parallel Task Models
Washington University in St. Louis Washington University Open Scholarship All Computer Science and Engineering Research Computer Science and Engineering Report Number: WUCSE-011-45 011 Multi-core Real-Time
More informationReal-Time Systems. Event-Driven Scheduling
Real-Time Systems Event-Driven Scheduling Hermann Härtig WS 2018/19 Outline mostly following Jane Liu, Real-Time Systems Principles Scheduling EDF and LST as dynamic scheduling methods Fixed Priority schedulers
More informationReducing Tardiness Under Global Scheduling by Splitting Jobs
Reducing Tardiness Under Global Scheduling by Splitting Jobs Jeremy P. Erickson and James H. Anderson The University of North Carolina at Chapel Hill Abstract Under current analysis, soft real-time tardiness
More informationMitra Nasri* Morteza Mohaqeqi Gerhard Fohler
Mitra Nasri* Morteza Mohaqeqi Gerhard Fohler RTNS, October 2016 Since 1973 it is known that period ratio affects the RM Schedulability The hardest-to-schedule task set [Liu and Layland] T 2 T n T 1 T 2
More informationResponse Time Analysis for Tasks Scheduled under EDF within Fixed Priorities
Response Time Analysis for Tasks Scheduled under EDF within Fixed Priorities M. González Harbour and J.C. Palencia Departamento de Electrónica y Computadores Universidad de Cantabria 39-Santander, SPAIN
More informationGlobal mixed-criticality scheduling on multiprocessors
Global mixed-criticality scheduling on multiprocessors Haohan Li Sanjoy Baruah The University of North Carolina at Chapel Hill Abstract The scheduling of mixed-criticality implicit-deadline sporadic task
More informationthe currently active 1 job whose deadline parameter is the smallest, is an optimal scheduling algorithm in the sense that if a system can be scheduled
Priority-driven scheduling of periodic task systems on multiprocessors Λ Joël Goossens Shelby Funk Sanjoy Baruah Abstract The scheduling of systems of periodic tasks upon multiprocessor platforms is considered.
More informationAn Overview of Interrupt Accounting Techniques for Multiprocessor Real-Time Systems
An Overview of Interrupt Accounting Techniques for Multiprocessor Real-Time Systems Björn B. Brandenburg Hennadiy Leontyev James H. Anderson Abstract The importance of accounting for interrupts in multiprocessor
More informationSchedulability of Periodic and Sporadic Task Sets on Uniprocessor Systems
Schedulability of Periodic and Sporadic Task Sets on Uniprocessor Systems Jan Reineke Saarland University July 4, 2013 With thanks to Jian-Jia Chen! Jan Reineke July 4, 2013 1 / 58 Task Models and Scheduling
More informationSupporting Intra-Task Parallelism in Real- Time Multiprocessor Systems José Fonseca
Technical Report Supporting Intra-Task Parallelism in Real- Time Multiprocessor Systems José Fonseca CISTER-TR-121007 Version: Date: 1/1/2014 Technical Report CISTER-TR-121007 Supporting Intra-Task Parallelism
More informationA Theory of Rate-Based Execution. A Theory of Rate-Based Execution
Kevin Jeffay Department of Computer Science University of North Carolina at Chapel Hill jeffay@cs cs.unc.edu Steve Goddard Computer Science & Engineering University of Nebraska Ð Lincoln goddard@cse cse.unl.edu
More informationCycleTandem: Energy-Saving Scheduling for Real-Time Systems with Hardware Accelerators
CycleTandem: Energy-Saving Scheduling for Real-Time Systems with Hardware Accelerators Sandeep D souza and Ragunathan (Raj) Rajkumar Carnegie Mellon University High (Energy) Cost of Accelerators Modern-day
More informationHeterogeneous multiprocessor compositional real-time scheduling
Heterogeneous multiprocessor compositional real-time scheduling João Pedro Craveiro José Rufino Universidade de Lisboa, Faculdade de Ciências, LaSIGE Lisbon, Portugal The 3rd International Real-Time Scheduling
More informationAn Improved Schedulability Test for Uniprocessor. Periodic Task Systems
An Improved Schedulability Test for Uniprocessor Periodic Task Systems UmaMaheswari C. Devi Department of Computer Science, University of North Carolina, Chapel Hill, NC 27599-375 December 2002 Abstract
More information