Please use this identifier to cite or link to this item: http://localhost:8081/xmlui/handle/123456789/13083
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKumar, M. Arun-
dc.date.accessioned2014-12-05T05:19:43Z-
dc.date.available2014-12-05T05:19:43Z-
dc.date.issued2006-
dc.identifierM.Techen_US
dc.identifier.urihttp://hdl.handle.net/123456789/13083-
dc.guideSarje, A. K.-
dc.description.abstractLoad balanced task scheduling is very important problem in complex grid environment. Finding optimal schedules for such an environment is an NP-hard problem, and so heuristic approaches must be used. Ant-algorithm is a heuristic task scheduling algorithm which is distributable, scalable and fault tolerant. It uses the state prediction of the resources for scheduling which is necessary for effective utilization of resources. In this dissertation work, an enhanced ant-algorithm for task scheduling in grid is proposed which gives better throughput with a controlled cost. The simulation results of various scheduling algorithms are also compared. The results also show that the enhanced version works better than the ant-algorithm. The inclusion of price factor into the ant-algorithm makes this new scheduling algorithm more suitable for wide use.en_US
dc.language.isoenen_US
dc.subjectELECTRONICS AND COMPUTER ENGINEERINGen_US
dc.subjectANT ALGORITHMen_US
dc.subjectTASK SCHEDULINGen_US
dc.subjectGRID COMPUTINGen_US
dc.titleCOST EFFECTIVE ENHANCED ANT ALGORITHM BASED LOAD BALANCING TASK SCHEDULING IN GRID COMPUTINGen_US
dc.typeM.Tech Dessertationen_US
dc.accession.numberG12713en_US
Appears in Collections:MASTERS' THESES (E & C)

Files in This Item:
File Description SizeFormat 
G12713.pdf2.73 MBAdobe PDFView/Open


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