CSCE 317: Computer Systems Engineering

TTh 1625-1740 SWGN 2A21

Prerequisites: CSCE 212 (Introduction to Computer Architecture) MATH 242 (Elementary Differential Equations), STAT 509 (Statistics for Engineers).

Instructor: Marco Valtorta
Office: Swaeringen 3A55, 777-4641
Office Hours: 1100-1200 MWF

Any student with a documented disability should contact the Office of Student Disability Services at (803)777-6142 to make arrangements for proper accommodations.


Grading and Program Submission Policy

Reference materials:

Mor Harchol-Balter. Performance Modeling and Design of Computer Systems: Queueing Theory in Action. Cambridge University Press, 2013 (ISBN 9781107027503). We will refer to this text as [H] in the course.

The departmental syllabus for the course lists the following four course outcomes. We will concentrate on the third one.

  • take an overall system and lifecycle view of the design and operation of a system,
  • model and evaluate the reliability of system architectures,
  • model and evaluate the performance and dynamic behavior of a system,
  • model and evaluate the economics of cash flows in system design, development, and operation.
  • Lecture Log

    Some assignments are only listed in the lecture log.
    See log for HW1.
    See log for HW2.


    Quiz 1 of 2015-01-20, with answer
    Quiz 2 of 2015-01-22, with answer
    Quiz 3 of 2015-01-27, with answer
    Quiz 4 of 2015-02-03, with answer

    Notes used in 2015-01-13 class
    Introductory slides
    Notes used in 2015-01-15 class
    Notes used in 2015-01-20 class
    Notes used in 2015-01-22 class
    Introduction to Probability
    Notes used in 2015-01-27 class
    Notes used in 2015-01-29 class
    Notes used in 2015-01-03 class
    Notes by Prof. Kishor Trivedi on the exponential distribution, used in the lecture of 2015-02-10.
    Notes by Prof. Kishor Trivedi on expectation, used in the lecture of 2015-02-12.
    Notes used in 2015-01-17 class
    Notes on Ch.5 used in 2015-03-17 and 2015-03-19 classes (updated 2015-03-19)
    Notes on Ch.6 used in 2015-03-24 2015-03-27 classes (updated 2015-03-27)
    Notes on Ch.7 used in 2015-03-26 and 2015-03-31 classes (updated 2015-03-31)
    Notes on Ch.8 used in 2015-03-31, 2015-04-02, 2015-04-07, and 2015-04-09 classes (updated 2015-04-09)
    Notes on Ch.9 used in 2015-04-16 and 2015-04-21 classes (updated 2015-04-21)

    The USC Blackboard has a site for this course.

    Some useful links:

    1. Ivo Adan and Jaques Resing. Queueing Theory. Dated February 28, 2002. Accessed 2015-01-13 (local copy).
    2. Theoretical Computer Science Cheat Sheet, by Steve Seiden (This version has the Escher's knot figure but is otherwise harder to read.)