ECE 541
ECE 541 - Computer Systems Analysis
Fall 2018
Title | Rubric | Section | CRN | Type | Hours | Times | Days | Location | Instructor |
---|---|---|---|---|---|---|---|---|---|
Computer Systems Analysis | CS541 | B | 35921 | LCD | 4 | 0930 - 1045 | T R | 2013 Electrical & Computer Eng Bldg | Mohammad Noureddine |
Computer Systems Analysis | ECE541 | B | 35928 | LCD | 4 | 0930 - 1045 | T R | 2013 Electrical & Computer Eng Bldg | Mohammad Noureddine |
See full schedule from Course Explorer
Official Description
Development of analytical models of computer systems and application of such models to performance evaluation: scheduling policies, paging algorithms, multiprogrammed resource management, and queuing theory. Course Information: Same as CS 541. Prerequisite: One of ECE 313, MATH 461, MATH 463.
Subject Area
- Reliable and Secure Systems
Course Director
Description
Development of analytical models of computer systems and application of such models to performance evaluation; topics include scheduling policies, paging algorithms, multiprogrammed resource management, and queuing theory.
Notes
Same as CS 541 and CSE 524.
Topics
- Review of basic probability and statistics
- The theory of discrete and continuous time Markov chains; applications to memory bandwidth analysis and paging algorithm evaluation
- Probabilistic and deterministic policies for processor scheduling in batch and time-shared systems
- Multiprogrammed memory management: optimal and heuristic allocation and replacement algorithmsthe diffusion approximation in queueing theory
- Queueing theory: exact and approximate techniques for the analysis of single queues and networks of queues; product-form solutions and computational algorithms; the diffusion approximation in queueing theory
- Simulation theory and methodology; simulation languages and the construction of simulators; design of a simulation experiment; analysis of the simulation output: deriviation of point and interval extimates; variance reduction techniques; generation of uniform and non-uniform pseudo-random numbers
Detailed Description and Outline
Topics:
- Review of basic probability and statistics
- The theory of discrete and continuous time Markov chains; applications to memory bandwidth analysis and paging algorithm evaluation
- Probabilistic and deterministic policies for processor scheduling in batch and time-shared systems
- Multiprogrammed memory management: optimal and heuristic allocation and replacement algorithmsthe diffusion approximation in queueing theory
- Queueing theory: exact and approximate techniques for the analysis of single queues and networks of queues; product-form solutions and computational algorithms; the diffusion approximation in queueing theory
- Simulation theory and methodology; simulation languages and the construction of simulators; design of a simulation experiment; analysis of the simulation output: deriviation of point and interval extimates; variance reduction techniques; generation of uniform and non-uniform pseudo-random numbers
Same as CS 541 and CSE 524.
Texts
H. Kobayashi, Modeling and Analysis: An Introduction to System Performance Evaluation Methodology, Addison-Wesley, 1978.
Last updated
9/4/2014