CprE 458/558: Real-Time Systems (G. Manimaran)1 CprE 458/558: Real-Time Systems Energy-aware QoS packet scheduling.

Slides:



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

1 EE5900 Advanced Embedded System For Smart Infrastructure Energy Efficient Scheduling.
Shi Bai, Weiyi Zhang, Guoliang Xue, Jian Tang, and Chonggang Wang University of Minnesota, AT&T Lab, Arizona State University, Syracuse University, NEC.
Winter 2004 UCSC CMPE252B1 CMPE 257: Wireless and Mobile Networking SET 3f: Medium Access Control Protocols.
A 2 -MAC: An Adaptive, Anycast MAC Protocol for Wireless Sensor Networks Hwee-Xian TAN and Mun Choon CHAN Department of Computer Science, School of Computing.
CprE 458/558: Real-Time Systems (G. Manimaran)1 CprE 458/558: Real-Time Systems Resource Reclaiming (Contd.)
EDA (CS286.5b) Day 10 Scheduling (Intro Branch-and-Bound)
1 CNPA B Nasser S. Abouzakhar Queuing Disciplines Week 8 – Lecture 2 16 th November, 2009.
1 CONGESTION CONTROL. 2 Congestion Control When one part of the subnet (e.g. one or more routers in an area) becomes overloaded, congestion results. Because.
Abhay.K.Parekh and Robert G.Gallager Laboratory for Information and Decision Systems Massachusetts Institute of Technology IEEE INFOCOM 1992.
Courtesy: Nick McKeown, Stanford 1 Intro to Quality of Service Tahir Azim.
CprE 458/558: Real-Time Systems (G. Manimaran)1 CprE 458/558: Real-Time Systems (m, k)-firm tasks and QoS enhancement.
DYNAMIC POWER ALLOCATION AND ROUTING FOR TIME-VARYING WIRELESS NETWORKS Michael J. Neely, Eytan Modiano and Charles E.Rohrs Presented by Ruogu Li Department.
EECB 473 Data Network Architecture and Electronics Lecture 3 Packet Processing Functions.
Recent Progress on a Statistical Network Calculus Jorg Liebeherr Department of Computer Science University of Virginia.
Worst-case Fair Weighted Fair Queueing (WF²Q) by Jon C.R. Bennett & Hui Zhang Presented by Vitali Greenberg.
CS 268: Lecture 15/16 (Packet Scheduling) Ion Stoica April 8/10, 2002.
1 On Handling QoS Traffic in Wireless Sensor Networks 吳勇慶.
Generalized Processing Sharing (GPS) Is work conserving Is a fluid model Service Guarantee –GPS discipline can provide an end-to-end bounded- delay service.
*Sponsored in part by the DARPA IT-MANET Program, NSF OCE Opportunistic Scheduling with Reliability Guarantees in Cognitive Radio Networks Rahul.
Low Power Design for Wireless Sensor Networks Aki Happonen.
Service Disciplines for Guaranteed Performance Service Hui Zhang, “Service Disciplines for Guaranteed Performance Service in Packet-Switching Networks,”
Ncue-csie1 A QoS Guaranteed Multipolling Scheme for Voice Traffic in IEEE Wireless LANs Der-Jiunn Deng 、 Chong-Shuo Fan 、 Chao-Yang Lin Speaker:
Energy-Efficient Rate Scheduling in Wireless Links A Geometric Approach Yashar Ganjali High Performance Networking Group Stanford University
CSc 461/561 CSc 461/561 Multimedia Systems Part C: 3. QoS.
CS144, Stanford University Error in Q3-7. CS144, Stanford University Using longest prefix matching, the IP address will match which entry? a /8.
Real-Time Sensor Networks with Applications in Cyber-Physical Systems Manimaran Govindarasu Dept. of Electrical and Computer Engineering Iowa State University.
1 Energy Efficient Communication in Wireless Sensor Networks Yingyue Xu 8/14/2015.
Packet Scheduling From Ion Stoica. 2 Packet Scheduling  Decide when and what packet to send on output link -Usually implemented at output interface 1.
VOLTAGE SCHEDULING HEURISTIC for REAL-TIME TASK GRAPHS D. Roychowdhury, I. Koren, C. M. Krishna University of Massachusetts, Amherst Y.-H. Lee Arizona.
Distributed Multimedia March 19, Distributed Multimedia What is Distributed Multimedia?  Large quantities of distributed data  Typically streamed.
ParaScale : Exploiting Parametric Timing Analysis for Real-Time Schedulers and Dynamic Voltage Scaling Sibin Mohan 1 Frank Mueller 1,William Hawkins 2,
CONGESTION CONTROL and RESOURCE ALLOCATION. Definition Resource Allocation : Process by which network elements try to meet the competing demands that.
1 EE5900 Advanced Embedded System For Smart Infrastructure Energy Efficient Scheduling.
Advance Computer Networking L-5 TCP & Routers Acknowledgments: Lecture slides are from the graduate level Computer Networks course thought by Srinivasan.
1 Distributed Energy-Efficient Scheduling for Data-Intensive Applications with Deadline Constraints on Data Grids Cong Liu and Xiao Qin Auburn University.
Fair Queueing. 2 First-Come-First Served (FIFO) Packets are transmitted in the order of their arrival Advantage: –Very simple to implement Disadvantage:
Admission Control and Scheduling for QoS Guarantees for Variable-Bit-Rate Applications on Wireless Channels I-Hong Hou P.R. Kumar University of Illinois,
Covilhã, 30 June Atílio Gameiro Page 1 The information in this document is provided as is and no guarantee or warranty is given that the information is.
Energy-Efficient Monitoring of Extreme Values in Sensor Networks Loo, Kin Kong 10 May, 2007.
Hard Real-Time Scheduling for Low- Energy Using Stochastic Data and DVS Processors Flavius Gruian Department of Computer Science, Lund University Box 118.
CS640: Introduction to Computer Networks Aditya Akella Lecture 20 - Queuing and Basics of QoS.
Nick McKeown Spring 2012 Lecture 2,3 Output Queueing EE384x Packet Switch Architectures.
Overload Prediction Based on Delay in Wireless OFDMA Systems E. O. Lucena, F. R. M. Lima, W. C. Freitas Jr and F. R. P. Cavalcanti Federal University of.
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:
CprE 458/558: Real-Time Systems (G. Manimaran)1 CprE 458/558: Real-Time Systems Real-Time Networks – WAN Packet Scheduling.
Scheduling Determines which packet gets the resource. Enforces resource allocation to each flows. To be “Fair”, scheduling must: –Keep track of how many.
CprE 458/558: Real-Time Systems (G. Manimaran)1 Energy Aware Real Time Systems - Scheduling algorithms Acknowledgement: G. Sudha Anil Kumar Real Time Computing.
1 Fair Queuing Hamed Khanmirza Principles of Network University of Tehran.
Workload Clustering for Increasing Energy Savings on Embedded MPSoCs S. H. K. Narayanan, O. Ozturk, M. Kandemir, M. Karakoy.
Queue Scheduling Disciplines
A Theory of QoS for Wireless I-Hong Hou Vivek Borkar P.R. Kumar University of Illinois, Urbana-Champaign.
Toward Reliable and Efficient Reporting in Wireless Sensor Networks Authors: Fatma Bouabdallah Nizar Bouabdallah Raouf Boutaba.
Providing QoS in IP Networks
Scheduling for QoS Management. Engineering Internet QoS2 Outline  What is Queue Management and Scheduling?  Goals of scheduling  Fairness (Conservation.
CS Spring 2011 CS 414 – Multimedia Systems Design Lecture 17 – Multimedia Transport Subsystem (Part 3) Klara Nahrstedt Spring 2011.
Distributed Process Scheduling- Real Time Scheduling Csc8320(Fall 2013)
04/02/08 1 Packet Scheduling IT610 Prof. A. Sahoo KReSIT.
QoS & Queuing Theory CS352.
Topics discussed in this section:
Lottery Scheduling Ish Baid.
CprE 458/558: Real-Time Systems
CprE 458/558: Real-Time Systems
Variations of Weighted Fair Queueing
Fair Queueing.
Throughput-Optimal Broadcast in Dynamic Wireless Networks
Variations of Weighted Fair Queueing
Research Topics Embedded, Real-time, Sensor Systems Frank Mueller moss
Fair Queueing.
کنترل جریان امیدرضا معروضی.
Presentation transcript:

CprE 458/558: Real-Time Systems (G. Manimaran)1 CprE 458/558: Real-Time Systems Energy-aware QoS packet scheduling

CprE 458/558: Real-Time Systems (G. Manimaran)2 Overview Motivation Key hardware techniques for energy savings Energy-aware weighted fair queuing Energy-aware real-time packet scheduling

CprE 458/558: Real-Time Systems (G. Manimaran)3 Motivation QoS / Real-time guarantees Energy Consumption

CprE 458/558: Real-Time Systems (G. Manimaran)4 Key hardware techniques Dynamic Voltage Scaling (DVS) for processor energy savings –Dynamically vary the operating voltage & frequency of the processor to reduce energy consumption Dynamic Modulation Scaling (DMS) for wireless radio energy savings

CprE 458/558: Real-Time Systems (G. Manimaran)5 Dynamic Voltage Scaling Energy consumption of task with “cc” number of computation cycles operated at a voltage V and a corresponding frequency “f” is given by –E = CC * V 2 = CC * F 2 Time taken to complete the task is given by –T = CC / F Therefore we can run a task at a lower frequency and reduce energy consumption. However, you will need relatively more time to complete the task.

CprE 458/558: Real-Time Systems (G. Manimaran)6 Dynamic Modulation Scaling (DMS) The energy consumption of the radio in transmitting a bit at a modulation level “b” is given by: The transmission time a bit at a modulation level “b” (number of bits per symbol) is given by: Where R s is the number of symbols sent over the channel per sec.

CprE 458/558: Real-Time Systems (G. Manimaran)7 DMS: Energy-Delay tradeoffs

CprE 458/558: Real-Time Systems (G. Manimaran)8 Problem - 1 To assign modulation levels to the incoming traffic flows while guaranteeing delay bounds within the WFQ framework.

CprE 458/558: Real-Time Systems (G. Manimaran)9 E 2 WFQ scheduler

CprE 458/558: Real-Time Systems (G. Manimaran)10 The WFQ scheduler bounds Traffic flow model: Leaky bucket regulated flow If a flow A i (σ i, λ i ) is guaranteed a rate of g i, then the maximum delay D i under GPS is given by –D i ≤ σ i / g i The maximum delay D i under WFQ is given by –D i ≤ σ i / g i + L max / C –where L max is the maximum packet size –Where C is the link capacity

CprE 458/558: Real-Time Systems (G. Manimaran)11 Important Observation λ i, the input rate of an input stream is much lower than its guaranteed rate g i Therefore, operating at the link transmission at the instantaneous rate will result in energy savings

CprE 458/558: Real-Time Systems (G. Manimaran)12 E 2 WFQ scheduler: basic idea Monitor the instantaneous input rate Adapt the transmission rate to the input rate subject to the delay constraints

CprE 458/558: Real-Time Systems (G. Manimaran)13 Monitoring the input rate Instantaneous queue size (number of packets) is a good indicator of the instantaneous input arrival rate If input rate is greater than the output rate the queue size increases On the other hand, if the input rate is lesser than the output rate the queue size decreases –This where we can apply DMS to reduce energy consumption

CprE 458/558: Real-Time Systems (G. Manimaran)14 A typical inflow rate profile Peak rate Guaranteed rate (g i ) Average rate (λ i ) time Rate

CprE 458/558: Real-Time Systems (G. Manimaran)15 Delay constraints Let ∆ be the desired time from the packet’s arrival at the end of the queue to its departure from the head of the queue Let there be “m” packets (P 1, P 2 … P m ) in the queue arrived at times (A 1, A 2 … A m ) respectively. Let, A m = T = current time and further assume each packet of low “i” is of size L i PmPm PkPk P1P1 What should be the output rate ( r i,k ) of the flow “i” to guarantee the ∆ delay constraint to a packet P k ? K * L i

CprE 458/558: Real-Time Systems (G. Manimaran)16 The instantaneous output rate Maximum of the output rates required by all the queued packets Guaranteed rate The output rate R out,i for a particular flow “i” The total output rate of the link

CprE 458/558: Real-Time Systems (G. Manimaran)17 The instantaneous modulation level The modulation level for the link with a capacity “C” is given by

CprE 458/558: Real-Time Systems (G. Manimaran)18 Maximum delay expressions Theorem: The maximum packet of delay of stream “i”, under the E 2 WFQ scheme is given by:

CprE 458/558: Real-Time Systems (G. Manimaran)19 Energy aware real-time packet scheduling Sensor nodes send real-time (periodic) multimedia streams to the aggregation node G.

CprE 458/558: Real-Time Systems (G. Manimaran)20 Problem Assign modulation levels to each of the packets to reduce energy consumption subject to the real-time deadline constraints. This is very similar to the DVS scheduling of periodic tasks at the processor. Unlike the tasks on a processor, the messages on the communication link cannot be pre- empted.

CprE 458/558: Real-Time Systems (G. Manimaran)21 The Real-Time DMS packet Scheduler RT-DMS Scheduler Admission Controller Periodic RT Messages

CprE 458/558: Real-Time Systems (G. Manimaran)22 Admission test The following time completion test is employed for admission of periodic streams

CprE 458/558: Real-Time Systems (G. Manimaran)23 Static DMS Assuming maximum packet size for all the admitted packets, find the least modulation level which ensures all the deadlines This can be accomplished an iterative approach trying each modulation level for all the packets

CprE 458/558: Real-Time Systems (G. Manimaran)24 Dynamic DMS The packet sizes exhibit variations, the exact packet size is known before the transmission. The idea behind dynamic DMS is to reduce the modulation level of a smaller packet so that it takes as much time as the maximum sized packet would have taken

CprE 458/558: Real-Time Systems (G. Manimaran)25 Stretch DMS If the finish time of the current packet transmission and the arrival time of the next packet transmission are unequal. Some amount of slack will be left unused or the link will idling during that slack. We can further reduce the modulation level to exploit the entire slack.

CprE 458/558: Real-Time Systems (G. Manimaran)26 RT-DMS example with 3 periodic streams No DMS Static DMS Dynamic DMS Run-time Stretch DMS

CprE 458/558: Real-Time Systems (G. Manimaran)27 Some References [1] V. Raghunathan et al, “E 2 WFQ: An energy efficient fair scheduling policy for wireless systems”, ISPLED [2] C. Schurgers et al., “Modulation scaling for real-time energy aware packet scheduling”, GLOBECOM’ 2001.

CprE 458/558: Real-Time Systems (G. Manimaran)28 Thank You!!