CSCE 317: Computer Systems Engineering

TTh 1625-1740 SWGN 2A14

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

Instructor: Marco Valtorta
Office: Swearingen 3A55, 777-4641
E-mail: mgv@cse.sc.edu
Office Hours: 1030-1200 TTh

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

Syllabus

Grading 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

    Homework
    Some assignments are only listed in the lecture log.

    Tests
    Final exam from spring 2015.

    Quizzes
    Quiz 1 of 2017-01-17, with answer
    Quiz 2 of 2017-01-26, with answer
    Quiz 3 of 2017-02-16, with answer

    Lectures
    Introductory slides
    Introduction to Probability
    Notes used in 2017-01-12 class
    Notes for probability review (first part)
    Notes for probability review used in 2017-01-24 class
    More notes for probability review used in 2017-01-24 class
    More notes for probability review used in 2017-01-26 class
    More notes for probability review used in 2017-01-26 class
    More notes for probability review used in 2017-01-31 class
    More notes (on reliability) used in 2017-02-07
    Notes on Ch.4 [H] used in class on 2017-02-21
    Notes on Ch.5 [H] used in class on 2016-02-28
    Notes on Ch.6 [H] used in class on 2017-03-14
    Notes on Ch.7 [H] used in class on 2017-03-23
    Notes on Ch.8 [H] used in class on 2017-04-04
    Notes on Ch.9 [H] used in class on 2017-04-13 and 18
    Notes on Ch.10 [H] used in class on 2017-04-18 and 20

    The USC Blackboard has a site for this course.

    Some useful links:

    1. Ivo Adan and Jaques Resing. Queueing Theory. Dated March 26, 2015. Accessed 2016-01-11 (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.)
    3. Bianca Schroeder, Adam Wierman, and Mor Harchol-Balter. "Open Versus Closed: A Cautionary Tale." Proceedings of the Conference on Networked Systems Design and Implementation (NSDI 2006), San Jose, CA, May 2006, 239-252 (local copy).