Advanced Search
DSpace@MIT

Provably Efficient Adaptive Scheduling for Parallel Jobs

Research and Teaching Output of the MIT Community

Show simple item record

dc.contributor.author He, Yuxiong
dc.contributor.author Hsu, Wen Jing
dc.contributor.author Leiserson, Charles E.
dc.date.accessioned 2007-01-23T19:26:59Z
dc.date.available 2007-01-23T19:26:59Z
dc.date.issued 2007-01
dc.identifier.uri http://hdl.handle.net/1721.1/35779
dc.description.abstract Scheduling competing jobs on multiprocessors has always been an important issue for parallel and distributed systems. The challenge is to ensure global, system-wide efficiency while offering a level of fairness to user jobs. Various degrees of successes have been achieved over the years. However, few existing schemes address both efficiency and fairness over a wide range of work loads. Moreover, in order to obtain analytical results, most of them require prior information about jobs, which may be difficult to obtain in real applications. This paper presents two novel adaptive scheduling algorithms -- GRAD for centralized scheduling, and WRAD for distributed scheduling. Both GRAD and WRAD ensure fair allocation under all levels of workload, and they offer provable efficiency without requiring prior information of job's parallelism. Moreover, they provide effective control over the scheduling overhead and ensure efficient utilization of processors. To the best of our knowledge, they are the first non-clairvoyant scheduling algorithms that offer such guarantees. We also believe that our new approach of resource request-allotment protocol deserves further exploration. Specifically, both GRAD and WRAD are O(1)-competitive with respect to mean response time for batched jobs, and O(1)-competitive with respect to makespan for non-batched jobs with arbitrary release times. The simulation results show that, for non-batched jobs, the makespan produced by GRAD is no more than 1.39 times of the optimal on average and it never exceeds 4.5 times. For batched jobs, the mean response time produced by GRAD is no more than 2.37 times of the optimal on average, and it never exceeds 5.5 times. en
dc.description.sponsorship Singapore-MIT Alliance (SMA) en
dc.format.extent 142623 bytes
dc.format.mimetype application/pdf
dc.language.iso en en
dc.relation.ispartofseries Computer Science (CS) en
dc.subject Adaptive Scheduling en
dc.subject Competitive Analysis en
dc.subject Data-parallel Computing en
dc.subject Greedy Scheduling en
dc.subject Instantaneous Parallelism en
dc.subject Job Scheduling en
dc.subject Makespan en
dc.subject Mean Response Time en
dc.subject Multiprocessing en
dc.subject Multiprogramming en
dc.subject Parallelism Feedback en
dc.subject Parallel Computation en
dc.subject Processor Allocation en
dc.subject Span en
dc.subject Thread Scheduling en
dc.subject Two-level Scheduling en
dc.subject Space Sharing en
dc.subject Trim Analysis en
dc.subject Work en
dc.subject Work-stealing en
dc.title Provably Efficient Adaptive Scheduling for Parallel Jobs en
dc.type Article en


Files in this item

Name Size Format Description
CS006.pdf 139.2Kb PDF

This item appears in the following Collection(s)

Show simple item record

MIT-Mirage