Problem 17: “Greedy Shapers” T3 T4 CPU2 T1 T2 CPU1 S Stream S1: P = 100 J = 1000 D = 1 Stream S2: P = 10 J = 10 D = 1 Stream S3: P = 10 J = 0 D = 0 Stream.

Slides:



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

Lecture 12 Z80 Interrupt 동국대학교 홍유표 1. Y. Hong & E. Lee Polling vs. Interrupt Polling : Periodically check if an event occurs Interrupt : Event sends a.
A FreeBSD-based prototype of a Time-Driven Priority router Mario Baldi Guido Marchetto Politecnico di Torino Istituto Superiore Mario Boella.
THE SYSTEM THEORY OF NETWORK CALCULUS J.-Y. Le Boudec EPFL WoNeCa, 2012 Mars 21 1.
Timing Analysis Predicated on a topological ordering. l 1 = 1 level: l 2 = 1 x y x y z z c s g1g1 g4g4 g3g3 g2g2 g5g5 l 3 = 2 l 5 = 2 l 4 = 3.
EECB 473 Data Network Architecture and Electronics Lecture 3 Packet Processing Functions.
Priority Scheduling and Buffer Management for ATM Traffic Shaping Authors: Todd Lizambri, Fernando Duran and Shukri Wakid Present: Hongming Wu.
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.
Networks: Switching1 Point-to-Point Network Switching.
Networks: Switching1 Point-to-Point Network Switching.
Institut für Datentechnik und Kommunikationetze Analysis of Shared Coprocessor Accesses in MPSoCs Overview Bologna, Simon Schliecker Matthias.
1 of 14 1/15 Schedulability Analysis and Optimization for the Synthesis of Multi-Cluster Distributed Embedded Systems Paul Pop, Petru Eles, Zebo Peng Embedded.
EE166 Final Presentation Patsapol Kriausakul Sung Min Park Dennis Won Howard Yuan.
Compositional Verification of Timed Systems. A Concept. Bengt Jonsson Leonid Mokrushin Xiaochun Shi Wang Yi Uppsala University Sweden Distributed Embedded.
1 of 16 March 30, 2000 Bus Access Optimization for Distributed Embedded Systems Based on Schedulability Analysis Paul Pop, Petru Eles, Zebo Peng Department.
October 5th, 2005 Jitter Regulation for Multiple Streams David Hay and Gabriel Scalosub Technion, Israel.
Socket Programming A review By Snehal Kale. What is a socket? An End Point of a 2-way Communication Link Used in Client – Server Communication Bound to.
Mahapatra-A&M-Sprong'021 Co-design Finite State Machines Many slides of this lecture are borrowed from Margarida Jacome.
Adaptive Rate Control for Streaming Stored Fine- Grained Scalable Video Philippe de Cuetos, Keith W. Ross NOSSDAV 2002, May 12-14,2002.
1 ATC AVC MC Relationship Between Average and Marginal Costs Costs per unit Quantity Q1Q1 B Q0Q0 A.
Improve Run Generation Overlap input,output, and internal CPU work. Reduce the number of runs (equivalently, increase average run length). DISK MEMORY.
Receiver-Driven Bandwidth Sharing for TCP and its Application to Video Streaming Puneet Mehra, Christophe De Vleeschouwer, and Avideh Zakhor IEEE Transactions.
Hardware.  Learn what hardware is  Learn different input and output devices  Learn what the CPU is.
I/O bound Jobs Multiple processes accessing the same disc leads to competition for the position of the read head. A multi -threaded process can stream.
An Integrated IP Packet Shaper and Scheduler for Edge Routers MSEE Project Presentation Student: Yuqing Deng Advisor: Dr. Belle Wei Spring 2002.
QoS Support in High-Speed, Wormhole Routing Networks Mario Gerla, B. Kannan, Bruce Kwan, Prasasth Palanti,Simon Walton.
Data and Computer Communications Chapter 10 – Circuit Switching and Packet Switching (Wide Area Networks)
CSIS 3510 Dr. Hoganson Bus Construction CSIS 3510 Computer Organization and Architecture Bus construction alternatives Bus control issues Bus arbitration.
Mahapatra-A&M-Fall'001 Co-design Finite State Machines Many slides of this lecture are borrowed from Margarida Jacome.
How computers work The CPU & Memory. The parts of a computer.
Advisor: Resource Selection 11/15/2007 Nick Trebon University of Chicago.
Financial Planning for the Age Group years.
Math – What is a Function? 1. 2 input output function.
Scalable Video Coding and Transport Over Broad-band wireless networks Authors: D. Wu, Y. Hou, and Y.-Q. Zhang Source: Proceedings of the IEEE, Volume:
Streaming XPath Engine Oleg Slezberg Amruta Joshi.
T T Population Sample Size Calculations Purpose Allows the analyst to analyze the sample size necessary to conduct "statistically significant"
Tri state Buffers. Tri state buffer I/PO/P Strobe.
Fall 2004EE 3563 Digital Systems Design EE 3563 Encoders  When a device’s output has few bits than the input, it is usually called an “encoder”  It essentially.
Lecture 12 Page 1 CS 111 Online Using Devices and Their Drivers Practical use issues Achieving good performance in driver use.
1 Buffering Strategies in ATM Switches Carey Williamson Department of Computer Science University of Calgary.
Animating the Canvas Animation is achieved with the following: 1.Clear the area that is changing context.clearRect(x, y, width, height); 2.Save the canvas.
AND Gate Inputs Output Input A (Switch) Input B (Switch) Output Y (Lamp) 0 (Open) 0 (OFF) A B Lamp.
Darwin 03/26/02IEEE RAH Harry Peng
Competitive Queueing Policies for QoS Switches Nir Andelman Yishay Mansour An Zhu TAUTAUStanford.
CS Spring 2011 CS 414 – Multimedia Systems Design Lecture 17 – Multimedia Transport Subsystem (Part 3) Klara Nahrstedt Spring 2011.
Introduction to S S Family Memory Management.
Business Process Modelling
Elements of a successful goal… SMART
Pipelining Example Cycle 1 b[0] b[1] b[2] + +
Tips Need to Consider When Organizing a College Event
Gates vs. Windows and Scheduled Traffic
Notes Over 2.1 Function {- 3, - 1, 1, 2 } { 0, 2, 5 }
Processor Management Damian Gordon.
شاخصهای عملکردی بیمارستان
What Shapes Can You See in this Picture?
برنامه ریزی عملیاتی 1388 دکتر محسن ميرزايي.
Cause and Effect Graphing
مدل زنجیره ای در برنامه های سلامت
ماجستير إدارة المعارض من بريطانيا
فرق بین خوب وعالی فقط اندکی تلاش بیشتر است
Function Notation “f of x” Input = x Output = f(x) = y.
Token Bucket.
Transp Course 2014 Overview.
Evaluating Logarithms
Exponential and Logarithmic Forms
Objective- To graph a relationship in a table.
GregWroblicky_script_Part01.py Source Datasets.
Processor Management Damian Gordon.
DetNet Bounded Latency-01
Arithmatic Logic Unit (ALU). ALU Input Data :  A0-A3  B0-B3 Output Data :  F0 – F3.
Presentation transcript:

Problem 17: “Greedy Shapers” T3 T4 CPU2 T1 T2 CPU1 S Stream S1: P = 100 J = 1000 D = 1 Stream S2: P = 10 J = 10 D = 1 Stream S3: P = 10 J = 0 D = 0 Stream S2 after output shaping: P = 10 J = 10 D = 1 WCED = 5 Priority = high WCED = 1 Priority = low WCED = 5 Priority = high WCED = 2 Priority = low Greedy Shaper

Analysis Questions: End-to-end Delay of S2 End-to-end Delay of S3 Buffer requirement on CPU1 (T1, T2 and S use shared buffer) Buffer requirement on CPU2 (T3 and T4 use shared buffer)

Greedy Shapers A greedy shaper ensures that the stream on its output is bounded by a predefined stream specification. To achieve this shaping, a greedy shaper delays events of an input event stream as long as needed, but as short as soon a possible.