Operating System Instructor Court

Name: Syed Hasnain Haider Gilani

Course Code: CS-205
Office No. 212
Email: hasnainhaider@uog edu pk
[email protected]
Lecture # 1 Office hours:
Syed Hasnain Haider Semester: Fall-2010
Department of Computer Science
University of Gujrat

1 2

Introduce yourself Scope of Lecture

• Name • Objectives of this course
• Program :& Semester • Overview Course Outline
• What an operating system Do?
• Expectation from this course
• Computer-System Organization
• Computer-System Architecture
• Computer-System Structure

3 4

Course Outline
Objectives Weak Lecture #. Topic Chapter
No.
1 1 Introduction, What Operating Systems Do, Computer-System Ch.1
Organization, Computer System Architecture, Operating-System
• This is introductory level course Structure,
2 Operating System Operations, Process Management , Memory Ch.1
• We want to know about the basic services Management, Storage Management

of OS 2 3 Operating-System Services, User Operating-System Interface, System

Calls
Ch.2

4 System Calls, Types of System Calls, System Programs, Operating Ch.2

System Design and Implémentation. Operating-System Structure

3 5 How operating system starts? How a C/C++ Program is converted into Ch.2 +
physical Address Space? What are the purpose of Linker & Loader Lecture
program? Slides
6 Process Concept, The Process, Process States, Process Control Block, Ch.3
Thread, Process Scheduling, Scheduling Queues, schedulers, Context
Switch.
4 7 Operations on Processes, Create Process, Process Terminate Ch.3

8 Inter Process Communication, Shared Memory System, Message Passing Ch.3

5 System, Examples of IPC Systems 6
 Course Outline Course Outline
Weak Lecture #. Topic Chapter Weak Lecture #. Topic Chapter
No. No.
5 9 Threads, Overview, Motivation, Benefits, Multithreading Models, Many Ch.4 9 17 Deadlocks, System Model, Deadlock Characterization, Necessary Ch.7
to one model, One to one model, Many to many model Conditions, Resource-Allocation Graph,
10 Thread Libraries, pthread Library, Win32 Threads Library, JAVA Threads Ch.4 18 Methods for Handling Deadlocks, Deadlock Prevention, Deadlock Ch.7
Library Avoidance, Deadlock Detection, Recovery From Deadlock
6 11 Threading Issues, The fork() and exec() System Calls, Thread Ch.4 10 19 Memory Management, main memory, background, basic hardware, Ch.8
cancellation, Signal Handling, Thread Pools, Thread-Specific Data, address binding, logical vs. physical address space, Swapping,
Scheduler Activations Contiguous Memory Allocation, Memory Mapping and Protection,
12 Memory Allocation,
Allocation Fragmentation
CPU Scheduling, Basic concept, CPU-I/O Burst Cycle, CPU Scheduler, Ch.5
Preemptive Scheduling, Dispatcher, Scheduling Criteria, CPU utilization, 20 Paging, Basic Method, Hardware Support, Protection, Shared Pages, Ch.8
Throughput, Turnaround time, Waiting time and Response time Structure of the Page Table, Segmentation, Basic Method, Hardware,
7 13 Scheduling Algorithms, First-Come First-Served, Shortest-Job-First, Ch.5 11 21 Virtual memory, background, Demand Paging, Basic Concepts, Ch.9
Priority, Round-Robin, Multilevel Queue and Multilevel Feedback-Queue Performance of Demand Paging, Page Replacement
Scheduling
22 Page Replacement, Basic Page Replacement, FIFO, Optimal, LRU, Ch.9
14 Process synchronization, Background, The Critical-Section Problem, Ch.6
Peterson's Solution, Synchronization Hardware Second-Chance, Allocation of Frames, Minimum Number of Frames
12 23 Thrashing, Cause of Thrashing, Working-Set Mode, Page-Fault Ch.9
8 15 Semaphores, Usage, Implementation, Deadlocks and Starvation, Classic Ch.6
Problems of Synchronization, The Bounded-Buffer Problem, The Readers Frequency, Memory-Mapped Files, Basic Mechanism.
Writers Problem, Monitors. 24 Other Considerations, Prepaging, Page Size, TLB Reach, Inverted Page Ch.9
16 Mid Term Examination Up to Ch.6 Tables, Program Structure
7 8

Course Outline
Weak Lecture #. Topic Chapter Course Material
No.
13 25 File system interface, file concepts, File Attributes, file operations, File Ch.10
Types, File Structure, internal file structure, Access Methods, Sequential
Access, direct access,
26 Directories, Storage Structure, Directory Overview, Single-Level Ch.10
Directory, Two-Level Directory, Tree-Structured Directories,
TextBook
14 27 File-System implementation, File-System Structure, File-System Ch.11 ¾ Operating System Concepts, 7th Edition by Silberschatz
implementation, overview, Partitions and Mounting, Virtual File Systems
& Galvin.
28 Directory implementation, Linear List, Hash Table, Hash Table, Ch.11
Contiguous Allocation, Linked Allocation, Indexed Allocation,
Performance
15 29 Free-Space Management, Bit Vector, Linked List, Grouping, Counting, Ch.11
Efficiency and Performance.
30 Revise section-1 (solving student problem)

16 31 Revise section-1 (solving students problem)

32 Final Term Examination From Ch.7

to Ch.11 9 10

Grading Policy Guidelines for Students

Marking Weight-age ¾ Quizzes will be un-announced and no quiz will be dropped. You may
Assignments : 10 expect 5-9 quizzes in the semester.
¾ Quizzes may be of different weights based upon actual marks for each
Quizzes :5 quiz.
Presentation :10 ¾ No Retake of missing quiz
Mid Term : 25
Final Term : 50 ¾ Students are strongly advised to:
™ Do the exercises given at the end of chapters of the text book
Attendance:
¾ Students are encouraged to discuss assignments but it is extremely
All students are supposed to attend 100% classes. However 75% important that every student works on his own assignment. The cases of
attendance is mandatory to make you eligible for the final examination. plagiarism will be dealt ruthlessly under the university policy in this regard.
(Zero marks)

11 12
 Important What an operating system Do?
• Computer system components
All course material will be sent through uogisemail (Lecture o Hardware
slides, Assignments and other material). o Application programs
o Operating system
o Users
• The operating
p g system
y provides the means for p
p proper
p use
of these resources in the operation of the computer
system.
• An operating system is similar to a government. Like a
government, it performs no useful function by itself.
• It simply provides an environment within which other
programs can do useful work.

13 14

What an operating system Do? What an operating system Do?

• OS’s View Defining Operating Systems
o User’s View • We have no completely adequate definition of an operating system.
o System View • Operating systems exist because they offer a reasonable way to
solve the problem of creating a usable computing system.
• The fundamental goal of computer systems is to execute user
programs and to make solving user problems easier.

15 16

Computer-System Organization Computer-System Organization

Defining Operating Systems
• Before we can explore the details of how computer systems operate, Computer-System Operation
we need a general knowledge of the structure of a computer system

17 18
 Computer-System Organization Computer-System Organization

Storage Structure How modern computer works?

19 20

Computer-System Architecture Computer System Structure

• Single processor system • Multiprogramming
• Multiprocessor system • Time sharing system
• Clustered processor system • Interactive system

21 22

What we did today?

• Objectives of this course
• Overview Course Outline
• What an operating system Do?
•
•
Computer-System Organization
Computer-System Architecture
Thanks
• Computer-System Structure

23 24