Please use this identifier to cite or link to this item: http://hdl.handle.net/2080/1864
Full metadata record
DC FieldValueLanguage
dc.contributor.authorPanda, S K-
dc.contributor.authorKhilar, P M-
dc.date.accessioned2013-02-27T09:29:51Z-
dc.date.available2013-02-27T09:29:51Z-
dc.date.issued2013-02-
dc.identifier.citation2013 3rd IEEE International Advance Computing Conference (IACC), 22-23 Feb 2013, Ajay Kumar Garg Engineering College (AKGEC), Ghaziabad, New Delhien
dc.identifier.urihttp://hdl.handle.net/2080/1864-
dc.descriptionCopyright belongs to IEEEen
dc.description.abstractTask scheduling is the most challenging work in grid environment. Scheduling approach is based on various criteria’s like Quality of Service (QoS), deadline, security, the arrival time of the task, suffrage value etc. It is difficult to get the optimal solution with a unified approach. In this paper, we propose a threshold based technique to decide the task assignments to the machines. It also describes a value to balance the load. Our experimental analysis shows better results than traditional task scheduling algorithms such as Minimum Execution Time (MET), Minimum Completion Time (MCT), Min-Min, Max-Min, KPercent Best (KPB) and sufferage heuristic.en
dc.format.extent240228 bytes-
dc.format.mimetypeapplication/pdf-
dc.language.isoen-
dc.subjectthreshold based schedulingen
dc.subjectgrid environmenten
dc.subjectheterogeneousen
dc.subjecttask schedulingen
dc.subjectquality of serviceen
dc.titleTBS: A Threshold Based Scheduling in Grid Environmenten
dc.typeArticleen
Appears in Collections:Conference Papers

Files in This Item:
File Description SizeFormat 
IACC1001340.pdf234.6 kBAdobe PDFView/Open


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