CH 1
CH 1
CH 1
Operating System Concepts – 10th Edition 1.1 Silberschatz, Galvin and Gagne ©2018
Objectives
Operating System Concepts – 10th Edition 1.2 Silberschatz, Galvin and Gagne ©2018
What Does the Term Operating System Mean?
Operating System Concepts – 10th Edition 1.3 Silberschatz, Galvin and Gagne ©2018
What is an Operating System?
Operating System Concepts – 10th Edition 1.4 Silberschatz, Galvin and Gagne ©2018
Computer System Structure
Operating System Concepts – 10th Edition 1.5 Silberschatz, Galvin and Gagne ©2018
Abstract View of Components of Computer
Operating System Concepts – 10th Edition 1.6 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
• OS is a control program
– Controls execution of user programs
– Prevents errors and improper use
Operating System Concepts – 10th Edition 1.7 Silberschatz, Galvin and Gagne ©2018
Operating System Definition
Operating System Concepts – 10th Edition 1.8 Silberschatz, Galvin and Gagne ©2018
Overview of Computer System Structure
Operating System Concepts – 10th Edition 1.9 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.10 Silberschatz, Galvin and Gagne ©2018
Computer-System Operation
Operating System Concepts – 10th Edition 1.11 Silberschatz, Galvin and Gagne ©2018
Common Functions of Interrupts
Operating System Concepts – 10th Edition 1.12 Silberschatz, Galvin and Gagne ©2018
Interrupt Timeline
Operating System Concepts – 10th Edition 1.13 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
Computer Startup
Operating System Concepts – 10th Edition 1.16 Silberschatz, Galvin and Gagne ©2018
Multiprogramming (Batch system)
▪ Single user cannot always keep CPU and I/O devices busy
▪ 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 job has to wait (for I/O for example), OS switches to another job
▪ To further increase system utilization, multiprogramming Oss
were invented
– keeps multiple runnable jobs loaded in memory at once
– overlaps I/O of one job with computing of another
• while one job waits for I/O completion, another job
uses the CPU and switch between jobs on I/O events
– How do we tell when I/O devices are done?
• Interrupts
• Polling
– What new requirements does this impose?
protect programs from each other
Operating System Concepts – 10th Edition 1.17 Silberschatz, Galvin and Gagne ©2018
Advantages to Multiprogramming
Operating System Concepts – 10th Edition 1.18 Silberschatz, Galvin and Gagne ©2018
Multitasking (Timesharing)
Operating System Concepts – 10th Edition 1.19 Silberschatz, Galvin and Gagne ©2018
Multiprogramming and Multitasking
Operating System Concepts – 10th Edition 1.20 Silberschatz, Galvin and Gagne ©2018
Memory Layout for Multiprogrammed System
Operating System Concepts – 10th Edition 1.21 Silberschatz, Galvin and Gagne ©2018
Dual-mode Operation
Operating System Concepts – 10th Edition 1.22 Silberschatz, Galvin and Gagne ©2018
Transition from User to Kernel Mode
Operating System Concepts – 10th Edition 1.23 Silberschatz, Galvin and Gagne ©2018
Timer
▪ Timer to prevent infinite loop (or 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.24 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.25 Silberschatz, Galvin and Gagne ©2018
Process Management Activities
Operating System Concepts – 10th Edition 1.26 Silberschatz, Galvin and Gagne ©2018
Caching
Operating System Concepts – 10th Edition 1.27 Silberschatz, Galvin and Gagne ©2018
Migration of data “A” from Disk to Register
Operating System Concepts – 10th Edition 1.28 Silberschatz, Galvin and Gagne ©2018
Protection and Security
Operating System Concepts – 10th Edition 1.30 Silberschatz, Galvin and Gagne ©2018
I/O Structure (two methods)
▪ After I/O starts, control returns to user program only upon I/O
completion (Synchronous)
• 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
▪ After I/O starts, control returns to user program without waiting
for I/O completion (Asynchronous)
• 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.31 Silberschatz, Galvin and Gagne ©2018
Operating System Concepts – 10th Edition 1.32 Silberschatz, Galvin and Gagne ©2018
Operating System Concepts – 10th Edition 1.33 Silberschatz, Galvin and Gagne ©2018
Virtualization
Operating System Concepts – 10th Edition 1.34 Silberschatz, Galvin and Gagne ©2018
Virtualization (cont.)
▪ Use cases involve laptops and desktops running multiple OSes for
exploration or compatibility
• Apple laptop running Mac OS X host, Windows as a guest
• Developing apps for multiple OSes without having multiple
systems
• Quality assurance testing applications without having multiple
systems
• Executing and managing compute environments within data
centers
▪ VMM can run natively, in which case they are also the host
• There is no general-purpose host then (VMware ESX and Citrix
XenServer)
Operating System Concepts – 10th Edition 1.35 Silberschatz, Galvin and Gagne ©2018
Computing Environments - Virtualization
Operating System Concepts – 10th Edition 1.36 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
Operating System Concepts – 10th Edition 1.37 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.38 Silberschatz, Galvin and Gagne ©2018
Storage Hierarchy
Operating System Concepts – 10th Edition 1.39 Silberschatz, Galvin and Gagne ©2018
Storage-Device Hierarchy
Operating System Concepts – 10th Edition 1.40 Silberschatz, Galvin and Gagne ©2018
How a Modern Computer Works
Operating System Concepts – 10th Edition 1.41 Silberschatz, Galvin and Gagne ©2018
Direct Memory Access Structure
Operating System Concepts – 10th Edition 1.42 Silberschatz, Galvin and Gagne ©2018
Major Components Computer OS
▪ processes/threads
▪ memory
▪ I/O
▪ secondary storage
▪ file systems
▪ protection
▪ shells (command interpreter, or OS UI)
▪ GUI
▪ networking
43
Operating System Concepts – 10th Edition 1.43 Silberschatz, Galvin and Gagne ©2018
Recap
Operating System Concepts – 10th Edition 1.44 Silberschatz, Galvin and Gagne ©2018
Computer System Architecture
Operating System Concepts – 10th Edition 1.45 Silberschatz, Galvin and Gagne ©2018
Computer-System Architecture
▪ Most systems use a single general-purpose processor
• Most systems have special-purpose processors as well
▪ Multiprocessors systems growing in use and importance
• Also known as parallel systems, tightly-coupled systems
• Advantages include:
1. Increased throughput
2. Economy of scale
3. Increased reliability – graceful degradation or fault tolerance
• Two types:
1. Asymmetric Multiprocessing – each processor is assigned a specie
task.
2. Symmetric Multiprocessing – each processor performs all tasks
Operating System Concepts – 10th Edition 1.46 Silberschatz, Galvin and Gagne ©2018
4
7
PC Motherboard
Operating System Concepts – 10th Edition 1.47 Silberschatz, Galvin and Gagne ©2018
Computer-System Architecture
2. multiprocessor system
•modern systems from mobile devices to servers have
multiprocessor
•each processor with one core (traditional systems) or multiple
cores (we call it multicore systems)
Operating System Concepts – 10th Edition 1.48 Silberschatz, Galvin and Gagne ©2018
Symmetric Multiprocessing Architecture
Operating System Concepts – 10th Edition 1.49 Silberschatz, Galvin and Gagne ©2018
A Dual-Core Design
Multicore systems can be more efficient than multiple chips with single cores because
on-chip communication is faster than between-chip communication.
uses significantly less power than
Operating System Concepts – 10th Edition 1.50 Silberschatz, Galvin and Gagne ©2018
Common Multiprocessor systems
Operating System Concepts – 10th Edition 1.51 Silberschatz, Galvin and Gagne ©2018
Non-Uniform Memory Access System
Operating System Concepts – 10th Edition 1.52 Silberschatz, Galvin and Gagne ©2018
Clustered Systems / another type of multiprocessor systems
Operating System Concepts – 10th Edition 1.53 Silberschatz, Galvin and Gagne ©2018
Clustered Systems
Operating System Concepts – 10th Edition 1.54 Silberschatz, Galvin and Gagne ©2018
Process Management
Operating System Concepts – 10th Edition 1.55 Silberschatz, Galvin and Gagne ©2018
Process Management Activities
The operating system is responsible for the following activities in
connection with process management:
Operating System Concepts – 10th Edition 1.56 Silberschatz, Galvin and Gagne ©2018
Memory Management
▪ To execute a program all (or part) of the instructions must be in
memory
▪ All (or part) of the data that is needed by the program must be in
memory
▪ Memory management determines what is in memory and when
• Optimizing CPU utilization and computer response to users
▪ The operating system is responsible for the following activities in
connection with memory management:
• Keeping track of which parts of memory are currently being used
and by whom
• Deciding which processes (or parts thereof) and data to move into
and out of memory
• Allocating and deallocating memory space as needed
Operating System Concepts – 10th Edition 1.57 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)
Varyingproperties 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
Mapping files onto secondary storage
Backup files onto stable (non-volatile) storage media
Operating System Concepts – 10th Edition 1.58 Silberschatz, Galvin and Gagne ©2018
Kernel Data Structures
Many similar to standard programming data structures
Main memory is organized as an array
Singly linked list
Operating System Concepts – 10th Edition 1.59 Silberschatz, Galvin and Gagne ©2018
Kernel Data Structures
▪ Binary tree
• Parent child relationship
• At most two children
▪ Binary search tree
left <= right
• Search performance is O(n) – worst case
performance
• Balanced binary search tree is O(lg n)
Operating System Concepts – 10th Edition 1.60 Silberschatz, Galvin and Gagne ©2018
Kernel Data Structures
▪ Hash function can create a hash map
Operating System Concepts – 10th Edition 1.61 Silberschatz, Galvin and Gagne ©2018
Computing Environments - Mobile
6
2
Operating System Concepts – 10th Edition 1.62 Silberschatz, Galvin and Gagne ©2018
Computing Environments – Client-Server
Client-Server Computing
Dumb terminals supplanted by smart PCs
Many systems now servers, responding to
requests generated by clients
Compute-server system provides an interface
to client to request services (i.e., database)
File-server system provides interface for
clients to store and retrieve files
Operating System Concepts – 10th Edition 1.63 Silberschatz, Galvin and Gagne ©2018
Computing Environments - Peer-to-Peer
◼ Another model of distributed system
◼ P2P does not distinguish clients and servers
Instead all nodes are considered peers
May each act as client, server or both depending on
whether it is requesting or providing a service.
Node must join P2P network
Registers its service with central lookup service on
network,
Broadcast request for service and respond to requests
for service via discovery protocol
Operating System Concepts – 10th Edition 1.64 Silberschatz, Galvin and Gagne ©2018
Computing Environments – Cloud
Computing
Operating System Concepts – 10th Edition 1.65 Silberschatz, Galvin and Gagne ©2018
Computing Environments – Cloud Computing
◼ Cloud computing environments composed of traditional OSes, plus VMMs, plus
cloud management tools
Internet connectivity requires security like firewalls
Load balancers spread traffic across multiple applications
6
6
Operating System Concepts – 10th Edition 1.66 Silberschatz, Galvin and Gagne ©2018
End of Chapter 1
Operating System Concepts – 10h Edition Silberschatz, Galvin and Gagne ©2018