This course will cover the fundamentals of the techniques of modeling and performance evaluation of computer systems. After familiarizing ourselves with the fundamentals like markov chains, birth death processes and queueing theory, we will dig into applications that illustrate the use of these techniques. The applications covered will be from computer systems, computer networking and computer architecture. We will also study computational techniques to complement analytical performance evaluation.
If the description interests you, and you have a reasonable background in probability and statistics (say a B or better grade in an undergraduate course) then you can take this course. There will be small programming assignments, so knowledge of any language like C or java will help. For CS PhD students, this course serves as an area elective, contact me for details.