1 The Challenges of Reflexive Control Systems Lui Sha

Slides:



Advertisements
Similar presentations
Feedback Control Theory a Computer Systems Perspective Introduction What is feedback control? Why do computer systems need feedback control? Control design.
Advertisements

Quality of Service CS 457 Presentation Xue Gu Nov 15, 2001.
Computer Networking Lecture 20 – Queue Management and QoS.
Scheduling. Main Points Scheduling policy: what to do next, when there are multiple threads ready to run – Or multiple packets to send, or web requests.
Silberschatz, Galvin and Gagne  2002 Modified for CSCI 399, Royden, Operating System Concepts Operating Systems Lecture 19 Scheduling IV.
Chapter 5 CPU Scheduling. CPU Scheduling Topics: Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling.
SIGMETRICS 2008: Introduction to Control Theory. Abdelzaher, Diao, Hellerstein, Lu, and Zhu. CPU Utilization Control in Distributed Real-Time Systems Chenyang.
Adaptive Sampling for Sensor Networks Ankur Jain ٭ and Edward Y. Chang University of California, Santa Barbara DMSN 2004.
AQM for Congestion Control1 A Study of Active Queue Management for Congestion Control Victor Firoiu Marty Borden.
6/16/20151 On Designing Improved Controllers for AQM Routers Supporting TCP flows By C.V Hollot, Vishal Mishra, Don Towsley and Wei-Bo Gong Presented by.
Chapter 6: CPU Scheduling. 5.2 Silberschatz, Galvin and Gagne ©2005 Operating System Concepts – 7 th Edition, Feb 2, 2005 Chapter 6: CPU Scheduling Basic.
OS Fall ’ 02 Performance Evaluation Operating Systems Fall 2002.
1 Action Breakout Session Anil, AP, Nina Bhatti, Charles Berdnall, Joe Hellerstein, Wei Hu, Anthony Joseph, Randy Katz, Li, Machi Mukund Kimmo Raatikanen,
Silberschatz, Galvin and Gagne  Operating System Concepts Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms.
Feedback performance control in software services T.F. Abdelzaher, J.A. Stankovic, C. Lu, R. Zhang, and Y. Lu, Feedback Performance Control in Software.
1 TCP-LP: A Distributed Algorithm for Low Priority Data Transfer Aleksandar Kuzmanovic, Edward W. Knightly Department of Electrical and Computer Engineering.
Chess Review May 11, 2005 Berkeley, CA Closing the loop around Sensor Networks Bruno Sinopoli Shankar Sastry Dept of Electrical Engineering, UC Berkeley.
1 Lecture 24: Interconnection Networks Topics: communication latency, centralized and decentralized switches (Sections 8.1 – 8.5)
LDU Parametrized Discrete-Time Multivariable MRAC and Application to A Web Cache System Ying Lu, Gang Tao and Tarek Abdelzaher University of Virginia.
OS Fall ’ 02 Performance Evaluation Operating Systems Fall 2002.
UCB Improvements in Core-Stateless Fair Queueing (CSFQ) Ling Huang U.C. Berkeley cml.me.berkeley.edu/~hlion.
Analysis of Simulation Results Andy Wang CIS Computer Systems Performance Analysis.
CS540/TE630 Computer Network Architecture Spring 2009 Tu/Th 10:30am-Noon Sue Moon.
Software Performance Testing Based on Workload Characterization Elaine Weyuker Alberto Avritzer Joe Kondek Danielle Liu AT&T Labs.
Budget-based Control for Interactive Services with Partial Execution 1 Yuxiong He, Zihao Ye, Qiang Fu, Sameh Elnikety Microsoft Research.
Manijeh Keshtgary. Queuing Network: model in which jobs departing from one queue arrive at another queue (or possibly the same queue)  Open and Closed.
1. Performance Guarantees Introduction –by asking sources about flow behavior it is possible to construct networks that could guarantee performance for.
Chapter 101 Multiprocessor and Real- Time Scheduling Chapter 10.
1 Multiprocessor and Real-Time Scheduling Chapter 10 Real-Time scheduling will be covered in SYSC3303.
1 Scheduling The part of the OS that makes the choice of which process to run next is called the scheduler and the algorithm it uses is called the scheduling.
Silberschatz and Galvin  Operating System Concepts Module 5: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor.
1 Chapters 8 Overview of Queuing Analysis. Chapter 8 Overview of Queuing Analysis 2 Projected vs. Actual Response Time.
Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition, Chapter 5: CPU Scheduling.
CS551: End-to-End Packet Dynamics Paxon’99 Christos Papadopoulos (
1 IEEE Meeting July 19, 2006 Raj Jain Modeling of BCN V2.0 Jinjing Jiang and Raj Jain Washington University in Saint Louis Saint Louis, MO
Pending Interest Table Sizing in Named Data Networking Luca Muscariello Orange Labs Networks / IRT SystemX G. Carofiglio (Cisco), M. Gallo, D. Perino (Bell.
Managing Server Energy and Operational Costs Chen, Das, Qin, Sivasubramaniam, Wang, Gautam (Penn State) Sigmetrics 2005.
1 11/29/2015 Chapter 6: CPU Scheduling l Basic Concepts l Scheduling Criteria l Scheduling Algorithms l Multiple-Processor Scheduling l Real-Time Scheduling.
TELE202 Lecture 6 Routing in WAN 1 Lecturer Dr Z. Huang Overview ¥Last Lecture »Packet switching in Wide Area Networks »Source: chapter 10 ¥This Lecture.
Scheduling. Main Points Scheduling policy: what to do next, when there are multiple threads ready to run – Or multiple packets to send, or web requests.
OPERATING SYSTEMS CS 3530 Summer 2014 Systems and Models Chapter 03.
Silberschatz and Galvin  Operating System Concepts Module 5: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor.
1 CS.217 Operating System By Ajarn..Sutapart Sappajak,METC,MSIT Chapter 5 CPU Scheduling Slide 1 Chapter 5 CPU Scheduling.
Copyright ©: Nahrstedt, Angrave, Abdelzaher, Caccamo1 Queueing Systems.
September 28, 2000 Improved Simultaneous Data Reconciliation, Bias Detection and Identification Using Mixed Integer Optimization Methods Presented by:
Providing QoS in IP Networks
Chapter 4 CPU Scheduling. 2 Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Algorithm Evaluation.
Basic Concepts Maximum CPU utilization obtained with multiprogramming
Dynamic Resource Allocation for Shared Data Centers Using Online Measurements By- Abhishek Chandra, Weibo Gong and Prashant Shenoy.
OPERATING SYSTEMS CS 3502 Fall 2017
Action Breakout Session
Self-Tuning Memory Management of A Database System
A Framework for Automatic Resource and Accuracy Management in A Cloud Environment Smita Vijayakumar.
Chapter 6: CPU Scheduling
Chapter 6: CPU Scheduling
CS 143A - Principles of Operating Systems
CPU Scheduling G.Anuradha
Module 5: CPU Scheduling
Reference-Driven Performance Anomaly Identification
3: CPU Scheduling Basic Concepts Scheduling Criteria
Chapter 5: CPU Scheduling
Chapter 6: CPU Scheduling
Multiprocessor and Real-Time Scheduling
Lecture 2 Part 3 CPU Scheduling
Chapter 6: CPU Scheduling
Module 5: CPU Scheduling
Chapter 6: CPU Scheduling
Module 5: CPU Scheduling
Presentation transcript:

1 The Challenges of Reflexive Control Systems Lui Sha

2 Acknowledgement Many have contributed to the collaboration. In particular, I want to thank Xue Liu, Jin Jeo at UIUC, Tarek Abdelzaher at UVA and Joe Hellerstein at IBM Research

3 Web Service Performance Control Web Servers Application ServersEnd Users KeepAlive TImeout Number of Threads MaxClients DB Connections Fast response cache MaxRequestsPerChild ThreadsPerChild Max simultan. requests ListenBackLog URL Cache EJB threads JVM heap size Servlet reload int Courtesy of Joe Hellerstein, IBM Research Network based server systems, e.g., Web servers, have now become an integral part of our society.

4 Overview In a queueing network, service performance control can be viewed as a hierarchical control Setting the performance goal at each node Rout the traffic to the nodes Performance regulation on each node There are many interesting problems. Among them “Noise” is data Event driven control Reflexivity in control

5 Some Interesting Facts Suppose we want to correct a biased coin with Prob(head)= 0.4. We begin by soldering a small weight to the side of head, and then do some experiments and adjust the weight. From a control perspective, the transfer function between the change of weight and the change of probability of head manifests itself clearly only when the sample size becomes large. Fast control actions do not lead to fast convergence Low pass filter, except moving average, won’t work because there is no noise. Event (sample size) based control action yields better results. Fixed sample size control typically has random time intervals

6 Reflexive Control Normal control system: the plant model is invariant to control actions Reflexive control system: the control alters the plant Genetics -> (physique, intelligence) -> mating -> genetics Laws -> control social behaviors -> changes laws Queueing system control is reflexive

7 Reflexivity and Uncertainty Uncertainty principle in measurement. In quantum physics, the act of measurement distorts what we try to observe. “Uncertainty principle” in reflexive control System. The act of control alters the model used to design the controller

8 The Bright Spot One of the worst that can happen in a network of servers is performance failure due to congestions. This turns out to be an easier task Heavy traffic creates long queue Long queue is persistent Low of large number kicks in Allows for fluid approximation Linear model with PI control works well High performance regulation is reflexive. Why?

9 Delay vs Control for M/M/1

10 Keeping the model relevant  D ref “Matching” the measured arrival rate with computed service rate e.g., Let µ= will “lock” the system at the point of linearization Slope = d  /dD ref = - 4

11 Queuing Model Based Control Measured Delay d dd Server Queue Control Request Queueing Model qq   Ref Delay D ref Control of Average Delay

12 Experimental Results Sha, L., Li, X., Lu, Y., and; Abdelzaher, T. “Queueing model based network server performance control”, the proceedings of IEEE Real-Time Systems Symposium, 2002

13 Long Shadow of Reflexivity Alas, there are still considerable variances The queueing model is a function variances in arrival time and service time. Good admission control smooth the input variances Good execution time control smooth the execution time variances Control invalidates queueing model! Feed forward over-allocates when delay turns lower Feed forward under-allocates when delay turns higher

14 Jumps in Loads In addition to over/under allocation in feed forward errors, the jumps in arrival process creates another challenge The queue length from previous traffic load takes time to settle to the new equilibrium queue distribution. Leads to large transients Whatever the sources of errors, large variance in service time correlates with large variances in queue length Adding a control term on (Actual_queue_length – expected_queue_length) Reducing both transients induced by workload changes and variances during steady state

15 Comparison of two delay regulators using web trace Queueing Model Based Feedback Control Queue Length Model Based Feedback Control Steady state feed forward + delay feedback + model based queue control Actuator parameters: K: delay control;  : multiplicative noise control

16 Summary – theoretical problems Heavy traffic not only cures “reflexivity”, it also allows for fixed time interval control works as well as sample size based control upside: simple fixed rate linear model works well downside: the fun is gone Under moderate traffic control, we need to deal with event (sample size) driven control reflexivity queueing model based feed forward helps but the feed forward both over allocate & under allocate Optimized supervisory control for networked server set point adjustments

17 Summary: Engineering Problems Poor observability in actual systems: Many queues and I/O states are not visible and not controllable. Poor actuators: Rejecting individual requests  TCP window adjustment (non-linear, coarse grain actuator in admission control) Hard to do fine grain control in CPU cycle allocation Nearly no control of I/O bandwidth Control OS