Real-Time Calculus (RTC) Reading Group I

Slides:



Advertisements
Similar presentations
CprE 458/558: Real-Time Systems
Advertisements

Resource Allocation: Deterministic Analysis. Traffic Model Stochastic Different sample paths with different properties Expected case analysis Deterministic.
End-to-End Analysis of Distributed Video-on-Demand Systems Padmavathi Mundur, Robert Simon, and Arun K. Sood IEEE Transactions on Multimedia, February.
CS 268: Lecture 15/16 (Packet Scheduling) Ion Stoica April 8/10, 2002.
Compositional Verification of Timed Systems. A Concept. Bengt Jonsson Leonid Mokrushin Xiaochun Shi Wang Yi Uppsala University Sweden Distributed Embedded.
Math – Getting Information from the Graph of a Function 1.
Study Tips for COP 4531 Ashok Srinivasan Computer Science, Florida State University Aim: To suggest learning techniques that will help you do well in this.
Packet Scheduling From Ion Stoica. 2 Packet Scheduling  Decide when and what packet to send on output link -Usually implemented at output interface 1.
Training for Performance Training Principles Overload –Increased capacity in response to training overload Specificity –Specific muscle involved –Energy.
Scheduling policies for real- time embedded systems.
Competitive Queue Policies for Differentiated Services Seminar in Packet Networks1 Competitive Queue Policies for Differentiated Services William.
Routers. These high-end, carrier-grade 7600 models process up to 30 million packets per second (pps).
Packet Forwarding. A router has several input/output lines. From an input line, it receives a packet. It will check the header of the packet to determine.
Improvements and changes for BOB SNIDEMILLER, SENIOR DIRECTOR OF TRANSPORATION TRANSPORTATION UPDATE.
0 For Government Use Only Central Performance Metric: Scenario and Tasks Scenario ……..... ….. ….. … Test Questions ……..... ….. ….. … T1.
Finding the Absolute Extreme Values of Functions
Study Tips for Analytical Methods Ashok Srinivasan Computer Science, Florida State University Aim: To suggest learning techniques that will help you do.
1 Buffering Strategies in ATM Switches Carey Williamson Department of Computer Science University of Calgary.
DPHEP7 / DASPOS Introduction DPHEP7, March 2013 International Collaboration for Data Preservation and Long Term Analysis in High Energy.
Choosing your topic …you’re really interested in … you’re curious about …you know something - but not everything - about already … that you can realistically.
Event Based Simulation of The Backfilling Algorithm OOP tirgul No
Graciela Perera Department of Computer Science and Information Systems Slide 1 of 18 INTRODUCTION NETWORKING CONCEPTS AND ADMINISTRATION CSIS 3723 Graciela.
This is a GENERIC EXAMPLE of a presentation
Adult Student Match.
scheduling for local-area networks”
4.1 Extreme Values of Functions.
GRASP – Designing Objects with Responsibilities
OPERATING SYSTEMS CS 3502 Fall 2017
Do Now from 1.2a Find the domain of the function algebraically and support your answer graphically. Find the range of the function.
Chapter 21 Training for Performance
Strategic Capacity Management
QoS & Queuing Theory CS352.
02086 Writing Inspirations Aalto University
Intro to Deterministic Analysis
Intro to Deterministic Analysis
Buffer Management in a Switch
Packet Forwarding.
Open intervals of increasing, decreasing & constant functions
Dr. Zhen Jiang Computer Science Department West Chester University
CONGESTION CONTROL.
Professor Arne Thesen, University of Wisconsin-Madison
The mileage of a certain car can be approximated by:
Intro to Deterministic Analysis
Computer Science Division
Performance Evaluation of Computer Networks
Packet #17 Absolute Extrema and the Extreme Value Theorem
More Properties of Functions
© J. Liebeherr, All rights reserved, 2018
Working in Groups.
Thanks to D. Iamratanakul and J. Yoo for slides
Parent - Teacher Meetings As easy as A-B-C
Speaker Profile Speaker name and short bio (bullet points)
ECE 352 Digital System Fundamentals
Speaker Profile Speaker name and short bio (bullet points)
Performance Evaluation of Computer Networks
Lightweight but Powerful QoS Solution for Embedded Systems
ELEC-E3260 Biomolecules L Course opening lecture
This is a GENERIC EXAMPLE of a presentation
EECS 122: Introduction to Computer Networks Packet Scheduling and QoS
Correlations and practicals
PRESENTATION TITLE (edit)
Leonie Ahrendts, Sophie Quinton, Thomas Boroske, Rolf Ernst
An Optimal Lower Bound for Buffer Management in Multi-Queue Switches
PRESENTATION TITLE (edit) Speaker name (edit) Organisation (edit)
Duality of Min-Plus and Max-Plus Network Calculus
Getting Ready For This Course
کنترل جریان امیدرضا معروضی.
Speaker Profile Speaker name and short bio (bullet points)
Speaker Profile Speaker name and short bio (bullet points)
PRESENTATION TITLE (edit) Speaker name (edit) Organisation (edit)
Presentation transcript:

