Kaichen Zhao & Junhan Zhu ECE 750 Course Project PID Control for GPS.

Slides:



Advertisements
Similar presentations
CPU Scheduling.
Advertisements

1 Comnet 2010 Communication Networks Recitation 4 Scheduling & Drop Policies.
Defining activities – Activity list containing activity name, identifier, attributes, and brief description Sequencing activities – determining the dependencies.
An Advance Algorithm for Task Management On Activity Based Costing in Cloud Computing By : Ashutosh Ingole Sumit Chavan Rajesh Singh Sinhgad Institute.
Chapter 5 CPU Scheduling. CPU Scheduling Topics: Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling.
CS 268: Lecture 15/16 (Packet Scheduling) Ion Stoica April 8/10, 2002.
Generalized Processing Sharing (GPS) Is work conserving Is a fluid model Service Guarantee –GPS discipline can provide an end-to-end bounded- delay service.
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.
Service Disciplines for Guaranteed Performance Service Hui Zhang, “Service Disciplines for Guaranteed Performance Service in Packet-Switching Networks,”
CSE 830: Design and Theory of Algorithms
Silberschatz, Galvin and Gagne  Operating System Concepts Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms.
Grid Load Balancing Scheduling Algorithm Based on Statistics Thinking The 9th International Conference for Young Computer Scientists Bin Lu, Hongbin Zhang.
Multiprocessor Real- Time Scheduling Aaron Harris CSE 666 Prof. Ganesan.
Packet Scheduling From Ion Stoica. 2 Packet Scheduling  Decide when and what packet to send on output link -Usually implemented at output interface 1.
 Scheduling  Linux Scheduling  Linux Scheduling Policy  Classification Of Processes In Linux  Linux Scheduling Classes  Process States In Linux.
