CSE536 - Advanced Operating Systems



Lecture T, Th 3:00 pm - 4:15 pm Tempe - BYAC260
Instructor Sandeep Gupta
Office BY554
Email Sandeep.Gupta@asu.edu
Office Hours TTh 11 am - 12 pm
Teaching Assistant Prajwal Paudyal
Office Hours BYENG 517BB MW 2-3 pm
Email Prajwal.Paudyal@asu.edu


CONTENTS

ANNOUNCEMENTS


COURSE SYLLABUS

COURSE DESCRIPTION
Protection and file systems. Communication, processes, synchronization, naming, fault tolerance, security, data replication, and coherence in distributed systems. Real-time systems.



Course Work and Tentative breakdown of grades

  • Midterm exams 20-25 %
  • Reading assignments and quizzes up to 20 %
  • Class Project 20-25%
  • Homework Assignments 20-25%
  • Final exam 20-25%




PRE-REQUISITE

Graduate students in Computer Engineering or related areas.



TOPICS

Week Date Topic Materials Lecture Notes
1 1/12 Course Introduction
1/14 Overview of course coverage and general OS concepts Unix Time Sharing MapReduce: Simplified Data Processing on Large Clusters MapReduce Book Chapter Lecture Notes
2 1/19 Basic OS Concepts Lecture Notes
1/21 Basics of File OS
File System
Lecture notes
3 1/26 Unix Semantics/File Sharing Semantics
Map Reduce
Lecture notes
1/28 MapReduce Execution Model Lecture notes
4 2/2 NFS Lecture Notes
2/4
NFS continued...
Lecture Notes
5 2/9 NFS continued... Lecture Notes
2/11 GFS Intro
Foundations of Distributed Systems
Lecture Notes
6 2/16 Distributed Systems
Distributed Algorithms / Protocols
Lecture Notes
2/18 Distributed System Theory
Application to GFS
Lecture Notes
7 2/23 Distributed System Theory Quorom Systems
GFS cont.
Lecture Notes
2/25 GFS Architecture Lecture Notes
8 3/1 GFS- Write and Append
Atomicity
Lecture Notes
3/3 Atomicity -continued Lecture Notes
9 3/8 Spring Break
3/10 Spring Break
10 3/15 Atomicity -continued Lecture Notes
3/17 Midterm
11 3/22 Midterm Questions Discussion
3/24
12 3/29 Before or after atomicity Lecture Notes
3/31 Before or after atomicity using Locks Lecture Notes
13 4/5 Internet of Things Lecture Notes
4/7 Concepts for Mobile Computing Lecture Notes
14 4/12
4/14 Tiny OS and Android Lecture Notes
15 4/19 Tiny OS and Android cont.. Lecture Notes
4/21 Energy Aware Computing JouleGuard and Drowsy Power Management Papers Lecture Notes
16 4/26Energy Aware Computing Lecture Notes
4/29


BOOKS

Course textbook
Reference books
POLICY ON CHEATING

Any incidence of cheating in this class will be severely dealt with. This applies to homework assignments, programming assignments, quizzes and tests. The minimum penalty for cheating will be that the student will not obtain any credit for that particular assignment. (This means that if in a test and/or assignment a student is found have cheated, he/she will obtain zero in that test and/or assignment.) For the homework and the programming assignments students may discuss the problems with others, but one is expected to turn in the results of one's own effort (not the results of a friend's efforts). One tends to get very suspicious if two identically wrong results show up in the homework assignment and/or tests. The names of the offenders will be maintained in the departmental files. The repeat offenders may be debarred from the University.









Home | Projects | People | Publications | Courses | Resources | Contact