Performance comparison of least slack time based heuristics for job scheduling on computational grid
In recent years, increasing demand for computing has led to the development of computational grid. Typically scheduling challenges tend to be NP-hard problems where there is no optimal solution. The research reported here therefore is focused on the development of hybrids scheduling algorithms based...
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
Institute of Electrical and Electronics Engineers Inc.
2014
|
| Online Access: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-84938771267&doi=10.1109%2fICCOINS.2014.6868841&partnerID=40&md5=ef207cfceabad96aa1f8ea03258cd187 http://eprints.utp.edu.my/31237/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | In recent years, increasing demand for computing has led to the development of computational grid. Typically scheduling challenges tend to be NP-hard problems where there is no optimal solution. The research reported here therefore is focused on the development of hybrids scheduling algorithms based on deadline and slack time parameters and its variations, using the concept of optimization techniques. An extensive performance comparison has been presented using real workload traces as benchmark on a grid computational environment. The results were compared with some baseline scheduling approaches in extant literature. The results have shown that the performances of grid scheduling algorithms developed and reported in this paper give good results in most of the cases and also support true scalability, when in the scenario of increasing workload and number of processors on a computational grid environment. © 2014 IEEE. |
|---|