eprintid: 2626
rev_number: 2
eprint_status: archive
userid: 1
dir: disk0/00/00/26/26
datestamp: 2023-11-09 15:50:52
lastmod: 2023-11-09 15:50:52
status_changed: 2023-11-09 15:43:55
type: conference_item
metadata_visibility: show
creators_name: Abba, H.A.
creators_name: Shah, S.N.M.
creators_name: Zakaria, N.B.
creators_name: Pal, A.J.
title: Deadline based performance evaluation of job scheduling algorithms
ispublished: pub
keywords: Comparative performance analysis; Deadline constraint; Deadline-based scheduling algorithms; Dynamic scheduling; EDF; Grid scheduling; Grid scheduling systems; Job execution; Job scheduling algorithms; Management techniques; Maximum tardiness; Operation research; Optimal performance; PDSA; Performance comparison; Performance evaluation; Resource usage; RR and Deadline; Synthetic workloads, Response time (computer systems); Scheduling; Scheduling algorithms; Turnaround time, Grid computing
note: cited By 8; Conference of 4th International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, CyberC 2012 ; Conference Date: 10 October 2012 Through 12 October 2012; Conference Code:94895
abstract: Grid scheduling is one of the prime challenges in grid computing. Reliability, efficiency (with regard to time utilization), effectiveness in resource usage, as well as robustness tend to be the demanded features of Grid scheduling systems. A number of algorithms have been designed and developed in order to make effective Grid scheduling. Project management is the well known area of operation research. Here we are proposing a new prioritized deadline based scheduling algorithm (PDSA) using project management technique for efficient job execution with deadline constraints of users' jobs. An extensive performance comparison has been presented using synthetic workload traces to evaluate the efficiency and robustness of grid scheduling with respect to average turnaround times and maximum tardiness. Result has shown improved performance under dynamic scheduling environment. Based on the comparative performance analysis, proposed PDSA has shown the optimal performance as compared to EDF and RR scheduling algorithms under dynamic scheduling environment. In brief, PDSA is the true application of project management in grid computing. © 2012 IEEE.
date: 2012
official_url: https://www.scopus.com/inward/record.uri?eid=2-s2.0-84872361254&doi=10.1109%2fCyberC.2012.25&partnerID=40&md5=22a755e3b86ba03a5b1c69786ed799f1
id_number: 10.1109/CyberC.2012.25
full_text_status: none
publication: Proceedings of the 2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, CyberC 2012
place_of_pub: Sanya
pagerange: 106-110
refereed: TRUE
isbn: 9780769548104
citation:   Abba, H.A. and Shah, S.N.M. and Zakaria, N.B. and Pal, A.J.  (2012) Deadline based performance evaluation of job scheduling algorithms.  In: UNSPECIFIED.