Real-Time Scheduling. Dynamic Priority Servers
|
|
- Dwain Quinn
- 5 years ago
- Views:
Transcription
1 Real-Time Scheduling Dynamic Priority Servers
2 Objectives Schedule soft aperiodic and hard periodic tasks Reduce average response time of aperiodic requests without compromising schedulability of periodic tasks Periodic tasks are schedule by EDF Higher schedulability bounds than with fixedpriority assignments Fixed-priority: RM (periodic), U p =0.6, SS (aperiodic) U s =0.1 Dynamic-priority: EDF (periodic), U p =0.6 U s =0.4 Application: multimedia 2
3 Assumptions Periodic tasks scheduled by EDF Periodic tasks Hard All tasks start at t = 0 T i, C i, D i D i = T i Aperiodic tasks Soft, no deadlines Unkown arrival time r i Known C i (WCET Worst Case Execution Time) 3
4 BS BS = Background Server Simple implementation Serve hard periodic tasks accordingly to EDF If there is slack time, serve soft aperiodic tasks Worst performance 4
5 DPE (1/3) DPE Dynamic Priority Exchange server Extension of the PE server Server trade its runtime with that of lower priority tasks DPE server: T s and C s Aperiodic capacities receive priorities according to deadlines and EDF Ties are broken in favor of capacities (aperiodic requests) 5
6 DPE (2/3) C S 16 C S 8 t1 C S 24 C S 12 t2 aperiodic C S 6 C S C S C S 18 C S t1 = (8, 2) t2 = (12, 3) S = (6, 3) 6
7 DPE (3/3) U p : periodic tasks processor utilization U s : DPE server processor utilization Whole set is schedulable if U p + U s 1 7
8 DSS (1/3) DSS = Dynamic Sporadic Server Extends SS to work with EDF Server capacity preserved for possible aperiodic requests Capacity replenished only after consumption Replenishment time: d s = t A + T s Server gets no more than U s even when experiencing overload (when tasks execute more than WCET) 8
9 DSS (2/3) t1 t2 aperiodic t1 = (8, 2) t2 = (12, 3) S = (6, 3) d s = aperiodic deadline C S C s >0 d s =3+T s d s is the first deadline C s >0 d s =6+T s d s =9+T s C s >0 both sered with the same deadline d s =14+T s 9
10 DSS (3/3) U p : periodic tasks processor utilization U s : DSS server processor utilization Whole set is schedulable if U p + U s 1 DSS becomes idle until next replenishing time Bad for soft tasks response time 10
11 TBS (1/3) TBS = Total Bandwidth Server In DSS, if T s is long, aperiodic requests can be delayed significantly (far deadline!) d k = max(r k,d k-1 ) + C k /U s r k = k-th aperiodic arrival time d 0 = 0 11
12 TBS (2/3) t1 t2 aperiodic 1 d d 2 d t1 = (6, 3) t2 = (8, 2) U s = 1-U p = 0.25 d 1 =3+(1/0.25)=7 d 2 =9+(2/0.25)=17 d 3 =17+(1/0.25)=21 12
13 TBS (3/3) Implementation cost: neglegible U p : periodic tasks processor utilization U s : TBS server processor utilization Whole set is schedulable if U p + U s 1 Need of exact WCET knowledge 13
14 CBS (1/3) CBS = Constant Bandwidth Server Implements a bandwidth reservation scheme: server gets no more than U s even during overload If a task tries to execute for more than its WCET, its priority is decreased (deadline increased) Reduces interference on other taks Task remains elegible for execution, exploiting existing slack 14
15 CBS (2/3) C s <(d 2 -r 2 )U s uses d 2 t1 4 J 1,1 d 1 J 1,2 3 J 2,1 d2 J 2,2 d 3 aperiodic r 1 r C S d 0 =0 server is idle d 1 =r 1 +T s =11 server recharged to C s =3 d 2 =d 1 +T s =19 server postponed C s replenished t1 = (7, 4) CBS: C s = 3; T s = 8 d k+1 =d k +T s when C s =0 d k+1 =r j +T s when server is idle (no pending tasks) and C s (d k -r j )U s d 3 =d 2 +T s =27 15
16 CBS (3/3) U p : periodic tasks processor utilization U s : CBS server processor utilization Whole set is schedulable if U p + U s 1 Protects hard tasks from soft tasks transient overruns 16
17 Comparison (1/6) Simulation of BS, DSS, DPE, and TBS 10 periodic tasks T i { } units of time U p = 0.65 Aperiodic tasks Utilization from 3% to 33% (1-0.65=0.35) Poisson interarrival times, with average T a Aperiodic execution times exponentially distributed Periodic server T s = T a C s = T a U s 17
18 Comparison (2/6) relative to BS 18
19 Comparison (3/6) Simulation of DSS, TBS, and CBS Average soft tasks tardiness max{0,f i -d i } Multimedia tasks don t need to meet all deadlines Simulation 5 periodic hard tasks, fixed parameters 5 aperiodic soft tasks, variable execution and interarrival times 19
20 Comparison (4/6) DSS becomes idle until next replenishing time! 20
21 Comparison (5/6) TBS slightly outperforms CBS but does not protect hard tasks from transient overruns of soft activities 21
22 Comparison (6/6) Qualitative evaluation Policy Performance Computational complexity Memory requirement Implementation complexity BS DPE DSS TBS CBS 22
23 References Hard Real-Time Computing Systems, G. Buttazzo, Kluwer Academic 23
Overview of Scheduling a Mix of Periodic and Aperiodic Tasks
Overview of Scheduling a Mix of Periodic and Aperiodic Tasks Minsoo Ryu Department of Computer Science and Engineering 2 Naive approach Background scheduling Algorithms Under static priority policy (RM)
More informationDynamic Voltage Scaling of Periodic and Aperiodic Tasks in Priority-Driven Systems Λ
Dynamic Voltage Scaling of Periodic and Aperiodic Tasks in Priority-Driven Systems Λ Dongkun Shin Jihong Kim School of CSE School of CSE Seoul National University Seoul National University Seoul, Korea
More informationrequests or displaying activities, hence they usually have soft deadlines, or no deadlines at all. Aperiodic tasks with hard deadlines are called spor
Scheduling Aperiodic Tasks in Dynamic Priority Systems Marco Spuri and Giorgio Buttazzo Scuola Superiore S.Anna, via Carducci 4, 561 Pisa, Italy Email: spuri@fastnet.it, giorgio@sssup.it Abstract In this
More informationAperiodic Servers (Issues)
Aperiodic Servers (Issues) Interference Causes more interference than simple periodic tasks Increased context switching Cache interference Accounting Context switch time Again, possibly more context switches
More informationIntegrating Multimedia Applications in Hard Real-Time Systems
Proceedings of IEEE Real-Time System Symposium, Madrid, Spain, 998 Integrating Multimedia Applications in Hard Real-Time Systems Luca Abeni and Giorgio Buttazzo Scuola Superiore S Anna, Pisa luca@hartiksssupit,
More informationREcent real-time systems are required to deal with not
Feedback-Controlled Server for Scheduling Aperiodic Tasks Shinpei Kato and Nobuyuki Yamasaki Abstract This paper proposes a scheduling scheme using feedback control to reduce the response time of aperiodic
More informationA Capacity Sharing and Stealing Strategy for Open Real-time Systems
A Capacity Sharing and Stealing Strategy for Open Real-time Systems Luís Nogueira, Luís Miguel Pinho CISTER Research Centre School of Engineering of the Polytechnic Institute of Porto (ISEP/IPP) Rua Dr.
More informationScheduling Sporadic and Aperiodic Events in a Hard Real-Time System
Technical Report CMU/SEI-89-TR-11 ESD-TR-89-19 Scheduling Sporadic and Aperiodic Events in a Hard Real-Time System Brinkley Sprunt Lui Sha John Lehoczky April 1989 Technical Report CMU/SEI-89-TR-11 ESD-TR-89-19
More informationImplementing Sporadic Servers in Ada
Technical Report CMU/SEI-90-TR-6 ESD-90-TR-207 Implementing Sporadic Servers in Ada Brinkley Sprunt Lui Sha May 1990 Technical Report CMU/SEI-90-TR-6 ESD-90-TR-207 May 1990 Implementing Sporadic Servers
More information6.1 Motivation. Fixed Priorities. 6.2 Context Switch. Real-time is about predictability, i.e. guarantees. Real-Time Systems
Real-Time Systems Summer term 2017 6.1 Motivation 6.1 Motivation Real-Time Systems 6 th Chapter Practical Considerations Jafar Akhundov, M.Sc. Professur Betriebssysteme Real-time is about predictability,
More informationReal Time Operating Systems and Middleware
Real Time Operating Systems and Middleware Introduction to Real-Time Systems Luca Abeni abeni@disi.unitn.it Credits: Luigi Palopoli, Giuseppe Lipari, Marco Di Natale, and Giorgio Buttazzo Scuola Superiore
More informationResource Reservation & Resource Servers
Resource Reservation & Resource Servers Resource Reservation Application Hard real-time, Soft real-time, Others? Platform Hardware Resources: CPU cycles, memory blocks 1 Applications Hard-deadline tasks
More informationSporadic Server Scheduling in Linux Theory vs. Practice. Mark Stanovich Theodore Baker Andy Wang
Sporadic Server Scheduling in Linux Theory vs. Practice Mark Stanovich Theodore Baker Andy Wang Real-Time Scheduling Theory Analysis techniques to design a system to meet timing constraints Schedulability
More informationReservation-Based Scheduling for IRQ Threads
Reservation-Based Scheduling for IRQ Threads Luca Abeni, Nicola Manica, Luigi Palopoli luca.abeni@unitn.it, nicola.manica@gmail.com, palopoli@dit.unitn.it University of Trento, Trento - Italy Reservation-Based
More informationOverview. Sporadic tasks. Recall. Aperiodic tasks. Real-time Systems D0003E 2/26/2009. Loosening D = T. Aperiodic tasks. Response-time analysis
Overview Real-time Systems D0003E Lecture 11: Priority inversion Burns/Wellings ch. 13 (except 13.12) Aperiodic tasks Response time analysis Blocking Priority inversion Priority inheritance Priority ceiling
More informationSimplified design flow for embedded systems
Simplified design flow for embedded systems 2005/12/02-1- Reuse of standard software components Knowledge from previous designs to be made available in the form of intellectual property (IP, for SW & HW).
More informationCopyright Notice. COMP9242 Advanced Operating Systems S2/2014 Week 9: Real-Time Systems. Real-Time System: Definition
Copyright Notice These slides are distributed under the Creative Commons Attribution.0 License COMP94 Advanced Operating Systems S/014 Week 9: Real- Systems @GernotHeiser You are free: to share to copy,
More informationReal-time operating systems and scheduling
Real-time operating systems and scheduling Problem 21 Consider a real-time operating system (OS) that has a built-in preemptive scheduler. Each task has a unique priority and the lower the priority id,
More informationConstant Bandwidth vs Proportional Share Resource Allocation
Proceedings of IEEE ICMCS, Florence, Italy, June 1999 1 Constant Bandwidth vs Proportional Share Resource Allocation Luca Abeni, Giuseppe Lipari and Giorgio Buttazzo Scuola Superiore S. Anna, Pisa luca,lipari,giorgio@sssup.it
More information1.1 Explain the difference between fast computing and real-time computing.
i 1.1 Explain the difference between fast computing and real-time computing. 1.2 What are the main limitations of the current real-time kernels for the development of critical control applications? 1.3
More informationEvent-Driven Scheduling. (closely following Jane Liu s Book)
Event-Driven Scheduling (closely following Jane Liu s Book) Real-Time Systems, 2006 Event-Driven Systems, 1 Principles Assign priorities to Jobs At events, jobs are scheduled according to their priorities
More informationSCHEDULING REAL-TIME MESSAGES IN PACKET-SWITCHED NETWORKS IAN RAMSAY PHILP. B.S., University of North Carolina at Chapel Hill, 1988
SCHEDULING REAL-TIME MESSAGES IN PACKET-SWITCHED NETWORKS BY IAN RAMSAY PHILP B.S., University of North Carolina at Chapel Hill, 1988 M.S., University of Florida, 1990 THESIS Submitted in partial fulllment
More informationEmbedded Software Programming
Embedded Software Programming Computer Science & Engineering Department Arizona State University Tempe, AZ 85287 Dr. Yann-Hang Lee yhlee@asu.edu (480) 727-7507 Event and Time-Driven Threads taskspawn (name,
More information4/6/2011. Informally, scheduling is. Informally, scheduling is. More precisely, Periodic and Aperiodic. Periodic Task. Periodic Task (Contd.
So far in CS4271 Functionality analysis Modeling, Model Checking Timing Analysis Software level WCET analysis System level Scheduling methods Today! erformance Validation Systems CS 4271 Lecture 10 Abhik
More informationReal-Time Architectures 2004/2005
Real-Time Architectures 2004/2005 Scheduling Analysis I Introduction & Basic scheduling analysis Reinder J. Bril 08-04-2005 1 Overview Algorithm and problem classes Simple, periodic taskset problem statement
More informationDepartment of Computer Science Institute for System Architecture, Operating Systems Group REAL-TIME MICHAEL ROITZSCH OVERVIEW
Department of Computer Science Institute for System Architecture, Operating Systems Group REAL-TIME MICHAEL ROITZSCH OVERVIEW 2 SO FAR talked about in-kernel building blocks: threads memory IPC drivers
More informationIntroduction to Embedded Systems
Introduction to Embedded Systems Sanjit A. Seshia UC Berkeley EECS 9/9A Fall 0 008-0: E. A. Lee, A. L. Sangiovanni-Vincentelli, S. A. Seshia. All rights reserved. Chapter : Operating Systems, Microkernels,
More informationScheduling Algorithms for Real-Time Systems
Scheduling Algorithms for Real-Time Systems Fredrik Lindh Master Program in Computer Engineering Mälardalens University, Sweden flh07001@student.mdh.se Thomas Otnes Jessica Wennerström Master Program in
More informationConcurrent activities in daily life. Real world exposed programs. Scheduling of programs. Tasks in engine system. Engine system
Real world exposed programs Programs written to interact with the real world, outside the computer Programs handle input and output of data in pace matching the real world processes Necessitates ability
More informationExam Review TexPoint fonts used in EMF.
Exam Review Generics Definitions: hard & soft real-time Task/message classification based on criticality and invocation behavior Why special performance measures for RTES? What s deadline and where is
More information7. Multimedia Operating System. Contents. 7.3 Resource Management. 7.4 Process Management. 7.2 Real Time Systems. 7.5 Prototype Systems. 7.
Contents 7. Overview 7.2 Real Time Systems 7.3 Resource Management Dimensions in Resource Design Reservation Strategies 7.4 Process Management Classification of Real-Time Scheduling Strategies Schedulability
More informationImplementing Scheduling Algorithms. Real-Time and Embedded Systems (M) Lecture 9
Implementing Scheduling Algorithms Real-Time and Embedded Systems (M) Lecture 9 Lecture Outline Implementing real time systems Key concepts and constraints System architectures: Cyclic executive Microkernel
More informationReference Model and Scheduling Policies for Real-Time Systems
ESG Seminar p.1/42 Reference Model and Scheduling Policies for Real-Time Systems Mayank Agarwal and Ankit Mathur Dept. of Computer Science and Engineering, Indian Institute of Technology Delhi ESG Seminar
More informationAperiodic Task Scheduling
Aperiodic Task Scheduling Radek Pelánek Preemptive Scheduling: The Problem 1 processor arbitrary arrival times of tasks preemption performance measure: maximum lateness no resources, no precedence constraints
More informationScheduling Aperiodic Tasks using Total Bandwidth Server on Multiprocessors
Scheduling Aperiodic Tasks using Total Bandwidth Server on Multiprocessors Shinpei Kato and Nobuyuki Yamasaki Department of Information and Computer Science Keio University, Yokohama, Japan {shinpei,yamasaki}@ny.ics.keio.ac.jp
More informationImpact of Non-stationary Workload on Resource Reservation Based Slack Reclamation
Impact of Non-stationary Workload on Resource Reservation Based Slack Reclamation Technical Report CU-CS-53-9 May 9 Wang-ting Lin and Gary Nutt Department of Computer Science University of Colorado Boulder,
More informationTHE integration of multiple functionalities on a single
Scheduling Mixed-Criticality Real-Time Tasks with Fault Tolerance Jian (Denny) Lin 1, Albert M. K. Cheng 2, Douglas Steel 1, Michael Yu-Chi Wu 1 1 Department of Management Information Systems, University
More informationFIXED-PRIORITY SERVERS
5 FIXED-PRIORITY SERVERS 5.1 INTRODUCTION The scheduling algorithms treated in the previous chapters deal with homogeneous sets of tasks, where all computational activities are either aperiodic or periodic.
More informationFaculty of Computer Science Institute of Systems Architecture, Operating Systems Group. vs. REAL-TIME SYSTEMS MICHAEL ROITZSCH
Faculty of Computer Science Institute of Systems Architecture, Operating Systems Group REAL-TIME vs. SYSTEMS MICHAEL ROITZSCH DEFINITION system whose quality depends on the functional correctness of computations
More informationASurveyof Reservation-Based Scheduling
ISSN 0280 5316 ISRN LUTFD2/TFRT--7618--SE ASurveyof Reservation-Based Scheduling Mikael Lindberg Department of Automatic Control Lund Institute of Technology October 2007 1. Introduction ρ = C T This survey
More informationIN4343 Real-Time Systems
IN4343 Real-Time Systems Koen Langendoen, TA (TBD) 2017-2018 Delft University of Technology Challenge the future Course outline Real-time systems Lectures theory instruction Exam Reinder Bril TU/e Practicum
More informationMiddleware Support for Aperiodic Tasks in Distributed Real-Time Systems
Outline Middleware Support for Aperiodic Tasks in Distributed Real-Time Systems Yuanfang Zhang, Chenyang Lu and Chris Gill Department of Computer Science and Engineering Washington University in St. Louis
More informationLecture 12: An Overview of Scheduling Theory
Lecture 12: An Overview of Scheduling Theory [RTCS Ch 8] Introduction Execution Time Estimation Basic Scheduling Approaches Static Cyclic Scheduling Fixed Priority Scheduling Rate Monotonic Analysis Earliest
More informationSchedulability analysis of periodic and aperiodic tasks with resource constraints
Journal of Systems Architecture 46 (2000) 327±338 www.elsevier.com/locate/sysarc Schedulability analysis of periodic and aperiodic tasks with resource constraints Giuseppe Lipari *, Giorgio Buttazzo RETIS
More informationIntegrating Multimedia Applications in Hard Real-Time Systems
Integrating Multimedia Applications in Hard Real-Time Systems Luca Abeni and Giorgio Buttazzo Scuola Superiore S. Anna, Pisa luca@arti.sssup.it, giorgio@sssup.it Abstract Tis paper focuses on te problem
More informationA Survey of Reservation-based Scheduling
ISSN 0280-5316 ISRN LUTFD2/TFRT--7618--SE A Survey of Reservation-based Scheduling Mikael Lindberg Department of Automatic control Lund University October 2007 Lund University Department of Automatic
More informationPROCESS SCHEDULING Operating Systems Design Euiseong Seo
PROCESS SCHEDULING 2017 Operating Systems Design Euiseong Seo (euiseong@skku.edu) Histogram of CPU Burst Cycles Alternating Sequence of CPU and IO Processor Scheduling Selects from among the processes
More informationPROBABILISTIC SCHEDULING MICHAEL ROITZSCH
Faculty of Computer Science Institute of Systems Architecture, Operating Systems Group PROBABILISTIC SCHEDULING MICHAEL ROITZSCH DESKTOP REAL-TIME 2 PROBLEM worst case execution time (WCET) largely exceeds
More informationResponse Time Analysis of Asynchronous Real-Time Systems
Response Time Analysis of Asynchronous Real-Time Systems Guillem Bernat Real-Time Systems Research Group Department of Computer Science University of York York, YO10 5DD, UK Technical Report: YCS-2002-340
More informationIntroduction to Real-Time Systems ECE 397-1
Introduction to Real-Time Systems ECE 97-1 Northwestern University Department of Computer Science Department of Electrical and Computer Engineering Teachers: Robert Dick Peter Dinda Office: L477 Tech 8,
More informationScheduling Algorithm for Hard Real-Time Communication in Demand Priority Network
Scheduling Algorithm for Hard Real-Time Communication in Demand Priority Network Taewoong Kim, Heonshik Shin, and Naehyuck Chang Department of Computer Engineering Seoul National University, Seoul 151-742,
More informationEmbedded Systems: OS. Jin-Soo Kim Computer Systems Laboratory Sungkyunkwan University
Embedded Systems: OS Jin-Soo Kim (jinsookim@skku.edu) Computer Systems Laboratory Sungkyunkwan University http://csl.skku.edu Standalone Applications Often no OS involved One large loop Microcontroller-based
More informationENERGY EFFICIENT SCHEDULING FOR REAL-TIME EMBEDDED SYSTEMS WITH PRECEDENCE AND RESOURCE CONSTRAINTS
ENERGY EFFICIENT SCHEDULING FOR REAL-TIME EMBEDDED SYSTEMS WITH PRECEDENCE AND RESOURCE CONSTRAINTS Santhi Baskaran 1 and P. Thambidurai 2 1 Department of Information Technology, Pondicherry Engineering
More informationCS4514 Real Time Scheduling
CS4514 Real Time Scheduling Jose M. Garrido Fall 2015 Department of Computer Science 1 Periodic Tasks Typical real-time application has many tasks that need to be executed periodically Reading sensor data
More informationEmbedded Systems: OS
Embedded Systems: OS Jinkyu Jeong (Jinkyu@skku.edu) Computer Systems Laboratory Sungkyunkwan University http://csl.skku.edu ICE3028: Embedded Systems Design, Fall 2018, Jinkyu Jeong (jinkyu@skku.edu) Standalone
More informationMultimedia-Systems. Operating Systems. Prof. Dr.-Ing. Ralf Steinmetz Prof. Dr. rer. nat. Max Mühlhäuser Prof. Dr.-Ing. Wolfgang Effelsberg
Multimedia-Systems Operating Systems Prof. Dr.-Ing. Ralf Steinmetz Prof. Dr. rer. nat. Max Mühlhäuser Prof. Dr.-Ing. Wolfgang Effelsberg WE: University of Mannheim, Dept. of Computer Science Praktische
More informationFault tolerant scheduling in real time systems
tolerant scheduling in real time systems Afrin Shafiuddin Department of Electrical and Computer Engineering University of Wisconsin-Madison shafiuddin@wisc.edu Swetha Srinivasan Department of Electrical
More informationHandling Aperiodic Tasks and Overload in Distributed Off-line Scheduled Real-Time Systems
Mälardalen University Licentiate Thesis No.12 Handling Aperiodic Tasks and Overload in Distributed Off-line Scheduled Real-Time Systems Tomas Lennvall May 2003 Department of Computer Science and Engineering
More informationPriority assignment in real-time active databases 1
The VLDB Journal 1996) 5: 19 34 The VLDB Journal c Springer-Verlag 1996 Priority assignment in real-time active databases 1 Rajendran M. Sivasankaran, John A. Stankovic, Don Towsley, Bhaskar Purimetla,
More informationCMU/SEI-90-TR-6. Carnegie-Mellon University - Software Engineering Institute. Implementing Sporadic Servers in Ada. Brinkley Sprunt Lul Sha.
FriP Technical Report CMU/SEI-90-TR-6 FILE Cofn"S"T 2 Carnegie-Mellon University - Software Engineering Institute C1) (0 N Am Implementing Sporadic Servers in Ada Brinkley Sprunt Lul Sha May 1990 ",.,
More informationWITH THE proliferation of the embedded computing devices,
316 IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, VOL. 6, NO. 3, AUGUST 2010 On Maximizing Reliability of Real-Time Embedded Applications Under Hard Energy Constraint Baoxian Zhao, Hakan Aydin, Member,
More informationGeneral Terms Algorithms, Performance, Reliability. Keywords Real-time systems, hierarchical scheduling, resource sharing, operating systems.
Adaptive Resource Synchronization In Hierarchical Real-Time Systems Tom Springer, Steffen Peter, and Tony Givargis Center for Embedded Computer Systems University of California, Irvine, USA {tspringe,
More informationSCHED DEADLINE: a real-time CPU scheduler for Linux
: a real-time CPU scheduler for Luca Abeni luca.abeni@santannapisa.it TuToR 2017 Luca Abeni 1 / 33 Scheduling Real-Time Tasks c j f j c j+1 r d j j r f j+1 d j+1 j+1 Consider a set ofn real-time tasks
More informationTHE main goal of a real-time scheduler is to provide
IEEE TRANSACTIONS ON COMPUTERS, VOL. 53, NO. 12, DECEMBER 2004 1591 Task Synchronization in Reservation-Based Real-Time Systems Giuseppe Lipari, Member, IEEE, Gerardo Lamastra, Member, IEEE, and Luca Abeni,
More informationAuthors Abugchem, F. (Fathi); Short, M. (Michael); Xu, D. (Donglai)
TeesRep - Teesside's Research Repository A Note on the Suboptimality of Nonpreemptive Real-time Scheduling Item type Article Authors Abugchem, F. (Fathi); Short, M. (Michael); Xu, D. (Donglai) Citation
More informationAdmission Control and Overload Handling in FTT-CAN
Admission Control and Overload Handling in FTT-CAN F. Bertozzi, M. Di Natale Scuola Superiore S. Anna - Pisa, Italy cisco@gandalf.sssup.it marco@sssup.it L.Almeida Universidade de Aveiro - Aveiro, Portugal
More informationServer-Based Scheduling of the CAN Bus
Server-Based Scheduling of the CAN Bus Thomas Nolte, Mikael Sjödin, and Hans Hansson Mälardalen Real-Time Research Centre Deptartment of Computer Science and Engineering Mälardalen University, Västerås,
More informationResource Reservation in Dynamic Real-Time Systems
Real-Time Systems, 27, 123±167, 2004 # 2004 Kluwer Academic Publishers.Manufactured in The Netherlands. Resource Reservation in Dynamic Real-Time Systems LUCA ABENI Broadsat S.r.l., Pisa, Italy GIORGIO
More informationFMCAD 2011 (Austin, Texas) Jonathan Kotker, Dorsa Sadigh, Sanjit Seshia University of California, Berkeley
FMCAD 2011 (Austin, Texas) Jonathan Kotker, Dorsa Sadigh, Sanjit Seshia University of California, Berkeley 1 Cyber-Physical = Computation + Physical Processes Quantitative analysis of programs is crucial:
More informationIntroduction to Real-Time Communications. Real-Time and Embedded Systems (M) Lecture 15
Introduction to Real-Time Communications Real-Time and Embedded Systems (M) Lecture 15 Lecture Outline Modelling real-time communications Traffic and network models Properties of networks Throughput, delay
More informationMASTER'S THESIS. Proportional and Sporadic Scheduling in Real-Time Operating Systems. Mikael Bertlin. Luleå University of Technology
MASTER'S THESIS 2008:061 CIV Proportional and Sporadic Scheduling in Real-Time Operating Systems Mikael Bertlin Luleå University of Technology MSc Programmes in Engineering Computer Science and Engineering
More informationAnalysis and Implementation of Global Preemptive Fixed-Priority Scheduling with Dynamic Cache Allocation
Analysis and Implementation of Global Preemptive Fixed-Priority Scheduling with Dynamic Cache Allocation Meng Xu Linh Thi Xuan Phan Hyon-Young Choi Insup Lee Department of Computer and Information Science
More informationPrecedence Graphs Revisited (Again)
Precedence Graphs Revisited (Again) [i,i+6) [i+6,i+12) T 2 [i,i+6) [i+6,i+12) T 3 [i,i+2) [i+2,i+4) [i+4,i+6) [i+6,i+8) T 4 [i,i+1) [i+1,i+2) [i+2,i+3) [i+3,i+4) [i+4,i+5) [i+5,i+6) [i+6,i+7) T 5 [i,i+1)
More informationSLA-Aware Adaptive Data Broadcasting in Wireless Environments. Adrian Daniel Popescu
SLA-Aware Adaptive Data Broadcasting in Wireless Environments by Adrian Daniel Popescu A thesis submitted in conformity with the requirements for the degree of Masters of Applied Science Graduate Department
More informationA Flattened Hierarchical Scheduler for Real-Time Virtual Machines
A Flattened Hierarchical Scheduler for Real-Time Virtual Machines Michael S. Drescher Thesis submitted to the Faculty of the Virginia Polytechnic Institute and State University in partial fulfillment of
More informationA Flattened Hierarchical Scheduler for Real-Time Virtualization
A Flattened Hierarchical Scheduler for Real-Time Virtualization Michael Drescher, Vincent Legout, Antonio Barbalace, Binoy Ravindran Dept. of Electrical and Computer Engineering Virginia Tech, Virginia,
More informationMicrokernel/OS and Real-Time Scheduling
Chapter 12 Microkernel/OS and Real-Time Scheduling Hongwei Zhang http://www.cs.wayne.edu/~hzhang/ Ack.: this lecture is prepared in part based on slides of Lee, Sangiovanni-Vincentelli, Seshia. Outline
More informationTwo Real-Time Operating Systems and Their Scheduling Algorithms: QNX vs. RTLinux
Two Real-Time Operating Systems and Their Scheduling Algorithms: QNX vs. RTLinux Daniel Svärd dansv077@student.liu.se Freddie Åström freas157@student.liu.se November 19, 2006 Abstract This report tries
More informationEfficient Power Management Schemes for Dual-Processor Fault-Tolerant Systems
Efficient Power Management Schemes for Dual-Processor Fault-Tolerant Systems Yifeng Guo, Dakai Zhu University of Texas at San Antonio {yguo, dzhu}@cs.utsa.edu Hakan Aydin George Mason University aydin@cs.gmu.edu
More informationServer-Based Scheduling of the CAN Bus
Server-Based Scheduling of the CAN Bus Thomas Nolte, Mikael Sjödin, and Hans Hansson Mälardalen Real-Time Research Centre Department of Computer Science and Engineering Mälardalen University, Västerås,
More informationHomework index. Processing resource description. Goals for lecture. Communication resource description. Graph extensions. Problem definition
Introduction to Real-Time Systems ECE 97-1 Homework index 1 Reading assignment.............. 4 Northwestern University Department of Computer Science Department of Electrical and Computer Engineering Teachers:
More informationSchedulability with resource sharing. Priority inheritance protocol Priority ceiling protocol Stack resource policy
Schedulability with resource sharing Priority inheritance protocol Priority ceiling protocol Stack resource policy 1 Lecture overview We have discussed the occurrence of unbounded priority inversion We
More information(b) External fragmentation can happen in a virtual memory paging system.
Alexandria University Faculty of Engineering Electrical Engineering - Communications Spring 2015 Final Exam CS333: Operating Systems Wednesday, June 17, 2015 Allowed Time: 3 Hours Maximum: 75 points Note:
More informationEnriching Enea OSE for Better Predictability Support
Enriching Enea OSE for Better Predictability Support Master of Science Thesis Naveed Ul Mustafa naveedum@kth.se Stockholm, August 2011 Examiner: Ingo Sander KTH ingo@kth.se Supervisor: Mehrdad Saadatmand
More informationResource Partitioning among Real-Time Applications
Resource Partitioning among Real-Time Applications Giuseppe Lipari nrico Bini Scuola Superiore S Anna Pisa Italy -mail: lipari@sssupit ebini@sssupit Abstract When executing different real-time applications
More informationA Synchronous IPC Protocol for Predictable Access to Shared Resources in Mixed-Criticality Systems
A Synchronous IPC Protocol for Predictable Access to Shared Resources in Mixed-Criticality Systems RTSS 14 December 4, 2014 Björn B. bbb@mpi-sws.org Linux Testbed for Multiprocessor Scheduling in Real-Time
More informationMulticore CPU Reclaiming: Parallel or Sequential?
Multicore CPU Reclaiming: Parallel or Sequential? Luca Abeni, Giuseppe Lipari, Andrea Parri, Youcheng Sun To cite this version: Luca Abeni, Giuseppe Lipari, Andrea Parri, Youcheng Sun. Multicore CPU Reclaiming:
More informationQuality of Service Scheduling in Real-Time Systems
Int. J. of Computers, Communications & Control, ISSN 1841-9836, E-ISSN 1841-9844 Vol. III (2008), No. 4, pp. 353-365 Quality of Service Scheduling in Real-Time Systems Audrey Marchand, Maryline Chetto
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 informationUsing SCHED DEADLINE in Linux. Luca Abeni
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 have priority
More informationPartitioned Fixed-Priority Scheduling of Parallel Tasks Without Preemptions
Partitioned Fixed-Priority Scheduling of Parallel Tasks Without Preemptions *, Alessandro Biondi *, Geoffrey Nelissen, and Giorgio Buttazzo * * ReTiS Lab, Scuola Superiore Sant Anna, Pisa, Italy CISTER,
More informationSubject Name: OPERATING SYSTEMS. Subject Code: 10EC65. Prepared By: Kala H S and Remya R. Department: ECE. Date:
Subject Name: OPERATING SYSTEMS Subject Code: 10EC65 Prepared By: Kala H S and Remya R Department: ECE Date: Unit 7 SCHEDULING TOPICS TO BE COVERED Preliminaries Non-preemptive scheduling policies Preemptive
More informationResource-bound process algebras for Schedulability and Performance Analysis of Real-Time and Embedded Systems
Resource-bound process algebras for Schedulability and Performance Analysis of Real-Time and Embedded Systems Insup Lee 1, Oleg Sokolsky 1, Anna Philippou 2 1 RTG (Real-Time Systems Group) Department of
More informationEECS 571 Principles of Real-Time Embedded Systems. Lecture Note #8: Task Assignment and Scheduling on Multiprocessor Systems
EECS 571 Principles of Real-Time Embedded Systems Lecture Note #8: Task Assignment and Scheduling on Multiprocessor Systems Kang G. Shin EECS Department University of Michigan What Have We Done So Far?
More informationMultimedia Systems 2011/2012
Multimedia Systems 2011/2012 System Architecture Prof. Dr. Paul Müller University of Kaiserslautern Department of Computer Science Integrated Communication Systems ICSY http://www.icsy.de Sitemap 2 Hardware
More informationDesign of a Real-Time Trader for Mobile Objects in Open Distributed Environments
Design of a Real-Time for Mobile Objects in Open Distributed Environments Song-yi Yi, Heonshik Shin Department of Computer Engineering Seoul National University Seoul 151-742, Korea fyis, shinhsg@ce2.snu.ac.kr
More informationAn efficient implementation of the BandWidth Inheritance protocol for handling hard and soft real-time applications in the Linux kernel
An efficient implementation of the BandWidth Inheritance protocol for handling hard and soft real-time applications in the Linux kernel Dario Faggioli, Giuseppe Lipari and Tommaso Cucinotta e-mail: d.faggioli@sssup.it,
More informationIntroduction to Real-time Systems. Advanced Operating Systems (M) Lecture 2
Introduction to Real-time Systems Advanced Operating Systems (M) Lecture 2 Introduction to Real-time Systems Real-time systems deliver services while meeting some timing constraints Not necessarily fast,
More informationOperating system concepts. Task scheduling
Operating system concepts Task scheduling Task scheduling (thread scheduling) Target of scheduling are ready tasks ACTIVE TASK BLOCKED TASKS PASSIVE TASKS READY TASKS Active task currently running on processor
More informationGiorgio Buttazzo. Scuola Superiore Sant Anna, Pisa. The transition
Giorgio Buttazzo Scuola Superiore Sant Anna, Pisa The transition On May 7 th, 2004, Intel, the world s largest chip maker, canceled the development of the Tejas processor, the successor of the Pentium4-style
More information