@inproceedings{scholars2829,
            year = {2012},
         journal = {2012 International Conference on Computer and Information Science, ICCIS 2012 - A Conference of World Engineering, Science and Technology Congress, ESTCON 2012 - Conference Proceedings},
            note = {cited By 0; Conference of 2012 International Conference on Computer and Information Science, ICCIS 2012 - A Conference of World Engineering, Science and Technology Congress, ESTCON 2012 ; Conference Date: 12 June 2012 Through 14 June 2012; Conference Code:93334},
           pages = {700--705},
           title = {QoS based performance evaluation of grid scheduling algorithms},
             doi = {10.1109/ICCISci.2012.6297118},
          volume = {2},
         address = {Kuala Lumpur},
             url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84867889038&doi=10.1109\%2fICCISci.2012.6297118&partnerID=40&md5=2311b97b4cfd20f7747d04effa0728f4},
            isbn = {9781467319386},
        keywords = {Cluster; Distributed systems; Grid scheduling; Parallel processing; Performance evaluation; Simulation; Task synchronization; Workload modeling, Information science; Quality of service; Resource allocation; Scheduling; Technology; Turnaround time, Grid computing},
          author = {Nasir Mehmood Shah, S. and Mahmood, A. K. B. and Oxley, A. and Zakaria, M. N.},
        abstract = {A Grid is a computational system consisting of a large number of geographically distributed and heterogeneous resources. Job scheduling is the key component of a Grid, and plays an important role in the efficient and effective execution of various kinds of scientific and engineering applications. This paper presents a comparative performance analysis of our proposed job scheduling algorithms along with other well known job scheduling algorithms, considering the quality of service (QoS) parameters such as waiting time, turnaround time, response time, total completion time, bounded slowdown and stretch time. The main thrust of this work was to conduct a QoS based evaluation of the scheduling algorithms on an experimental Grid using real workload traces. The experimental evaluation confirmed that the proposed scheduling algorithms possess a high degree of optimality in performance, efficiency and scalability. {\^A}{\copyright} 2012 IEEE.}
}