ELE 549 Computer System Modeling. Bin Li Dept. of Electrical, Computer & Biomedical Engineering University of Rhode Island

Transcription

1 ELE 549 Computer System Modeling Bin Li Dept. of Electrical, Computer & Biomedical Engineering University of Rhode Island

2 Self-introduction Name M.S. or Ph.D. student Research topic and methodology

3 Transportation

4 Airport Security Lines

5 Amusement Parks

6 Common Features Customers experience a long wait Reason??? Limited resources Solutions Add more resources Smart controls (algorithms) Cost vs. Performance

7 Contact Centers

8 Computer Systems: Job Scheduling MATLAB Lecture video Video meeting Visual studio Latex Antivirus security Limit resources: CPU memory, storage space I/O ports

9 Computer Systems: Web Servers client 1 client 2 Get Page Get Video Internet Web Server client 1000 Get Audio

10 Queues Are Indeed Everywhere!

11 Common Features Systems with limited resources Smart scheduling algorithms Cost vs. Performance

12 Internet of Things: Smart Home Limited resources: time, bandwidth, power

13 Cyber-Physical Systems Current intra-vehicular networks 75 sensors and 75 switches Requires 1,000 cables (45kg, 1km) Low fuel efficiency High cost and complexity of maintenance ~3 increases in sensors over 5 years Vehicle Dynamics Control System PAN Coordinator User Applications PAN Coordinator System Control Host PAN Coordinator PAN Coordinator Wireless solution Limited resources: time, bandwidth, power Sensor Unit Sensor Unit Sensor Unit 13

14 Mobile Edge Computing

15 Networking for Virtual/Augmented Reality

16 Big Data Processing Climate Modeling Deep Learning

17 How to Evaluate a System Design? Implementation and testbed/field deployment Pros: high accuracy Cons: Costly, difficult to repair/experiment in-field Simulations Pros: can be accurate, given realistic models; broad applicability Cons: can be slow, don t always provide intuition behind results Analysis Pros: Quick answers, provide insights Cons: can be inaccurate or inapplicable

18 Course Goal Introduction to analytical tools which are needed to construct/analyze models of resource contention systems. Computers Networks It is a course on methodologies PLUS applications

19 Example 1: First-Come-First-Served (FCFS) server Avg. arrival rate l jobs sec FCFS Avg. service rate m jobs sec Condition: λ < μ S: job size (sec) = service requirement Example: o On average, job needs 3x10 6 cycles o Machine executes 9X10 6 cycles/sec E S = 1 μ m 3 jobs sec Avg service rate μ = 3 jobs/sec Avg size of job on this server E S = 1/3 sec

20 Example 1: FCFS server (Cont ) QUESTION: If the arrival rate double, what service rate do you need to maintain the same delays for jobs? Avg. arrival rate 2l jobs sec FCFS Avg. service rate? jobs sec (a)2µ (b)less than 2µ (c)more than m 32µ jobs sec

21 Example 2: Many slow or 1 fast? m l jobs sec m l jobs sec km l km m vs. l km QUESTION: Which is better for minimizing E[T]? 21

22 Example 3: Job Scheduling l jobs sec m jobs sec FCFS (First-Come-First-Served, non-preemptive) PS (Processor-Sharing, preemptive) SJF (Shortest-Job-First, non-preemptive) SRPT (Shortest-Remaining-Processing-Time, preemptive) LAS (Least-Attained-Service-First, preemptive) QUESTION: Which scheduling policy is best for minimizing E[T]?

23 Example 4: Dynamic Load Balancing Examples: F5 Big-IP Microsoft SharePoint Cisco Local Director Coyote Point Equalizer IBM Network Dispatcher Response time, T Dispatcher QUESTION: What is a good dispatching policy for minimizing E[T]? 23

24 Example 4: Dynamic Load Balancing (Cont ) Round-Robin Response time, T Join-Shortest-Queue Dispatcher Least-Work-Left 24

25 Time-Varying Arrivals Call center Web servers

26 Course Outline The formulation & analysis of these models relies on Stochastic processes Queueing theory Statistics Scheduling Optimization Game theory Control theory Machine learning.

27 Textbook Mor Harchol-Balter, Performance Modeling and Design of Computer Systems: Queueing Theory in Action, Cambridge University Press, 2014.

28 Other References R. Srikant and L. Ying, Communication Networks: An Optimization, Control and Stochastic Networks Perspective, Cambridge University Press, D. Bertsekas and R. Gallagher, Data Networks, Second Edition, Prentice Hall, Leonard Kleinrock, Queueing Systems (Volume 1 & 2), John Wiley & Sons, J. Walrand, Probability in Electrical Engineering and Computer Science, Quorum Books, S. Ross, A First Course in Probability, Ninth Edition, Pearson, S. Ross, Stochastic Processes, Second Edition, Wiley, 1995.

29 Grading Homework: 10% Midterm: 30% Final: 30% Project: 30%