ch1 1
ch1 1
Operating System Concepts – 10h Edition Silberschatz, Galvin and Gagne ©2018
Chapter 1: Introduction
What Operating Systems Do
Computer-System Organization
Computer-System Architecture
Operating-System Operations
Resource Management
Security and Protection
Virtualization
Distributed Systems
Kernel Data Structures
Computing Environments
Free/Libre and Open-Source Operating Systems
Operating System Concepts – 10th Edition 1.2 Silberschatz, Galvin and Gagne ©2018
Objectives
Operating System Concepts – 10th Edition 1.3 Silberschatz, Galvin and Gagne ©2018
Computer System Structure
Operating System Concepts – 10th Edition 1.4 Silberschatz, Galvin and Gagne ©2018
Abstract View of Components of Computer
Operating System Concepts – 10th Edition 1.5 Silberschatz, Galvin and Gagne ©2018
What Operating Systems Do
Depends on the point of view
Users want convenience, ease of use and good performance
Don’t care about resource utilization
But shared computer such as mainframe or minicomputer must keep
all users happy
Operating system is a resource allocator and control program
making efficient use of HW and managing execution of user
programs
Users of dedicate systems such as workstations have dedicated
resources but frequently use shared resources from servers
Mobile devices like smartphones and tables are resource poor,
optimized for usability and battery life
Mobile user interfaces such as touch screens, voice recognition
Some computers have little or no user interface, such as embedded
computers in devices and automobiles
Run primarily without user intervention
Operating System Concepts – 10th Edition 1.6 Silberschatz, Galvin and Gagne ©2018
Defining Operating Systems
Operating System Concepts – 10th Edition 1.7 Silberschatz, Galvin and Gagne ©2018
Operating System Definition (Cont.)
Operating System Concepts – 10th Edition 1.8 Silberschatz, Galvin and Gagne ©2018
Computer System Organization
Computer-system operation
One or more CPUs, device controllers connect through common
bus providing access to shared memory
Concurrent execution of CPUs and devices competing for
memory cycles
Operating System Concepts – 10th Edition 1.9 Silberschatz, Galvin and Gagne ©2018
Computer-System Operation
Operating System Concepts – 10th Edition 1.10 Silberschatz, Galvin and Gagne ©2018
Common Functions of Interrupts
Operating System Concepts – 10th Edition 1.11 Silberschatz, Galvin and Gagne ©2018
Interrupt Timeline
Operating System Concepts – 10th Edition 1.12 Silberschatz, Galvin and Gagne ©2018
Interrupt Handling
Operating System Concepts – 10th Edition 1.14 Silberschatz, Galvin and Gagne ©2018
Interrupt-drive I/O Cycle
Operating System Concepts – 10th Edition 1.15 Silberschatz, Galvin and Gagne ©2018
I/O Structure
Synchronous: After I/O starts, control returns to user program
only upon I/O completion
Wait instruction idles the CPU until the next interrupt
Wait loop (contention for memory access)
At most one I/O request is outstanding at a time, no
simultaneous I/O processing
Asynchronous: After I/O starts, control returns to user program
without waiting for I/O completion
System call – request to the OS to allow user to wait for
I/O completion
Device-status table contains entry for each I/O device
indicating its type, address, and state
OS indexes into I/O device table to determine device
status and to modify table entry to include interrupt
Operating System Concepts – 10th Edition 1.16 Silberschatz, Galvin and Gagne ©2018
Two I/O Methods
Synchronous Asynchronous
Operating System Concepts – 10th Edition 1.17 Silberschatz, Galvin and Gagne ©2018
Device-Status Table
If the device is busy with a request, the type of request and other parameters
are stored in the table entry for that device
A queue will contain a list of all those requests waiting for a device
Operating System Concepts – 10th Edition 1.18 Silberschatz, Galvin and Gagne ©2018
Storage Structure
Main memory – only large storage media that the CPU can access directly
Random access
Typically volatile
Typically random-access memory in the form of Dynamic Random-
access Memory (DRAM)
Secondary storage – extension of main memory that provides large
nonvolatile storage capacity
Hard Disk Drives (HDD) – rigid metal or glass platters covered with
magnetic recording material
Disk surface is logically divided into tracks, which are subdivided into sectors
The disk controller determines the logical interaction between the device and
the computer
Non-volatile memory (NVM) devices– faster than hard disks, nonvolatile
Various technologies
Becoming more popular as capacity and performance increases, price drops
Operating System Concepts – 10th Edition 1.19 Silberschatz, Galvin and Gagne ©2018
Storage Definitions and Notation Review
The basic unit of computer storage is the bit . A bit can contain one of two
values, 0 and 1. All other storage in a computer is based on collections of bits.
Given enough bits, it is amazing how many things a computer can represent:
numbers, letters, images, movies, sounds, documents, and programs, to name
a few. A byte is 8 bits, and on most computers it is the smallest convenient
chunk of storage. For example, most computers don’t have an instruction to
move a bit but do have one to move a byte. A less common term is word,
which is a given computer architecture’s native unit of data. A word is made
up of one or more bytes. For example, a computer that has 64-bit registers and
64-bit memory addressing typically has 64-bit (8-byte) words. A computer
executes many operations in its native word size rather than a byte at a time.
Operating System Concepts – 10th Edition 1.20 Silberschatz, Galvin and Gagne ©2018
Storage Hierarchy
Operating System Concepts – 10th Edition 1.21 Silberschatz, Galvin and Gagne ©2018
Storage-Device Hierarchy
Operating System Concepts – 10th Edition 1.22 Silberschatz, Galvin and Gagne ©2018
How a Modern Computer Works
Operating System Concepts – 10th Edition 1.23 Silberschatz, Galvin and Gagne ©2018
Direct Memory Access Structure
Operating System Concepts – 10th Edition 1.24 Silberschatz, Galvin and Gagne ©2018
Computer-System Architecture
Operating System Concepts – 10th Edition 1.25 Silberschatz, Galvin and Gagne ©2018
Symmetric Multiprocessing Architecture
Operating System Concepts – 10th Edition 1.26 Silberschatz, Galvin and Gagne ©2018
A Dual-Core Design
Multi-chip and multicore
Systems containing all chips
Chassis containing multiple separate systems
Operating System Concepts – 10th Edition 1.27 Silberschatz, Galvin and Gagne ©2018
Non-Uniform Memory Access System
Operating System Concepts – 10th Edition 1.28 Silberschatz, Galvin and Gagne ©2018
Clustered Systems
Operating System Concepts – 10th Edition 1.29 Silberschatz, Galvin and Gagne ©2018
Clustered Systems
Operating System Concepts – 10th Edition 1.30 Silberschatz, Galvin and Gagne ©2018
PC Motherboard
Operating System Concepts – 10th Edition 1.31 Silberschatz, Galvin and Gagne ©2018
Operating-System Operations
Bootstrap program – simple code to initialize the system, load
the kernel
Kernel loads
Starts system daemons (services provided outside of the
kernel)
Kernel interrupt driven (hardware and software)
Hardware interrupt by one of the devices
Software interrupt (exception or trap):
Software error (e.g., division by zero)
Operating System Concepts – 10th Edition 1.32 Silberschatz, Galvin and Gagne ©2018
Multiprogramming and Multitasking
Multiprogramming (Batch system) needed for efficiency
Single user cannot keep CPU and I/O devices busy at all times
Multiprogramming organizes jobs (code and data) so CPU always has one
to execute
A subset of total jobs in system is kept in memory
One job selected and run via job scheduling
When it has to wait (for I/O for example), OS switches to another job
Operating System Concepts – 10th Edition 1.33 Silberschatz, Galvin and Gagne ©2018
Memory Layout for Multiprogrammed System
Operating System Concepts – 10th Edition 1.34 Silberschatz, Galvin and Gagne ©2018
Dual-mode and Multimode Operation
Operating System Concepts – 10th Edition 1.35 Silberschatz, Galvin and Gagne ©2018
Transition from User to Kernel Mode
Timer to prevent infinite loop / process hogging resources
Timer is set to interrupt the computer after some time period
Keep a counter that is decremented by the physical clock
Operating system set the counter (privileged instruction)
When counter zero generate an interrupt
Set up before scheduling process to regain control or terminate
program that exceeds allotted time
Operating System Concepts – 10th Edition 1.36 Silberschatz, Galvin and Gagne ©2018
Process Management
A process is a program in execution. It is a unit of work within the
system. Program is a passive entity, process is an active entity.
Process needs resources to accomplish its task
CPU, memory, I/O, files
Initialization data
Process termination requires reclaim of any reusable resources
Single-threaded process has one program counter specifying
location of next instruction to execute
Process executes instructions sequentially, one at a time,
until completion
Multi-threaded process has one program counter per thread
Typically system has many processes, some user, some
operating system running concurrently on one or more CPUs
Concurrency by multiplexing the CPUs among the processes
/ threads
Operating System Concepts – 10th Edition 1.37 Silberschatz, Galvin and Gagne ©2018
Process Management Activities
Operating System Concepts – 10th Edition 1.38 Silberschatz, Galvin and Gagne ©2018
Memory Management
Operating System Concepts – 10th Edition 1.39 Silberschatz, Galvin and Gagne ©2018
File-system Management
OS provides uniform, logical view of information storage
Abstracts physical properties to logical storage unit - file
Each medium is controlled by device (i.e., disk drive, tape drive)
Varying properties include access speed, capacity, data-
transfer rate, access method (sequential or random)
File-System management
Files usually organized into directories
Access control on most systems to determine who can access
what
OS activities include
Creating and deleting files and directories
Primitives to manipulate files and directories
Operating System Concepts – 10th Edition 1.40 Silberschatz, Galvin and Gagne ©2018
Mass-Storage Management
Usually disks used to store data that does not fit in main memory or data
that must be kept for a “long” period of time
Proper management is of central importance
Entire speed of computer operation hinges on disk subsystem and its
algorithms
OS activities
Mounting and unmounting
Free-space management
Storage allocation
Disk scheduling
Partitioning
Protection
Some storage need not be fast
Tertiary storage includes optical storage, magnetic tape
Still must be managed – by OS or applications
Operating System Concepts – 10th Edition 1.41 Silberschatz, Galvin and Gagne ©2018
Caching
Operating System Concepts – 10th Edition 1.42 Silberschatz, Galvin and Gagne ©2018
Characteristics of Various Types of Storage
Operating System Concepts – 10th Edition 1.43 Silberschatz, Galvin and Gagne ©2018
Migration of data “A” from Disk to Register
Operating System Concepts – 10th Edition 1.44 Silberschatz, Galvin and Gagne ©2018
I/O Subsystem
One purpose of OS is to hide peculiarities of hardware devices
from the user
I/O subsystem responsible for
Memory management of I/O including buffering (storing data
temporarily while it is being transferred), caching (storing parts
of data in faster storage for performance), spooling (the
overlapping of output of one job with input of other jobs)
General device-driver interface
Drivers for specific hardware devices
Operating System Concepts – 10th Edition 1.45 Silberschatz, Galvin and Gagne ©2018
Protection and Security
Operating System Concepts – 10th Edition 1.46 Silberschatz, Galvin and Gagne ©2018
End of Chapter 1
Operating System Concepts – 10h Edition Silberschatz, Galvin and Gagne ©2018