Multicore scheduling algorithms For effective resource utilization

Abstract

Multicore processors have become the defacto standard today and newlinethis has led to renewed interest in multiprocessor scheduling There are many newlinefactors that need to be considered while designing scheduling algorithms for newlinemulticore processors These factors include reduction of overheads due to task newlinemigration preemption effective slack utilization and appropriate handling of newlinetask dependencies This will lead to effective resource utilization and newlineimproved task schedulability This thesis work has proposed four different newlinescheduling algorithms that tackle these issues and aim at effective resource newlineutilization newlineSeveral researchers as a means of avoiding wastage of resource newlinehave looked at fairness strategies that grant resources to tasks based on their newlineactual requirement Proportionate fairness is one such strategy that grants newlineresources to tasks based on the minimal resource requirement However the newlineproportionate fairness approach is rigid as it does not allow subtasks to be newlinescheduled if they miss their respective slots and keeps the processor idle when newlinesubtasks await execution newline newline