Real-Time Calculus (RTC) Reading Group I Nan Guan 2013.3.7

About the Reading Group Thursday 18:00~20:00 For schedule see http://faculty.neu.edu.cn/ise/guannan/rtc/ Each time, decide the speaker for the session after the next one Every attendance holds a session Sooner or later …

About the Reading Group The speaker may use White board Slides … Other attendance should preview the topic Important This is an intensive “course”

About the Reading Group Any people can ask any question during the session, but Please don’t significantly postpone the progress (Offline discussions on details are encouraged) Each session takes up to 2 hours It can be as short as the speaker wants (as long as the speaker makes everything clear)

About the Reading Group Share with others if you have good ideas or you are doing something relevant I have some potential research topics Talk to me (or Mingsong) if you have interests

No Title “How long does it at most take to walk from your home to this building?”

No Title Approach 1: Try it for, say, 100 times, measure the time for each time, and find the maximum Cons? Pros?

No Title Approach 2: Lookup the absolute distance between Estimate the walking speed

No Title Approach 2: Lookup the absolute distance between Estimate the walking speed We know physics! T = S / V

No Title Approach 3: Lookup the route distance between Estimate the walking speed Consider the traffic, the weather … …

No Title Approach 3: Lookup the route distance between Estimate the walking speed Consider the traffic, the weather … … How to calculate? T = S’ / (V – x) X: slowdown due to traffic, weather, …

No Title Approach 4: Approach 5: Approach 6: Approach 7: …

No Title Approach 1: Try 100 times Approach 2: T = S / V Experimental approach Approach 2: T = S / V Approach 3: T = S’ / (V – x) Approach 4: … Approach 5: … Analytical approach

No Title Approach 1: Try 100 times Approach 2: T = S / V Experimental approach Approach 2: T = S / V Approach 3: T = S’ / (V – x) Approach 4: … Approach 5: … Analytical approach Fundamental Principle Refinement

We are talking about things on this level No Title Approach 1: Try 100 times Experimental approach Approach 2: T = S / V Approach 3: T = S’ / (V – x) Approach 4: … Approach 5: … Analytical approach We are talking about things on this level

Real-Time Performance Analysis … … Time Time … … Time Time

Real-Time Performance Analysis Questions: What’s the maximal delay of each event? Will some buffer overflow? … … Time Time … … Time Time

Modeling Inputs/Outputs Inputs Events uncertainty infinity … … Time

Modeling Inputs/Outputs Time domain R(t): the number of arrived events by time t Time … Number Of events Time

Modeling Inputs/Outputs Time domain R(t): the number of arrived events by time t Problem: can’t handle uncertainty and infinity NOT analytical We will come back to this in the future

Arrival Curve RTC uses Time-interval Domain Arrival Curve: α(Δ) = < αu(Δ) , αl(Δ) > αu(Δ): upper bound arrival curve αl(Δ): lower bound arrival curve

Arrival Curve Arrival Curve au al # of packets max: 1 packet min: 0 packets max: 3 packets min: 1 packet max: 2 packets min: 0 packets au al 3 D D D 2 1 D time t 1 2

Arrival Curve Arrival Curve: Exercise: Periodic Events with period=10 Periodic Events with period=10 and jitter=5

Arrival Curve Properties of arrival curve: αu(Δ): sub-additive αl(Δ): super-additive

Arrival Curve Where does an arrival curve come from? From specification: E.g., Periodic Events with period=10 and jitter=5 From trace (or a number of traces): Calculate αu(Δ) and αl(Δ) from R(t)

Arrival Curve Exercise: … Time 1 2 3 4 5 6 7 8 9 10 11 12 13 14

Modeling Resource Examples: Full capacity (dedicated resource) TDMA, e.g., every fourth slot Flexible pattern Time Time

Modeling Resource Time domain C(t): the provided capacity by time t

Modeling Resource Time domain C(t): the provided capacity by time t

Service Curve Service Curve: β(Δ) = < βu(Δ) , βl(Δ) > βu(Δ): upper bound arrival curve βl(Δ): lower bound arrival curve

Service Curve Properties of service curve: βu(Δ): sub-additive βl(Δ): super-additive

Modeling and Analysis with RTC Questions: What’s the maximal delay of each event? Will some buffer overflow? … … Time Time … … Time Time

Modeling and Analysis with RTC Questions: What’s the maximal delay of each event? Will some buffer overflow? service curve output arrival curve arrival curve remaining service curve

Modeling and Analysis with RTC Questions: What’s the maximal delay of each event? Will some buffer overflow?

Modeling and Analysis with RTC Questions: What’s the maximal delay of each event? Will some buffer overflow?

Modeling and Analysis with RTC Different Components

Modeling and Analysis with RTC Calculate the output arrival and remaining service curve Under Fixed-Priority Scheduling