Dynamic and Decentralized Approaches for Optimal Allocation of Multiple Resources in Virtualized Data Centers Wei Chen, Samuel Hargrove, Heh Miao, Liang.
Simulation of Memory Management Using Paging Mechanism in Operating Systems Tarek M. Sobh and Yanchun Liu Presented by: Bei Wang University of Bridgeport.
Computer Architecture and Operating Systems CS 3230: Operating System Section Lecture OS-3 CPU Scheduling Department of Computer Science and Software Engineering.
Efficient and Scalable Computation of the Energy and Makespan Pareto Front for Heterogeneous Computing Systems Kyle M. Tarplee 1, Ryan Friese 1, Anthony.
Silberschatz, Galvin and Gagne  Operating System Concepts Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms.
Fair Queueing. 2 First-Come-First Served (FIFO) Packets are transmitted in the order of their arrival Advantage: –Very simple to implement Disadvantage:
Silberschatz and Galvin  Operating System Concepts Module 5: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor.
March 29 Scheduling ?. What is Packet Scheduling? Decide when and what packet to send on output link 1 2 Scheduler flow 1 flow 2 flow n Buffer management.
Chapter 5: CPU Scheduling. 5.2 Silberschatz, Galvin and Gagne ©2005 Operating System Concepts Chapter 5: CPU Scheduling Basic Concepts Scheduling Criteria.
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.
Adaptive Feedback Scheduling with LQ Controller for Real Time Control System Chen Xi.
Review: Neural Network Control of Robot Manipulators; Frank L. Lewis; 1996.
Computer Science & Engineering, ASU1/17 Pfair Scheduling of Periodic Tasks with Allocation Constraints on Multiple Processors Deming Liu and Yann-Hang.
Packet Scheduling: SCFQ, STFQ, WF2Q Yongho Seok Contents Review: GPS, PGPS SCFQ( Self-clocked fair queuing ) STFQ( Start time fair queuing ) WF2Q( Worst-case.
Real-Time systems By Dr. Amin Danial Asham.
Process Control Management
CSCI1600: Embedded and Real Time Software Lecture 24: Real Time Scheduling II Steven Reiss, Fall 2015.
Scheduling Determines which packet gets the resource. Enforces resource allocation to each flows. To be “Fair”, scheduling must: –Keep track of how many.
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.
1 Fair Queuing Hamed Khanmirza Principles of Network University of Tehran.
Queue Scheduling Disciplines
NUS.SOC.CS5248 Ooi Wei Tsang 1 Course Matters. NUS.SOC.CS5248 Ooi Wei Tsang 2 Make-Up Lecture This Saturday, 23 October TR7, 1-3pm Topic: “CPU scheduling”
Scheduling for QoS Management. Engineering Internet QoS2 Outline  What is Queue Management and Scheduling?  Goals of scheduling  Fairness (Conservation.
Chapter 4 CPU Scheduling. 2 Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Algorithm Evaluation.
Name : Mamatha J M Seminar guide: Mr. Kemparaju. GRID COMPUTING.
04/02/08 1 Packet Scheduling IT610 Prof. A. Sahoo KReSIT.
Real-Time Operating Systems RTOS For Embedded systems.
CPU SCHEDULING.
Regulating Data Flow in J2EE Application Server
Chapter 6: CPU Scheduling
Module 5: CPU Scheduling
Variations of Weighted Fair Queueing
Scheduling Algorithms in Broad-Band Wireless Networks
3: CPU Scheduling Basic Concepts Scheduling Criteria
Fair Queueing.
Chapter5: CPU Scheduling
CSCI1600: Embedded and Real Time Software
CSCI1600: Embedded and Real Time Software
Chapter 6: CPU Scheduling
CPU scheduling decisions may take place when a process:
Variations of Weighted Fair Queueing
CSCI1600: Embedded and Real Time Software
Uniprocessor scheduling
Operating System , Fall 2000 EA101 W 9:00-10:00 F 9:00-11:00
Implementation and simulation of Scheduling Algorithms in OPNET
Chapter 6: CPU Scheduling
Ch.7 Scheduling Aperiodic and Sporadic Jobs in Priority-Driven Systems
Module 5: CPU Scheduling
Introduction to Packet Scheduling
Chapter 6: CPU Scheduling
Module 5: CPU Scheduling
Fair Queueing.
Introduction to Packet Scheduling
کنترل جریان امیدرضا معروضی.
Presentation transcript:

Kaichen Zhao & Junhan Zhu ECE 750 Course Project PID Control for GPS

Content  Preliminaries3 min  Related Work1 min  Algorithms5 min  Weighted Round Robin  WF 2 Q+  Control Method  Experiments & Analysis 4 min  Conclusion1 min

Preliminaries—PID Control Why do we use PID control:  Model Free  Easy to be calculated in digital system  Proportional  Integral  Derivative

Preliminaries—PID Control

Preliminaries—GPS GPS: Generalized Processor Sharing

Related Works—WRR and WF 2 Q+ Weighted Round RobinWF 2 Q+ -The simplest implementation of GPS. -Each workflow is allocated a time slice to process task in that flow -When the time slice is used up, the server terminate the task and move to next flow -The server will also terminate if there is no task in one workflow though this flow’s time slice hasn’t been used up -More complicated than Round Robin -Choose a task with the earliest finish time to transmit -Still a approximation to GPS -When implementing, need a virtual clock and a table to track the status of each flow

Related Works J.A. Stankovic(Univ. of Vriginia): - Feedback control in task scheduling/WebServer - They introduce the idea of PID control into EDF Tarek Ablelzaher(UIUC): - Control of resource scheduling in complicated (MIMO) system. - Introduce control theory to software and web system Parameswaran Ramanathan(UW-Madison): - Overload management - He mainly proposed a technique for management of processor overloaded in real-time control applications.

Algorithms—Control Method Flow Chart:

Algorithms—Control Method Utilization Calculation:

Algorithms—Control Method Flow Chart:

Algorithms—Control Method Reference Values(Expected Util): If a queue is empty, it will give its band width to other non-empty queues. Errors:

Algorithms—Control Method Controller: W(n)

Implementation Three programs One application

Experiments & Analysis Weighted Round RobinWF 2 Q Control Method Weight Setting Workflow1: 0.1 Workflow2: 0.2 Workflow3: 0.3 Workflow4: 0.4

Experiments & Analysis AlgorithmFlow 1Flow 2Flow 3Flow 4 Ideal Weighted Round Robin WF 2 Q Control Method Utilization Comparison

Experiments & Analysis Weighted Round RobinWF 2 Q Control Method Weight Setting Workflow1: 0.1 Workflow2: 0.2 Workflow3: 0.3 Workflow4: 0.4

Experiments & Analysis AlgorithmFlow 1Flow 2Flow 3Flow 4 Weighted Round Robin WF 2 Q Control Method Average Response Time Comparison

Experiments & Analysis AlgorithmAverage Response Time Variance of Response Time Utilization Error Weighted Round Robin WF 2 Q Control Method Response Time Comparison

Experiments & Analysis AlgorithmFloat point computation number Branch number Parameter size Weighted Round Robin12 * flow number53 * flow number + 2 WF 2 Q14 * flow number83 * flow number + 2 Control Method16 * flow number65 * flow number + 2 Complexity

Future work  We didn’t research in deep to see how PID parameters will influence the performance  Find better problems to be solved by PID control

Summary  We proposed a new method to implement GPS:  Based on the idea of PID control  Make schedule decision according to the error between the real utilization and expected utilization  We did some literature research on related topics:  GPS  Control theory in RTS

Summary  Compared with two other algorithms by writing three programs and one application  Did some analysis and experiments on control method and two classical methods.

Questions If you are interested in our work, you are very welcomed to discuss with us or read our report.