Operating System Report 102933
Operating System Report 102933
MICRO PROJECT
On
“Process scheduling”
Submitted by
Alok Mule
Sumit Nandkar
Om Surase
G.S. Mandal’s
CERTIFICATE
This is to certify that : -
94 Om Surase 2200660266
We have successfully completed “Process scheduling” Micro-project for the subject Operating
Systems as in the enclosed ‘Portfilio’ during his tenure of Completing the Diploma in Computer
Engineering (CO5I) in Academic Year 2024-2025 from M.I.T. Polytechnic, Chh.Sambhajinagar with
Institute Code 0066.
Date:
Prof. S.S.Jadhav Prof. A.S.Nagrik
Project Guide H.O.D.
Principal
Marathwada Institute of Technology,
Polytechnic, Chh.Sambhajinagar
INDEX
Annexure-IV Micro Project Teacher Evaluation Sheet
3.0 Proposed Methodology (procedure in brief that will be followed to do the micro-
project in about 100-200 words.)
4.0 Action Plan (Sequence and time required for major activity.)
5.0 Resources required (major resources such as row material, some machining facility,
software etc.)
3.0 Course Outcomes Achieved (Add to the earlier list is more Cos are addressed)
5.0 Actual Methodology Followed (Write step wise work done, data collected and its
analysis (if any). The contribution of individual member may also be noted.)
7.0 Outputs of the micro projects (Drawings of the prototype, drawing of survey,
presentation of collected data, findings etc.)
Annexure-IV
Micro Project
(Teacher Evaluation Sheet)
94 OM Surase 2200660266
Signature of Teacher :
Annexure-I
Micro-Project Proposal
(Format for Micro-Project Proposal About 1-2 pages)
A)-For micro-project first we have to decide topic related to Operating System subject.
D)-Then we will research information & after that I will start my main project.
E)-At the time of project if we are getting some problem then we will ask to the
respective subject teacher
F)-After removing errors from my project , we will show it to subject teacher for
checking/correction .
78 Alok Mule
94 Om Surase
Annexure-II
Micro-Project Report
(Format for Micro-Project Report minimum 4
pages) Title Title of Micro-Project : - Process scheduling
1.0 Rationale (Importance of the project, in about 30 to 50 words.
This is a modified version of the earlier one written after the work)
Process Scheduling is an OS task that schedules processes of different states like ready, waiting,
and running.
Process scheduling allows OS to allocate a time interval of CPU execution for each process.
Another important reason for using a process scheduling system is that it keeps the CPU busy
all the time.
This allows you to get the minimum response time for programs.
3.0) Course Outcomes Achieved (Add to the earlier list is more Cos are addressed)
A literature review for a micro project on process scheduling should provide an overview of
the key concepts, theories, and research related to process scheduling in computer science
and operating systems.
• https://www.tutorialspoint.com/operating_system/os_process_scheduling.htm
• https://www.guru99.com/process-scheduling.html
Discuss the evolution f scheduling techniques and how they have adapted to
changing hardware and software environments
• https://www.tutorialspoint.com/operating_system/os_process_scheduling_algorithms.htm
In this website we searched and discuss about various scheduling algorithms, including:
o First-come-first-serve (FCFS)
o Shortest job first (SJF)
o Round Robin (RR)
o Priority Scheduling
o Multilevel Queue Scheduling.
o Multilevel Feedback Queue Scheduling
o Lottery Scheduling
o Real- Time Scheduling Algorithms
• https://www.guru99.com/process-scheduling.html
we refer above website for understanding and collecting some diagrams and
important notes about process scheduling.
5.0 Actual Methodology Followed (Write step wise work done, data collected and
its analysis (if any). The contribution of individual member may also be noted.)
7.0 Outputs of the micro projects (Drawings of the prototype, drawing of survey,
Presentation of collected data, findings etc.)
a. The process scheduling is the activity of the process manager that handles the removal of the running
process from the CPU and the selection of another process on the basis of a particular strategy.
b. Process scheduling is an essential part of a Multiprogramming operating systems.
c. Such operating systems allow more than one process to be loaded into the executable memory at a time
and the loaded process shares the CPU using time multiplexing.
PROCESS SCHEDULING
The process scheduling is the activity of the process manager that handles the removal of the running process from the
CPU and the selection of another process on the basis of a particular strategy.
Process scheduling is an essential part of a Multiprogramming operating systems. Such operating systems allow more than
one process to be loaded into the executable memory at a time and the loaded process shares the CPU using time
multiplexing.
The Operating System maintains the following important process scheduling queues –
• Job queue − This queue keeps all the processes in the system.
• Ready queue − This queue keeps a set of all processes residing in main memory, ready and
waiting to execute. A new process is always put in this queue.
• Device queues − The processes which are blocked due to unavailability of an I/O device
constitute this queue.
The OS can use different policies to manage each queue (FIFO, Round Robin, Priority, etc.). The OS
scheduler determines how to move processes between the ready and run queues which can only have
one entry per processor core on the system; in the above diagram, it has been merged with the CPU.
1
Running
When a new process is created, it
enters into the system as in the
running state.
2
Not Running
Processes that are not running are
kept in queue, waiting for their turn to
execute. Each entry in the queue is a
pointer to a particular process. Queue
is implemented by using linked list.
Use of dispatcher is as follows. When
a process is interrupted, that process
is transferred in the waiting queue. If
the process has completed or
aborted, the process is discarded. In
either case, the dispatcher then
selects a process from the queue to
execute.
Schedulers
Schedulers are special system software which handle process scheduling in various ways. Their main
task is to select the jobs to be submitted into the system and to decide which process to run.
Schedulers are of three types
–
Long-Term Scheduler
Short-Term Scheduler
Medium-Term Scheduler
The primary objective of the job scheduler is to provide a balanced mix of jobs, such as I/O bound
and processor bound. It also controls the degree of multiprogramming. If the degree of
multiprogramming is stable, then the average rate of process creation must be equal to the average
departure rate of processes leaving the system.
On some systems, the long-term scheduler may not be available or minimal. Time-sharing operating
systems have no long term scheduler. When a process changes the state from new to ready, then there
is use of long term scheduler.
Short-term schedulers, also known as dispatchers, make the decision of which process to execute
next. Short term schedulers are faster than long-term schedulers.
A running process may become suspended if it makes an I/O request. A suspended processes cannot
make any progress towards completion. In this condition, to remove the process from memory and
make space for other processes, the suspended process is moved to the secondary storage. This
process is called swapping, and the process is said to be swapped out or rolled out. Swapping may be
necessary to improve the process mix.
Context Switch
A context switch is the mechanism to store and restore the state or context of a CPU in Process Control
block so that a process execution can be resumed from the same point at a later time. Using this
technique, a context switcher enables multiple processes to share a single CPU. Context switching is an
essential part of a multitasking operating system features.
When the scheduler switches the CPU from executing one process to execute another, the state from the
current running process is stored into the process control block. After this, the state for the process to
run next is loaded from its own PCB and used to set the PC, registers, etc. At that point, the second
process can start executing.
Context switches are computationally intensive since register and memory state must be saved and
restored. To avoid the amount of context switching time, some hardware systems employ two or more
sets of processor registers. When the process is switched, the following information is stored for later
use.
• Program Counter
• Scheduling information
• Base and limit register value
• Currently used register
• Changed State
• I/O State information
• Accounting information
Summary
• Process scheduling is an OS task that schedules the processes of different states like ready,
waiting, and running.
• Two-state process models are 1) Running, and )Not Running
• Process scheduling maximizes the number of interactive users, within acceptable response
times.
• A scheduler is a type of system software that allows you to handle process scheduling.
• Three types of the scheduler are 1) Long term 2) Short term 3) Medium-term
• Long term scheduler regulates the program and select process from the queue and loads
them into memory for execution.
• The medium-term scheduler enables you to handle the swapped out-processes.
• The main goal of short term scheduler is to boost the system performance according to set
criteria
• Long term is also known as a job scheduler, whereas the short term is also known as CPU
scheduler, and the medium-term is also called swapping scheduler.
THANK YOU…!