Scribd
Upload
12 views

Scheduling Algorithms

Uploaded by

Zine Abidine
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
12 views

Scheduling Algorithms

Uploaded by

Zine Abidine
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 9

Scheduling

Algorithms

Presented by Supervised By
Zine El Abidine ACHAGHOUR Prof. BOUFALA
Aziz ESSADEQ
Reda El BETTIOUI
TABLE OF
CONTENTS

Introduction
Why Scheduling Algorithms ?
Scheduling Problem Formulation
Types of Scheduling Algorithmes
Introduction to FIFO and Round Robin
INTRODUCTION

Imagine you're the manager of a bustling restaurant with limited seating capacity.

Customers arrive at different times, each wanting to be seated promptly and served their

meals without undue delay. Just as you need to efficiently allocate tables and coordinate

food preparation to ensure customer satisfaction, scheduling algorithms play a similar role

in computer systems and real-world scenarios.


WHY SCHEDULING ALGOS
Scheduling algorithms are essential for optimizing resource utilization and maximizing

efficiency in diverse contexts. Whether it's managing tasks in a CPU, scheduling

appointments in a healthcare facility, or organizing deliveries for an e-commerce platform,

scheduling algorithms help ensure smooth operations and timely execution. Much like

orchestrating the seating arrangements and meal service in a busy restaurant, scheduling

algorithms allocate resources and coordinate tasks to achieve optimal outcomes.


SCHEDULING PROBLEM FORMULATION
Objective: The objective of scheduling algorithms is typically to optimize some
performance metric, such as minimizing makespan (total completion time), minimizing
total tardiness, maximizing resource utilization, or balancing workload across resources.
TYPES OF SCHEDULING ALGOS
Priority-Based Scheduling: Shortest Job First (SJF):

Assigns priorities to tasks based on criteria like importance or urgency. Selects the task with the shortest processing time for execution next.

Examples: Priority Scheduling, Earliest Deadline First (EDF). Variants: Shortest Remaining Time First (SRTF).

Round Robin (RR): First-Come, First-Served (FCFS):

Allocates fixed time slices to tasks in a cyclic manner. Executes tasks in the order they arrive.

Ensures fairness by providing equal opportunity to all tasks. Simple and easy to implement.

Least Slack Time Scheduling (LSTS): Multi-Level Feedback Queue (MLFQ):

Considers both processing time and slack time of tasks. Uses multiple queues with different priority levels.

Aims to maximize idle time remaining after completing all tasks. Tasks are promoted or demoted between queues based on performance.
FIFO AND ROUND ROBIN ( RR )

FIFO, or First-In-First-Out, is one of the simplest scheduling algorithms. It follows the

principle of processing tasks in the order they arrive. Tasks are queued up and executed one

by one, with the first task to arrive being the first to be processed. FIFO scheduling is easy to

implement and ensures fairness, but it may lead to longer waiting times for later-arriving

tasks, especially if earlier tasks are long-running.


FIFO AND ROUND ROBIN ( RR )

Round Robin is a widely-used time-sharing scheduling algorithm. It allocates fixed time

slices, called time quanta, to tasks in a cyclic manner. Tasks run for their time quantum, and

if not completed, they're preempted, allowing other tasks to execute. Round Robin ensures

fairness by giving equal CPU time to tasks but may face high overhead from frequent

context switches, particularly with short time quanta.


DEMO

You might also like