Paper Details: Downloads: 2327
Serial Number: P1121705544
Title: Enhancing the Minimum Average Scheduling Algorithm (MASA) based on Makespan Minimizing
Authors: Afaf Abd Elkader Abd Elhafiz
Abstract: The process of assigning tasks to resources with the aim of optimizing some objective is known as scheduling. Many algorithms are used to schedule tasks on their resources. One of these algorithms is the MASA scheduling algorithm which depends on max-min scheduling algorithm. A drawback of the max-min scheduling algorithm is that; the execution of tasks with maximum execution time first, increases the makespan, and leads to a delay in executing tasks with minimum execution times. The proposed algorithm e-MASA selects the task whose completion time is equal to (or the nearest to) the arithmetic mean of the minimum completion times of the remaining tasks. The proposed algorithm minimizes the makespan.
Keywords: Distributed system Scheduling, Scheduling algorithm, Max – min algorithm, Minimum Average Scheduling Algorithm, e-MASA
Journal/Conference: International Journal of Artificial Intelligence and Machine Learning
Volume: 17
Issue: 1
Submission Date: 1/31/2017 12:00:00 AM
Review Date: 2/23/2017 12:00:00 AM
Publishing Date: 3/20/2017 12:00:00 AM
Article Downloads: 2327
Download:

Facebook