Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorChandak, A V-
dc.contributor.authorSahoo, Bibhudatta-
dc.contributor.authorTuruk, A K-
dc.identifier.citationInt. J. Advanced Networking and Applications, Volume: 02, Issue: 05, Pages: 804-810 (2011)en
dc.descriptionCopyright for this article belongs to IJANAen
dc.description.abstractTask allocation in computational grid is NP complete. Heuristic techniques have been widely used by the researchers to solve task allocation problem in grid computing. In this paper we survey heuristic based task allocation strategies and their efficiency. This strategy optimizes various performance parameters such as makespan, resource utilization, response time, workload balancing, service reliability, fairness deviation and throughput. A task life cycle model has been suggested in computational grid. We have also proposed a classification of heuristic task allocation strategies for computational grid.en
dc.format.extent167268 bytes-
dc.subjectTask allocationen
dc.subjectGrid Computingen
dc.subjectHeuristic Classificationen
dc.titleHeuristic Task Allocation Strategies for Computational Griden
Appears in Collections:Journal Articles

Files in This Item:
File Description SizeFormat 
Heuristic allocation.pdf163.35 kBAdobe PDFView/Open

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