Scribd
Upload
23 views

Project Proposal

This document provides an overview of process scheduling and different scheduling algorithms. It discusses that the scheduler manages running processes and uses algorithms to service different types of processes. It then describes three common scheduling algorithms: First-Come-First-Served (FCFS) which services processes in the order they arrive; Round-robin which assigns equal time slices to each process in circular order; and MLFQ which gives preference to shorter jobs and I/O bound processes to efficiently utilize system resources.

Uploaded by

amu1122
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
23 views

Project Proposal

This document provides an overview of process scheduling and different scheduling algorithms. It discusses that the scheduler manages running processes and uses algorithms to service different types of processes. It then describes three common scheduling algorithms: First-Come-First-Served (FCFS) which services processes in the order they arrive; Round-robin which assigns equal time slices to each process in circular order; and MLFQ which gives preference to shorter jobs and I/O bound processes to efficiently utilize system resources.

Uploaded by

amu1122
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

PROCESS SCHEDULING

PROJECT ABSTRACT

GROUP MEMBERS:
Aysha Tariq 191 Umber Saleem 216 Sundas Batool Shaukat 213

Introduction: Scheduler manages the running processes in the system. It is an integral part of the system. A scheduler runs different algorithms to service running different processes. Different scheduling algorithms are better for particular application types. y y y Real Time Batch User Interactive

In general scheduler uses clock to make sure that a process do not run for too long. Process Scheduling Process scheduling plays a vital role in determining the efficiency of the system. Process scheduling algorithms are used to ensure that the components of the system would be able to maximize its utilization and able to complete all the processes assigned in a specified period of time. Different scheduling algorithms are First-Come-First-Served (FCFS) Scheduling First-Come-First-Served algorithm is the simplest scheduling algorithm. Processes are dispatched according to their arrival time on the ready queue. Once a process has a CPU, it runs to completion which means that other processes have to wait until the process currently present in the CPU gets completed. Round-robin scheduling Round-robin (RR) is one of the simplest scheduling algorithms for processes in an operating system, which assigns time slices to each process in equal portions and in circular order, handling all processes without priority. MLFQ Scheduling It is intended to meet the following design requirements for multimode systems: 1. Give preference to short jobs. 2. Give preference to I/O bound processes. 3. Quickly establish the nature of a process and schedule the process accordingly.

Our major objective will be to utilize the system resources efficiently and effectively.

You might also like