You are on page 1of 3

ITEC 55 - PLATFORM TECHNOLOGIES

LECTURE
Introduction to Operating Systems
What is an Operating System? History of Operating Systems
Operating System (OS) - is a collection of software that manages 1950s - computers were built to perform a series of single tasks,
computer hardware resources and provides common services for Operating systems features were developed in this time.
computer programs.
1954 - computers had no operating systems but were operated
USER > APPLICATION > OPERATING SYSTEM > HARDWARE manually by their users.
IBM 701, was the first commercial scientific computer
For hardware functions such as input and output and memory
allocation, the operating system acts as an intermediary between GM-NAA I/O created in 1956 by Robert L. Patrick, this was the first
programs and the computer hardware. operating system for the IBM 704 computer.
Types of Operating Systems
Mobile Operating System Unix OS, was developed by AT&T Bell Laboratories by Ken
The systems that are meant to power wearable devices, tablets, and Thompson, Dennis Ritchie and others.
mobile phones are known as mobile operating systems.
First Generation
Examples: Phones
Technology: Operating System: Language:
Vacuum tubes Not present Machine Language
NetworkOperating System
The ability to handle applications, security, groups, users, data, and Serial Processing (First Gen)
many other networking operations provided by a network operating - One person operating the machine at a given time.
system.
Second Generation
Examples: Cloud Computing Technology: Operating System: Language:
Transistors Present Assembly & High-level
Distributed Operating System Language
A system that uses many mainframes situated on various machines to Batch Systems (Second Gen)
provide rapid computing to its workers. - CPU utilization is increased and set-up time is reduced.
- Compilers are used
Examples: Servers
Third Generation
Real time Operating System
Technology: Operating System: Language:
Works with real time applications, or handling data without delay.
Integrated Circuits Present High-level Language
Examples: Robotics Multiprogrammed Systems (Third Gen)
- CPU is utilized as it does not have idle time
Multitasking Operating System
It enables multiple activities to be completed at the same time using
multiple CPU cores.

Examples: Windows, MacOs

Batch Operating System


A system that doesn’t interfere with the computer directly. This
operating system uses punch cards for the computer operator.

Examples: Punch cards

BS INFOTECH 201B - SANCHEZ, JOSHUA H. 1


ITEC 55 - PLATFORM TECHNOLOGIES
LECTURE
CPU Scheduling
Process Management Preemptive scheduling
Program - is an application that we can run, like chrome. They take into consideration that some processes could have a higher
Process - is the program that is currently executing. priority and hence must be executed before the processes that have a
Kernel - a fundamental component that serves as the core of the OS. lower priority.

Non - Preemptive scheduling


New processes are executed only after the current process has
completed its execution.

Important Terminologies in CPU Scheduling:


1. Arrival Time: time which the process arrives.
2. Completion Time: time at which the process completes execution.
3. Burst Time: time required for a process to execute.
4. Turn Around Time: difference between completion time and
arrival time [TAT = CT - AT].
5. Waiting Time: time the process spends in queue waiting for their
turn [ WT = TAT - BT ].

CPU Scheduling Algorithms


First Come First Serve - FCFS
Kernel has to worry about all the processes at once. A time slice is Non preemptive - ARRIVAL TIME
done when a CPU wants to execute multiple processes at once.
Shortest Job First - SJF
Time slice - is a very short interval of time that gets allocated to a Non preemptive - BURST TIME
process for CPU execution.
Priority Scheduling
Process states in Operating Systems Preemptive - PRIORITY
New A new process is created
Ready The process enters a ready state (queue)
Shortest Remaining Time First - SRTF
Preemptive - BURST TIME
Run The process is chosen for execution
Blocked or Wait When process needs I/O from user
Terminated or Completed Process is killed and PCB is deleted
(PCB - Process Control Block)
Suspended Ready Process that was from ready state but
swapped out of main memory and placed
onto external storage by scheduler
Suspended Wait / Blocked Similar to suspend ready but uses the
process which was performing I/O
operation and lack of main memory
caused them to move to secondary
memory. When work is finished it may go
to suspend ready.

What is CPU Scheduling?


Is the task performed by the CPU that decides the way and order in
which processes should be executed. There are 2 types of CPU
Scheduling - Preemptive, and Non-Preemptive.

The purpose of CPU Scheduling is to make the system more efficient,


faster, and fairer.
ITEC 55 - PLATFORM TECHNOLOGIES
LECTURE
CPU Scheduling

BS INFOTECH 201B - SANCHEZ, JOSHUA H. 3

You might also like