Chapter 1: Introduction

What is an Operating System?

Mainframe Systems Desktop Systems

Multiprocessor Systems
Distributed Systems Clustered System Real -Time Systems Handheld Systems Computing Environments

Operating System Concepts

1.1

Silberschatz, Galvin and Gagne 2002

What is an Operating System?

A program that acts as an intermediary between a user

of a computer and the computer hardware.

Operating System Goals

Use the computer resources in an efficient manner.

Make the computer system convenient to use.

Maximize resource utilization. OS is one program that is ALWAYS running on a

computer(the kernel).

Operating System Concepts

1.2

Silberschatz, Galvin and Gagne 2002

Computer System Components

1. Hardware provides basic computing resources. 2. Operating System controls and coordinates the use of the resources. 3. Applications Programs define the ways in which the system resources are used to solve the computing problems of the users. 4. Users

Operating System Concepts

1.3

Silberschatz, Galvin and Gagne 2002

Mainframe Systems
Batch Systems Multiprogrammed System

Time-Sharing System

Batch Systems
Job the program,data and control info.

Similar kind of jobs were BATCHED together and run as a

group to speed up the processing. CPU is often idle,coz card reader is much slower than the CPU.

Operating System Concepts

1.4

Silberschatz, Galvin and Gagne 2002

Multiprogrammed System
CPU utilization is increased by organizing the jobs so that

the CPU always has one to execute. OS keeps several jobs in memory simultaneously,and begins executing one of them.Once this job has to wait for some task,OS switches to another job. In a non-multiprogramming environment,OS sits idle if one job has to wait for some task.

Operating System Concepts

1.5

Silberschatz, Galvin and Gagne 2002

Time-Sharing Systems
Time-sharing is a logical extension of multiprogramming. CPU executes multiple jobs by switching amongst them. Each job is executed for a fixed time-slice and after the

completion of the time-slice,CPU switches to the next job. Allow multiple users to share the computer simultaneously. Each user is given the impression that he is the sole user of the system.

Operating System Concepts

1.6

Silberschatz, Galvin and Gagne 2002

Multiprocessor System
Multiprocessor systems have more than one CPU. All the processors share memory and a clock; communication

usually takes place through the shared memory. Also known as Tightly-coupled Systems or Parallel Systems. Advantages of Parallel Systems: Increased throughput When N processors work together, the speed up is huge. Although this speed up ratio is not N times due to sharing of data. Economical Multiprocessor save money than multiple singleprocessor systems coz they share memory and peripherals. Increased reliability If one of the 10 processors fail, other 9 processors should be able to share the work without halting the system.
Operating System Concepts
1.7

Silberschatz, Galvin and Gagne 2002

 Graceful Degradation The ability to continue providing

the service,even after failure of one processor, is called graceful degradation. Fault Tolerant Systems Systems designed for graceful degradation are called fault tolerant systems. Job Scheduling If multiple jobs are ready to be brought into memory, but there is not enough room for all, the system has to choose amongst them. Making this decision is job scheduling. CPU Scheduling If there are several jobs ready to run at the same time, the system has to choose amongst them. Making this decision is CPU scheduling.

Operating System Concepts

1.8

Silberschatz, Galvin and Gagne 2002

Symmetric Multiprocessor
Each of the N processors run an

Asymmetric Multiprocessor
One of the N processor acts as a

identical copy of the OS. All systems are peers,there is no master-slave relationship. Advantage N processes can be run simultaneously if there are N processors. Disadvantage One processor may be sitting idle while the other may be overloaded.

master and others act act as slaves. Master processor assigns a specific task to each of the slave processors. Used for large systems. Advantage All the slave processors are given the work equally. Disadvantage - Sharing of memory and other data structures might cause delay sometimes.
Silberschatz, Galvin and Gagne 2002

Operating System Concepts

1.9

Distributed Systems
Distributed Systems are multiple single-processor system

connected through a network. The computation is distributed among several physical processors connected in a network. Each processor has its own local memory. Processors communicate with one another through various communications lines, such as high-speed buses or telephone lines. Also known as Loosely-coupled Systems.

Networks
Local Area Network (LAN) exists in a room,floor or a building. Wide Area Network (WAN) exists between buildings, cities, countries. Small Area Network exists in a range of several feet.

eg-used for Bluetooth device.

Operating System Concepts
1.10

Silberschatz, Galvin and Gagne 2002

Distributed System
Client-Server System
Peer-to-Peer System

General Structure of Client-Server

Operating System Concepts

1.11

Silberschatz, Galvin and Gagne 2002

Peer-to-Peer System
All systems are peers,there is no master-slave relationship. All N single processors can run separate tasks.

Operating System Concepts

1.12

Silberschatz, Galvin and Gagne 2002

Clustered Systems
Clustered Systems are multiple single-processor system

connected through a network with shared storage. Types of clustered systems:

Asymmetric clustering Symmetric clustering

Asymmetric Clustering
One machine is in standby mode

Symmetric Clustering
All machines run applications

while the other is running the applications. If the running machine fails,the standby mode machine becomes active. Advantage Very easy to recover from machine failure. Disadvantage One machine is ALWAYS in standby mode.
Operating System Concepts
1.13

and monitor each other too.If any machine fails,its load is shared amongst all others. Advantage No machine is idle. Disadvantage Difficult to share the load.
Silberschatz, Galvin and Gagne 2002

Real-Time Systems
Well-defined rigid time constraints are placed on the

operation of the processor. Used in controlling scientific experiments, medical imaging systems, industrial control system etc. Real-Time systems: Hard real-time Soft real-time.

Operating System Concepts

1.14

Silberschatz, Galvin and Gagne 2002

Hard Real-Time Systems

Hard real time systems

Soft Real-Time Systems

Failure to meet the time deadline

guarantees that the job will be done on time. All delays in the system are bounded. Secondary storage limited or absent, data stored in read-only memory (ROM). If the time deadline is not met,it may lead to catastrophes. Example Rocket launch.etc

does not lead to catastrophes. Soft real-time tasks are given higher priority than. Example - Industrial control.

Operating System Concepts

1.15

Silberschatz, Galvin and Gagne 2002

Handheld Systems

Personal Digital Assistants (PDAs)

Cellular telephones Issues:

Limited memory
Slow processors Small display screens.

Operating System Concepts

1.16

Silberschatz, Galvin and Gagne 2002