OPERATING

SYSTEM
ENGR. CRIS CALITINA JR
 SCHEDULE

SYNC / F2F – 8:00 – 11:30 am (TH)

ASYNC – 8:00 – 9:30 (W)

TOPICS

• Orientation of Classroom Policies and Academic

Requirement
• What Operating Systems Do
• Computer-System Organization
• Computer-System Architecture
COURSE DESCRIPTION

This course includes different policies and strategies used by an operating

system. Topics include operating systems structures, process
management, storage management, file management, and distributed
system
This is a lecture and laboratory class

And ADVANCE READING is highly recommended.

 CLASS REQUIREMENT

GRADING SYSTEM
Class Standing 60%

Laboratory Activity 40%

Asynchronous Activity 30%

Class Standing 20%

Attendance 10%

Major Exam 40%

SUBMISSION POLICY
• If in case the assignment / async activity expires, please email
your outputs to [email protected]

• Subject Title: COC423-1 - <Output Title> - <Last Name>

Example

CPE323B-LABORATORY 1-Calitina

*NOTE: MY ACCOUNT FOR MS TEAMS:

[email protected]
Reference:

Operating System Concepts

Silberchatz
Galvin
Gagne

Reference:
https://bit.ly/OS-Concepts-9th
 • A program that acts as an
intermediary between a user of a
WHAT IS computer and the computer
hardware.
AN
OPERATIN • Operating system goals:
• Execute user programs and make
G solving user problems easier
• Make the computer system
SYSTEM? convenient to use
• Use the computer hardware in an
efficient manner
WHAT IS AN OPERATING SYSTEM?
• OS is a resource allocator
• Manages all resources
• Decides between conflicting requests for efficient and fair
resource use
• OS is a control program
• Controls execution of programs to prevent errors and
improper use of the computer
WHAT IS AN OPERATING SYSTEM?

• No universally accepted definition

• “Everything a vendor ships when you order an operating system” is a good
approximation
• But varies wildly
• “The one program running at all times on the computer” is the kernel.
• Everything else is either
• a system program (ships with the operating system) , or
• an application program.
 USER USER USER USER
1 2 3 4

COMPILER ASSEMBLER TEXT EDITOR DATABASE SYSTEM

SYSTEM AND APPLICATION PROGRAMS

OPERATING SYSTEM

COMPUTER HARDWARE
 WHAT OPERATING SYSTEMS DO
USER VIEW SYSTEM VIEW
• Varies according to the interface • This is the program that is most
being used intimately working with the
hardware.
• Designed for ease of use and
resource utilization • It is a resource allocator

• The goal is to maximize the work

that the user is performing
COMPUTER
SYSTEM
ORGANIZATION
• COMPUTER-SYSTEM
OPERATION
• One or more CPUs,
device controllers
connect through a
common bus providing
access to shared memory
• Concurrent execution of
CPUs and devices
competing for memory
cycles
COMPUTER-SYSTEM OPERATION
• I/O devices and the CPU can execute concurrently
• Each device controller is in charge of a particular device type
• Each device controller has a local buffer
• CPU moves data from/to main memory to/from local buffers
• I/O is from the device to the local buffer of the controller
• Device controller informs CPU that it has finished its operation by causing an interrupt
 • Interrupt transfers control to the
interrupt service routine generally,
COMMON through the interrupt vector, which
FUNCTION contains the addresses of all the service
routines
S OF • Interrupt architecture must save the
address of the interrupted instruction
INTERRUP • A trap or exception is a software-
TS generated interrupt caused either by an
error or a user request
• An operating system is interrupt driven
 INTERRUPT HANDLING
• The operating system preserves the state of the CPU by storing
registers and the program counter
• Determines which type of interrupt has occurred:
• polling
• vectored interrupt system
• Separate segments of code determine what action should be taken
for each type of interrupt
INTERRUPT TIMELINE
 STORAGE STRUCTURE
• Main memory – only large storage media that the CPU can access directly
• Random access
• Typically volatile
• Secondary storage – an extension of main memory that provides large nonvolatile storage
capacity
• Hard disks – rigid metal or glass platters covered with the 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
• Solid-state disks – faster than hard disks, nonvolatile
• Various technologies
• Becoming more popular
STORAGE HIERARCHY
• Storage systems organized in a
hierarchy
• Speed
• Cost
• Volatility

• Device Driver for each device

controller to manage I/O
• Provides uniform interface between
controller and kernel
 I/O STRUCTURE
• 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
• 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
 CACHING
• Important principle, performed at many levels in a computer (in
hardware, operating system, software)
• Information in use copied from slower to faster storage temporarily
• Faster storage (cache) checked first to determine if information is
there
• If it is, information used directly from the cache (fast)
• If not, data copied to cache and used there
• Cache smaller than storage being cached
• Cache management important design problem
• Cache size and replacement policy
DIRECT MEMORY ACCESS STRUCTURE
• Used for high-speed I/O devices able to transmit information at close
to memory speeds
• Device controller transfers blocks of data from buffer storage directly
to main memory without CPU intervention
• Only one interrupt is generated per block, rather than the one
interrupt per byte
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
SYMMETRIC MULTIPROCESSING ARCHITECTURE
 A DUAL-CORE
DESIGN
• Multi-chip and multicore

• Systems containing all

chips
• Chassis containing multiple
separate systems
 CLUSTERED SYSTEMS
• Like multiprocessor systems, but multiple systems working
together
• Usually sharing storage via a storage-area network
(SAN)
• Provides a high-availability service that survives
failures
• Asymmetric clustering has one machine in hot-
standby mode
• Symmetric clustering has multiple nodes running
applications, monitoring each other
• Some clusters are for high-performance computing
(HPC)
• Applications must be written to use
parallelization
• Some have distributed lock manager (DLM) to avoid
conflicting operations