Please use this identifier to cite or link to this item: http://hdl.handle.net/2080/1859
Full metadata record
DC FieldValueLanguage
dc.contributor.authorPanda, S K-
dc.contributor.authorKhilar, P M-
dc.date.accessioned2013-02-12T10:47:05Z-
dc.date.available2013-02-12T10:47:05Z-
dc.date.issued2013-
dc.identifier.citationC. Hota and P.K. Srimani (Eds.): ICDCIT 2013, LNCS 7753, pp. 410–419, 2013.en
dc.identifier.urihttp://hdl.handle.net/2080/1859-
dc.descriptionCopyright for this paper belongs to Springer-Verlag Berlin Heidelbergen
dc.description.abstractScheduling 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.en
dc.format.extent299750 bytes-
dc.format.mimetypeapplication/pdf-
dc.language.isoen-
dc.publisherSpringer-Verlag Berlin Heidelbergen
dc.subjectScheduling algorithmen
dc.subjectGrid environmenten
dc.subjectM-levelen
dc.subjectSufferageen
dc.subjectDirected acyclic graphen
dc.subjectMakespanen
dc.titleMSSA: A M-Level Sufferage-Based Scheduling Algorithm in Grid Environmenten
dc.typeArticleen
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.