## CSC/ECE 579 — Introduction to Computer Performance Modeling

## Spring 2017 Schedule of Lectures

Date | Lecture # | Topic | Assignment | Due |
---|---|---|---|---|

Jan 9 | — | No class due to snow | ||

Jan 11 | 1 | Overview, goals, logistics (pdf) | ||

Jan 16 | — | No class (MLK Holiday) | ||

Jan 18 | 2 | Introduction (pdf) | HW 1 (pdf) | |

Jan 23 | 3 |
Review of probability theory (pdf) Text: Appendix II.1-II.3 |
||

Jan 25 | 4 | Review of probability theory (cont'd) | ||

Jan 30 | 5 |
Review of Laplace and z transforms (pdf) Text: Appendix I |
Project 1 (pdf) | |

Feb 1 | 6 | Introduction to simulation (pdf) | HW 2 (pdf) | HW 1 solutions (pdf) |

Feb 6 | 7 |
Introduction to simulation (cont'd) Random number generation (pdf) |
||

Feb 8 | 8 | Random number generation (cont'd) | ||

Feb 13 | 9 |
Discussion of Project 1 Simulation design (pdf) |
||

Feb 15 | 10 | Estimation techniques (pdf) | ||

Feb 20 | 11 | Estimation techniques (cont'd) | HW 2 solutions (pdf) | |

Feb 22 | 12 |
Poisson process (pdf)
Text: pp. 60-71 |
||

Feb 27 | 13 |
Markov processes
(pdf)
Text: 2.4 |
Project 2 (pdf) | Project 1 |

Mar 1 | 14 |
Birth-death processes, Birth-death queueing systems Text: 2.5 Discussion of sample exam problems (pdf) |
||

Mar 6 | — | No class (spring break) | ||

Mar 8 | — | No class (spring break) | ||

Mar 13 | — | Midterm exam | ||

Mar 15 | 15 |
Discussion of midterm exam Discussion of Project 2 |
HW 3 (pdf) | |

Mar 20 | 16 |
Little's law
(pdf)
M/M/1 queueing system (pdf) Text: 2.1, 3.1, 3.2 |
||

Mar 22 | — | No class, instructor out of town | ||

Mar 27 | 17 | M/M/1 queueing system (cont'd) | Project 3 (pdf) | Project 2 |

Mar 29 | 18 |
Simple Markovian queueing systems
(pdf)
Text: 3.3-3.6 |
||

Apr 3 | 19 | Simple Markovian queueing systems (cont'd) | ||

Apr 5 | 20 | HW 4 (pdf) | HW 3 solutions (pdf) | |

Apr 10 | 21 | |||

Apr 12 | 22 | |||

Apr 17 | 23 | |||

Apr 19 | 24 | |||

Apr 24 | 25 | HW 4 solutions (pdf) | ||

Apr 26 | 26 | Project 3 | ||

May 8 | — | Final exam |

## Syllabus

### Prerequisites

Students who wish to take this course must have completed a course on Probability Theory (MA 421 or equivalent) and a course on Computer Organization (CSC 312 or ECE 218 or equivalent).

Students must also have good working knowledge of a high-level programming language such as C, C++, or JAVA. The programming projects can be challenging, hence good programming experience is required.

### Objectives

The purpose of this course is to present simulation techniques and queueing theory as tools for modeling and studying the performance of communication networks and computer systems.

At the conclusion of the course you should be able to:

- apply simulation techniques to develop models of computer and communication systems;
- appy queueing-based models to characterize computer and communication systems;
- use appropriate analytic tools to compute performance measure of interest (e.g., response time and throughput) for a given queueing system;
- select the system characteristics (e.g., storage capacity) to achieve a given level of performance;
- evaluate the relative merits of alternative system design solutions; and
- engage in research in the field of performance analysis and evaluation.

I encourage and expect you to participate actively in the learning process. In particular, I welcome your comments and questions as we cover material in class. One-way lectures quickly become boring, both for you and for me. By asking lots of questions your understanding of the material will be deepened significantly, and the course will be much more fun!

### Outline

The course is logically divided in three parts.

**Part I: Refresher.**

At the beginning of the semester we will review important concepts from probability theory and Laplace and z transforms.

**Part II: Simulation Techniques.**

This part addresses the development of simulation models, including:

- generation of random numbers and stochastic variates
- simulation designs
- estimation techniques for analyzing endogenously created data
- validation

**Part III: Queueing Theory.**

This part introduces a number of fundamental concepts and techniques,
including:

- stochastic processes and Markov processes
- Poisson process
- birth-death processes
- the M/M/1 queue and variants
- Erlang and Coxian distributions as models of service time
- the M/G/1 queue
- priority queueing and conservation laws

### Textbook

Students are required to purchase the following textbook:

- L. Kleinrock, Queueing Systems, vol. 1: Theory, Wiley. ISBN: 0-471-49110-1

I also suggest the following two books as reference:

- L. Kleinrock, Queueing Systems, vol. 2: Computer Applications, Wiley
- W. Drake, Fundamentals of Applied Probability Theory, McGraw-Hiil (or any other book on probability theory and transforms)

I will also make available an extensive set of lecture slides.

### Grading

Students are required to complete all assignments and show all work in order to receive full credit. The final grade will be determined using the following weights:

- 45% — Three programming projects (15% each)
- 15% — Homework assignments (of equal weight)
- 20% — Midterm exam (open book)
- 20% — Final exam (comprehensive, open book)

### Policies

**Attendance:**
Attendance is not mandatory but strongly encouraged.
Students are responsible for making up any course material they miss.

**Assignments:**
No hard copies of assignments or solutions will be handed out.
New assignments and solutions will be announced in class and/or the course
mailing list, and will be available on the course web page.

**Submission:**
Students must submit their assignments as PDF or Word files using the
*submit* facility.
The deadline for submission is midnight (Eastern time) on the day due.
Any deadline extensions are up to the discretion of the instructor,
and will be announced to the whole class.
Extensions may be provided to individual students only in advance of
the submission deadline and only under extenuating circumstances.

**Late Submission:**
No late assignments will be accepted and no partial credit will be
given for late assignments without a valid excuse.

**Cheating:**
Homework and projects are individual assignments and students are
required to submit their own solutions.
All students are bound by the University's academic integrity policies
(refer to the relevant section below).

### Teaching Assistant

Lingnan Gao (glingna@ncsu.edu) is the TA for this course.

His office hours are: Tuesdays and Thursdays from 4:15-5:15pm in Room 1229B of the EB2 building. Alternatively, you may contact him to arrange for an online chat or video call at a mutually convenient time.

Feel free to contact the TA for any questions about the course.

### Office Hours

My office is in Room 2306 of the EB II building.

My office hours are 4:15-5:15pm on Mondays and Wednesdays. Distance students may either call me during those times, or may arrange to stop by or call at a different mutually convenient time.

### Academic Integrity

Students are required to respect the NC State academic integrity policies.