Experimental performance analysis of job scheduling algorithms on computational grid using real workload traces
Grid, an infrastructure for resource sharing, currently has shown its importance in many scientific applications requiring tremendously high computational power. Grid computing, whose resources are distributed, heterogeneous and dynamic in nature, introduces a number of fascinating issues in job sch...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Published: |
EAI
2017
|
| Online Access: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85032380630&partnerID=40&md5=99dd68cf9fce8f88f4a6c4ab1af52250 http://eprints.utp.edu.my/20125/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Universiti Teknologi Petronas |
| Summary: | Grid, an infrastructure for resource sharing, currently has shown its importance in many scientific applications requiring tremendously high computational power. Grid computing, whose resources are distributed, heterogeneous and dynamic in nature, introduces a number of fascinating issues in job scheduling. Grid scheduler is the core component of a grid and is responsible for efficient and effective utilization of heterogeneous and distributed resources. This paper presents comparative performance analysis of our proposed job scheduling algorithm with other well known job scheduling algorithms considering the quality of service parameters. The main thrust of this work was to conduct a quality of service based experimental performance evaluation of job scheduling algorithms on computational Grid in true dynamic environment. Experimental evaluation confirmed that proposed scheduling algorithms possess a high degree of optimality in performance, efficiency and scalability. This paper includes statistical analysis of real workload traces to present the nature and behavior of jobs. |
|---|