COMPARATIVE PERFORMANCE OF SOME HYBRID HEURISTICS SCHEDULING ALGORITHMS BASED ON SLTR AND DEADLINE FOR COMPUTATIONAL GRID
Grid computing can be described as form of distributed computing that involves collection ofindependent computers coordinating and sharing computing, application, data storage or network resources using high speed networks across dynamic and geographically distributed environment. Grid scheduling...
Saved in:
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | English |
| Published: |
2013
|
| Subjects: | |
| Online Access: | http://utpedia.utp.edu.my/22457/1/209354~1.PDF http://utpedia.utp.edu.my/22457/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Grid computing can be described as form of distributed computing that involves
collection ofindependent computers coordinating and sharing computing, application,
data storage or network resources using high speed networks across dynamic and
geographically distributed environment. Grid scheduling is an essential element of a
Computational Grid infrastructure. Typical scheduling challenges tend to be NP complete problems where there is no optimal solution. Research on Grid scheduling
focuses in solving three challenges: finding a good algorithm, automating the process,
and developing a scalable, robust and efficient scheduling mechanism. The
complexities involved in scheduling challenges increase with the size ofthe Grid. |
|---|