Please use this identifier to cite or link to this item:
http://hdl.handle.net/2080/1482
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chandak, A V | - |
dc.contributor.author | Sahoo, Bibhudatta | - |
dc.contributor.author | Turuk, A K | - |
dc.date.accessioned | 2011-07-07T09:18:53Z | - |
dc.date.available | 2011-07-07T09:18:53Z | - |
dc.date.issued | 2011 | - |
dc.identifier.citation | Int. J. Advanced Networking and Applications, Volume: 02, Issue: 05, Pages: 804-810 (2011) | en |
dc.identifier.uri | http://hdl.handle.net/2080/1482 | - |
dc.description | Copyright for this article belongs to IJANA | en |
dc.description.abstract | Task 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.extent | 167268 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.language.iso | en | - |
dc.subject | Task allocation | en |
dc.subject | Grid Computing | en |
dc.subject | Heuristic Classification | en |
dc.title | Heuristic Task Allocation Strategies for Computational Grid | en |
dc.type | Article | en |
Appears in Collections: | Journal Articles |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Heuristic allocation.pdf | 163.35 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.