Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorPanda, S K-
dc.contributor.authorAgrawal, P-
dc.contributor.authorMohapatra, Durga Prasad-
dc.identifier.citationInternational Conference on Green Computing Communication and Electrical Engineering (ICGCCEE), IEEE, 6-8th September 2014, Kalapatti, Coimbatore, Indiaen
dc.descriptionCopyright belongs to proceeding publisheren
dc.description.abstractScheduling is an important aspect in grid computing. Now-a-days, the computational grids are the important platform for job scheduling. The performance of the computational grids can be improved using an efficient scheduling heuristic. In job scheduling, a user submits the job to the grid resource broker. Then the broker is responsible for dividing the job into a number of tasks. Moreover, it also maps the tasks and the resources to find the perfect match. The primary goal of scheduling is to minimize the processing time and maximize the resource utilization. In this paper, we have proposed three immediate mode heuristics such as First-DualMake, Best-DualMake and Worst-DualMake (named as XDualMake).These heuristic are scheduled based on the resource idle time. We have also presented five existing heuristics such as MET, MCT, OLB, KPB and SA. The eight heuristics are simulated and the experimental results are discussed. The heuristics are compared using two performance measures makespan and resource utilization.en
dc.format.extent445938 bytes-
dc.subjectGrid Computingen
dc.subjectImmediate Modeen
dc.subjectGrid Resource Brokeren
dc.subjectData Seten
dc.titleX-DualMake: Novel Immediate Mode Scheduling Heuristics in Computational Gridsen
Appears in Collections:Conference Papers

Files in This Item:
File Description SizeFormat 
X-DualMake Novel Immediate Mode Scheduling Heuristics in Computational Grids.pdf435.49 kBAdobe PDFView/Open

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