Objectives

This class will provide an introduction to the analysis of cloud-computing and related systems. We will focus on techniques to specify how to define (a) algorithms that are scalable to big-data applications, and (b) how to analyse the performance of networks that perform these big-data computations, under conditions of fault-free and faulty components.

Administrivia

Class schedule: Wednesday 4-5 (WBG G-02)/Friday 3-4 (WBG G-13)
Midterm exam: week 7        Final exam: TBA

Instructor: Gregory Provan
Office hours: Tuesdays 11-1 (WGB 1-71), but please feel free to email me (g.provan@cs.ucc.ie) for another time.

Textbook: I am drawing material from a range of different texts. Two texts that may be helpful are:

Kishor S. Trivedi, Probability and Statistics with Reliability, Queuing and Computer Science Applications, second edition, John Wiley & Sons, Inc. 2002, ISBN 0-471-33341-7.

Martin L. Shooman, Reliability of Computer Systems and Networks,Fault Tolerance, Analysis, and Design, John Wiley & Sons, Inc., 2002. ISBN 0-471-29342-3.

Online Texts:

The following texts are available free on the web.
Set theory

Clemson Notes

Probability
Utah notes

Graph theory
Chapter 1 of http://users.utu.fi/harju/graphtheory/graphtheory.pdf

Queueing theory

"Queueing Analysis"  William Stallings (this is at an appropriate level for the purposes of the course)

Grading: Your final grade will be assigned based on the following weighting:

• 40% midterm     week 7
  
• 40% final
• 20% continuous assessment
  

Final course results will be posted

Notes: