Please use this identifier to cite or link to this item:
Title: MSSA: A M-Level Sufferage-Based Scheduling Algorithm in Grid Environment
Authors: Panda, S K
Khilar, P M
Keywords: Scheduling algorithm
Grid environment
Directed acyclic graph
Issue Date: 2013
Publisher: Springer-Verlag Berlin Heidelberg
Citation: C. Hota and P.K. Srimani (Eds.): ICDCIT 2013, LNCS 7753, pp. 410–419, 2013.
Abstract: Scheduling is an emergent area in Grid Environment. It is essential to utilize the processors efficiently and minimize the schedule length. In Grid Environment, tasks are dependent on each other. We use Directed Acyclic Graph (DAG) to solve task scheduling problems. In this paper, we have proposed a new scheduling algorithm called M-Level Sufferage-based Scheduling Algorithm (MSSA) for minimizing the schedule length. It has twophase process: m-level and sufferage value. M-level is used to calculate the earliest time. Sufferage is used to assign priority and select an optimal machine. MSSA always gives optimal or sub-optimal solution. Our result shows better results than other scheduling algorithms such as MET, MCT, Min-Min and Max-Min with respect to scheduling length and resource utilization.
Description: Copyright for this paper belongs to Springer-Verlag Berlin Heidelberg
Appears in Collections:Conference Papers

Files in This Item:
File Description SizeFormat 
MSSA A M-Level.pdf292.72 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.