loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
16th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP 2008)
The Impact of Under-Estimated Length of Jobs on EASY-Backfill Scheduling
February 13-February 15
ISBN: 978-0-7695-3089-5
The issue of under-estimated length of jobs (parallel applications) on backfill-based scheduling is ignored in the current literature because users want to avoid their jobs to be killed when the requested time expires. Therefore, users prefer to over-estimate the length of their jobs. This paper shows the impact of under-estimated length of jobs on their execution performance in an EASY-backfill scheduling-based system. We have developed a batch job scheduler for Linux clusters that implements an enhanced EASY-backfilling algorithm in such a way that a job with an under-estimated execution time would not be killed unless it would delay other jobs. We have carried out performance evaluation by scheduling static workloads of well known MPI parallel applications on a real cluster. Our results show that most of the jobs do not have to be aborted even though their job lengths are under-estimated whereas the slowdown of jobs and the throughput of the system are only slightly degraded.
Index Terms:
Under-Estimation, EASY-Backfill Scheduling, Parallel Jobs, Computer Clusters
Citation:
Adam K.L. Wong, Andrzej M. Goscinski, "The Impact of Under-Estimated Length of Jobs on EASY-Backfill Scheduling," pdp, pp.343-350, 16th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP 2008), 2008
Usage of this product signifies your acceptance of the Terms of Use.