Course Description:
This course is a general overview of operating systems concepts and recent methodologies and techniques used in the field and their trades-off, with various examples from the contemporary used systems. The course covers the basic structure of an operating system, its interaction with the hardware, software, and users, and the services it provide. The course illustrates different algorithms and techniques used in controlling, managing, and allocating various computer resources, such as CPU, memory, storage and I/O devices. It demonstrates the tuning of the operating systems for maximizing the utilization and increasing the performance of computer system.
Text Book: Operating System Concepts, 8th Edition
Authors: A. Silberschatz, P. Galvin, and G. Gagne, Publisher: John Wiley, 2010
Instructor: Dr. Abdullah Basuhail
Email: abasuhail@kau.edu.sa
Grading:
· Term Works 10%
· Project 1 5%
· Project 2 5%
· Exam 1 15%
· Exam 2 15%
· LAB 20%
· Final Exam 30%
Passing grade: 60 out of 100.
Attendance: Student is supposed to attend all classes on time. Absence of more than 25% of classes will result in DN (Denial) grade.
Contents
1 Introduction
1.1 What Operating Systems Do 3
1.2 Computer-System Organization 6
1.3 Computer-System Architecture 12
1.4 Operating-System Structure 18
1.5 Operating-System Operations 20
1.13 Open-Source Operating Systems 37
2 Operating System Structures
2.1 Operating-System Services 45
2.2 User Operating-System Interface 48
2.3 System Calls 50
2.4 Types of System Calls 55
2.5 System Programs 63
2.6 Operating-System Design and Implementation 64
2.7 Operating-System Structure 67
2.9 Operating-System Generation 82
2.10 System Boot 83
3 Processes
3.1 Process Concept 101
3.2 Process Scheduling 105
3.3 Operations on Processes 110
3.4 Interprocess Communication 116
4 Threads
4.1 Overview 153
4.2 Multithreading Models 157
5 CPU Scheduling
5.1 Basic Concepts 183
5.2 Scheduling Criteria 187
5.3 Scheduling Algorithms 188
5.7 Algorithm Evaluation 213
6 Process Synchronization
6.1 Background 225
6.2 The Critical-Section Problem 227
6.3 Peterson’s Solution 229
6.4 Synchronization Hardware 231
6.5 Semaphores 234
6.6 Classic Problems of Synchronization 239
7 Deadlocks
7.1 System Model 283
7.2 Deadlock Characterization 285
7.3 Methods for Handling Deadlocks 290
7.4 Deadlock Prevention 291
8 Main Memory
8.1 Background 315
8.2 Swapping 322
8.3 Contiguous Memory Allocation 324
8.4 Paging 328
8.6 Segmentation 342
9 Virtual Memory
9.1 Background 357
9.2 Demand Paging 361
9.4 Page Replacement 369
9.5 Allocation of Frames 382
9.6 Thrashing 386
10 File-System Interface
10.1 File Concept 421
10.2 Access Methods 430
10.3 Directory and Disk Structure 433
10.4 File-System Mounting 444
10.6 Protection 451
12 Mass-Storage Structure
12.1 Overview of Mass-Storage Structure 505
12.2 Disk Structure 508
12.4 Disk Scheduling 510
12.5 Disk Management 516
12.6 Swap-Space Management 520