{"id":1101,"date":"2024-03-27T12:26:26","date_gmt":"2024-03-27T12:26:26","guid":{"rendered":"https:\/\/learnlearn.uk\/ibcs\/?page_id=1101"},"modified":"2024-03-27T12:39:05","modified_gmt":"2024-03-27T12:39:05","slug":"fcfs-easy-backfilling-scheduling-algorithms","status":"publish","type":"page","link":"https:\/\/learnlearn.uk\/ibcs\/fcfs-easy-backfilling-scheduling-algorithms\/","title":{"rendered":"FCFS & EASY Backfilling Scheduling Algorithms"},"content":{"rendered":"
\n

FCFS<\/h2>\n
\n\n

FCFS (First Come First Served)<\/h3>\n

\"\"<\/p>\n

FCFS is one of the simplest scheduling algorithms, where processes are executed in the order they arrive in the ready queue.
\nThe first process to arrive is the first to be executed, following the principle of “first come, first served.”
\nFCFS does not prioritize processes based on their size or other factors and treats all processes equally in terms of execution order.<\/p>\n\n<\/div>

EASY Backfilling<\/h2>\n
\n\n

Earliest Available Start-time Yielding (EASY) Backfilling<\/h3>\n

\"\"<\/p>\n

EASY backfilling is a scheduling algorithm used in parallel computing environments to improve resource utilization. It allows smaller jobs to fill gaps in the schedule ahead of larger jobs, as long as doing so does not delay the execution of the larger jobs.
\nThe algorithm aims to reduce idle time and improve overall system efficiency by flexibly scheduling smaller jobs when possible.<\/p>\n

EASY backfilling considers the earliest available start time for jobs and prioritizes smaller jobs to fill gaps in the schedule.<\/p>\n\n<\/div>

Video<\/h2>\n
\n\n

Topic Tutorial Video<\/h3>\n
\n
https:\/\/youtu.be\/fjeJX7x_uMs?si=FRXeXu4sXuHrboxB<\/a>