MP3-1

PROCESSOR SCHEDULING ALGORITHMS

I. Objective
In this machine problem, students will be able to discuss and understand

the different processor scheduling algorithms. Also, students will be able to

execute the different algorithms using their chosen programming language

II. Introduction

III. Processor Scheduling Algorithms and Applications

REFERENCE:

MP3-2
PROCESS SCHEDULING ALGORITHMS
 I. Objective
In this machine problem, students will be able to discuss and understand
the different process scheduling algorithms. Also, students will be able to execute
the different algorithms using their chosen programming language
II. Introduction

In Operating System the word "process" is can be defined as a dynamic

unit that requires a set of resources, including a processor and special
registers, to execute its task. A single instance of a program in execution is a
also a process. Process is can be also called as a task.

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 the important 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.

In executing a certain scenario, The Process Scheduler first determines

the set of steps that will be executed in making a decision thats also based on
certain criteria.

Process Scheduler uses six process scheduling algorithms in order to

take care of the immediate requests of interactive users. These six types of
processing scheduling algorithm are First-Come, First-Served (FCFS), Shortest
Job Next (FJN), Priority Scheduling, Shortest Remaining Time (SRT), Round
Robin, and Multiple-Level Queues.

These algorithms are either non-preemptive or preemptive. Non-

preemptive algorithms are designed so that once a process enters the running
state, it cannot be preempted until it completes its allotted time, whereas the
preemptive scheduling is based on priority where a scheduler may preempt a
 low priority running process anytime when a high priority process enters into a
ready state.

III. Process Scheduling Algorithms and Applications

REFERENCE:

T. (n.d.). Operating System - Process Scheduling. Retrieved February 20, 2017, from
https://www.tutorialspoint.com/operating_system/os_process_scheduling.htm

CPU Scheduling in OS | Operating System Tutorial | Studytonight. (n.d.). Retrieved

February 22, 2017, from http://www.studytonight.com/operating-system/cpu-scheduling