Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Modular Performance Analysis with Real-Time Calculus Lothar Thiele,

Slides:



Advertisements
Similar presentations
TWO STEP EQUATIONS 1. SOLVE FOR X 2. DO THE ADDITION STEP FIRST
Advertisements

(Fuzzy Set Operations)
Kapitel S3 Astronomie Autor: Bennett et al. Raumzeit und Gravitation Kapitel S3 Raumzeit und Gravitation © Pearson Studium 2010 Folie: 1.
Kapitel 21 Astronomie Autor: Bennett et al. Galaxienentwicklung Kapitel 21 Galaxienentwicklung © Pearson Studium 2010 Folie: 1.
Chapter 6 Cost and Choice. Copyright © 2001 Addison Wesley LongmanSlide 6- 2 Figure 6.1 A Simplified Jam-Making Technology.
Copyright © 2011, Elsevier Inc. All rights reserved. Chapter 5 Author: Julia Richards and R. Scott Hawley.
1 Copyright © 2010, Elsevier Inc. All rights Reserved Fig 2.1 Chapter 2.
By D. Fisher Geometric Transformations. Reflection, Rotation, or Translation 1.
1 Rate and distance fairness in OBS networks Tananun Orawiwattanakul, Yusheng Ji.
Business Transaction Management Software for Application Coordination 1 Business Processes and Coordination.
Scalable Routing In Delay Tolerant Networks
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Title Subtitle.
0 - 0.
ALGEBRAIC EXPRESSIONS
DIVIDING INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
MULTIPLYING MONOMIALS TIMES POLYNOMIALS (DISTRIBUTIVE PROPERTY)
ADDING INTEGERS 1. POS. + POS. = POS. 2. NEG. + NEG. = NEG. 3. POS. + NEG. OR NEG. + POS. SUBTRACT TAKE SIGN OF BIGGER ABSOLUTE VALUE.
SUBTRACTING INTEGERS 1. CHANGE THE SUBTRACTION SIGN TO ADDITION
MULT. INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
FACTORING ax2 + bx + c Think “unfoil” Work down, Show all steps.
Addition Facts
Year 6 mental test 5 second questions
1 Relational Algebra, Part III, and Other Operators Hugh Darwen CS252.HACD: Fundamentals of Relational.
ZMQS ZMQS
Fakultät für informatik informatik 12 technische universität dortmund Classical scheduling algorithms for periodic systems Peter Marwedel TU Dortmund,
1 Maintaining Packet Order in Two-Stage Switches Isaac Keslassy, Nick McKeown Stanford University.
Publish-Subscribe Approach to Social Annotation of News Top-k Publish-Subscribe for Social Annotation of News Joint work with: Maxim Gurevich (RelateIQ)
BT Wholesale October Creating your own telephone network WHOLESALE CALLS LINE ASSOCIATED.
Pinwheel Scheduling for Power-Aware Real-Time Systems Gaurav Chitroda Komal Kasat Nalini Kumar.
Outline Introduction Assumptions and notations
Slide 5-1 Copyright © 2004 Pearson Education, Inc. Operating Systems: A Modern Perspective, Chapter 5 5 Device Management.
ABC Technology Project
1 Comnet 2010 Communication Networks Recitation 4 Scheduling & Drop Policies.
© S Haughton more than 3?
VOORBLAD.
“Start-to-End” Simulations Imaging of Single Molecules at the European XFEL Igor Zagorodnov S2E Meeting DESY 10. February 2014.
Squares and Square Root WALK. Solve each problem REVIEW:
Chapter 5 Test Review Sections 5-1 through 5-4.
GG Consulting, LLC I-SUITE. Source: TEA SHARS Frequently asked questions 2.
Addition 1’s to 20.
25 seconds left…...
Test B, 100 Subtraction Facts
Fakultät für informatik informatik 12 technische universität dortmund Lab 3: Scheduling Solution - Session 10 - Heiko Falk TU Dortmund Informatik 12 Germany.
Week 1.
© COPYRIGHT IKERLAN 2014 Adding Precedence Relations to the Response-Time Analysis of EDF Distributed Real-Time Systems Unai Díaz de Cerio (IK4-Ikerlan)
We will resume in: 25 Minutes.
©Brooks/Cole, 2001 Chapter 12 Derived Types-- Enumerated, Structure and Union.
1 Unit 1 Kinematics Chapter 1 Day
PSSA Preparation.
How Cells Obtain Energy from Food
Delta-Oriented Testing for Finite State Machines
Environmental Data Analysis with MatLab Lecture 15: Factor Analysis.
Overload Scheduling in Real-Time Systems
1 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Design Space Exploration of Embedded Systems © Lothar Thiele ETH Zurich.
Performance Analysis of FlexRay-based ECU Networks Andrei Hagiescu, Unmesh D. Bordoloi, Samarjit Chakraborty Department of Computer Science, National.
Problem 12: Large Distributed Systems ECU1 BUS CC1 ECU2CC2 ECU3CC3 S1 S2 S3 S4 S5 5 Real-Time Input Streams - with jitter - with bursts - deadline > period.
Problem 11: Complex Hierarchical Scheduling Full Processor FP T3T2 T4T1 EDF T6T5 RM T10T9T8T7 EDFSPS DPS 10 Tasks - with jitter - with bursts - deadline.
1 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Performance Analysis of Embedded Systems Lothar Thiele ETH Zurich.
Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Power Management for Solar-Driven Sensor Nodes Clemens Moser ( joint.
1 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Embedded Systems Exercise 1: Real-Time Systems Ernesto Wandeler 20.
Embedded Systems Exercise 3: Scheduling Real-Time Periodic and Mixed Task Sets 18. May 2005 Alexander Maxiaguine.
1 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Research Challenges in Embedded Computing Lothar Thiele.
Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Influence of different system abstractions on the performance analysis.
1 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Internal Design Representations for Embedded System Design Lothar.
DESIGNING VM SCHEDULERS FOR EMBEDDED REAL-TIME APPLICATIONS Alejandro Masrur, Thomas Pfeuffer, Martin Geier, Sebastian Drössler and Samarjit Chakraborty.
Presentation transcript:

Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Modular Performance Analysis with Real-Time Calculus Lothar Thiele, Simon Künzli, Alex Maxiaguine, Ernesto Wandeler, et al. Computer Engineering and Networks Laboratory ETH Zurich, Switzerland 23. November 2005 Workshop on Distributed Embedded Systems, Leiden, The Netherlands

2 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Real-Time Calculus Developed at ETH Zurich since 2000 Based on: –Max-Plus/Min-Plus Algebra [Quadrat et al., 1992] –Network Calculus [Le Boudec & Thiran, 2001]

3 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Abstract Models for Performance Analysis Processor Task Input Stream Service Model Load Model Concrete Instance Abstract Representation Task / Processing Model

4 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Load Model t [ms] events Event Stream maximum / minimum arriving demand in any interval of length 2.5 ms 2.5 Arrival Curve & Delay d demand [ms] 2.5 number of events in in t=[ ] ms deadline = d Service Model Load Model Processing Model l u

5 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Load Model - Examples periodicperiodic w/ jitter periodic w/ burstcomplex Service Model Load Model Processing Model

6 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Service Model t [ms] availability Resource Availability maximum/minimum available service in any interval of length 2.5 ms available service in t=[ ] ms 2.5 u l Service Curves [ l, u ] service [ms] 2.5 Service Model Load Model Processing Model

7 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Service Model - Examples full resource bounded delay TDMA resourceperiodic resource Service Model Load Model Processing Model

8 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory d Task / Processing Model RTC Service Model Load Model Processing Model Real-Time Calculus

9 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Scheduling / Arbitration FP GPS EDF TDMA

10 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Analysis: Delay and Backlog delay d max backlog b max l u [ l, u ] RTC Service Model Load Model Processing Model

11 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Case Study ECU1 BUS CC1 ECU2CC2 ECU3CC3 S1 S2 S3 S4 S5 5 Real-Time Input Streams - with jitter - with bursts - deadline > period 3 ECUs with own CCs 12 Tasks & 7 Messages - with different WCED 2 Scheduling Policies - Earliest Deadline First (ECUs) - Fixed Priority (ECUs & CCs) Hierarchical Scheduling - Static & Dynamic Polling Servers Bus with TDMA - 4 time slots with different lengths (#1,#3 for CC1, #2 for CC3, #4 for CC3) Total Utilization: - ECU159 % - ECU287 % - ECU367 % - BUS56 %

12 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Specification Data

13 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory The Distributed Embedded System... ECU1BUS (TDMA) C1.1 C1.2 C2.1 C3.1 C4.1 C5.1 C3.2 T1.1 T1.3 T2.1 T3.1 T3.3 PS FP CC1 ECU2 T4.1 T5.1 FP CC2 ECU3 T1.2 FP CC3 T3.2 FP EDF T2.2 PS T4.2 PS T5.2 S1 S2 S3 S4 S5 S1 S3

14 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory... and its Real-Time Calculus Model S5 S4 S1 S2 S3 T1.1 T1.3 C4.1 C5.1 TDMA CPU T2.1 T3.1 T3.3 CPU T4.1 T5.1 CPU PS T1.2 EDF PS T3.2 C1.2 C3.2 C2.1 C3.1 C1.1 T5.2 T4.2 T2.2 PS ECU1 ECU2 ECU3 BUS CC1 CC2 CC3

15 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Input & Output of Stream 3 S5 S4 S1 S2 S3 T1.1 T1.3 C4.1 C5.1 TDMA CPU T2.1 T3.1 T3.3 CPU T4.1 T5.1 CPU PS T1.2 EDF PS T3.2 C1.2 C3.2 C2.1 C3.1 C1.1 T5.2 T4.2 T2.2 PS ECU1 ECU2 ECU3 BUS CC1 CC2 CC3

16 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Service Demand & Supply for EDF Block S5 S4 S1 S2 S3 T1.1 T1.3 C4.1 C5.1 TDMA CPU T2.1 T3.1 T3.3 CPU T4.1 T5.1 CPU PS T1.2 EDF PS T3.2 C1.2 C3.2 C2.1 C3.1 C1.1 T5.2 T4.2 T2.2 PS ECU1 ECU2 ECU3 BUS CC1 CC2 CC3

17 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Service Demand & Supply for EDF Block S5 S4 S1 S2 S3 T1.1 T1.3 C4.1 C5.1 TDMA CPU T2.1 T3.1 T3.3 CPU T4.1 T5.1 CPU PS T1.2 EDF PS T3.2 C1.2 C3.2 C2.1 C3.1 C1.1 T5.2 T4.2 T2.2 PS ECU1 ECU2 ECU3 BUS CC1 CC2 CC3

18 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Service Demand & Supply for EDF Block S5 S4 S1 S2 S3 T1.1 T1.3 C4.1 C5.1 TDMA CPU T2.1 T3.1 T3.3 CPU T4.1 T5.1 CPU PS T1.2 EDF PS T3.2 C1.2 C3.2 C2.1 C3.1 C1.1 T5.2 T4.2 T2.2 PS ECU1 ECU2 ECU3 BUS CC1 CC2 CC3

19 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Buffer Requirements S5 S4 S1 S2 S3 T1.1 T1.3 C4.1 C5.1 TDMA CPU T2.1 T3.1 T3.3 CPU T4.1 T5.1 CPU PS T1.2 EDF PS T3.2 C1.2 C3.2 C2.1 C3.1 C1.1 T5.2 T4.2 T2.2 PS ECU1 ECU2 ECU3 BUS CC1 CC2 CC

20 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Delay Guarantees S5 S4 S1 S2 S3 T1.1 T1.3 C4.1 C5.1 TDMA CPU T2.1 T3.1 T3.3 CPU T4.1 T5.1 CPU PS T1.2 EDF PS T3.2 C1.2 C3.2 C2.1 C3.1 C1.1 T5.2 T4.2 T2.2 PS ECU1 ECU2 ECU3 BUS CC1 CC2 CC

21 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory System Analysis Time Pentium Mobile 1.6GHz Matlab 7 RTC Kernel Prototype (Java 1.4)

22 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Tool Support Matlab Toolbox for Real-Time Calculus –Version 1.0 to be released December 2005 Simulink Frontend –Prototype under development

23 Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Limitations of Real-Time Calculus High Level of Abstraction Time-Interval Domain

Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Thank you! Ernesto Wandeler