Quote: equi-partition partitions processors evenly among unfinished jobs and preempts on job completion; two competitive; optimal

topics > all references > references e-f > QuoteRef: edmoJ5_1999 , p. abstract

parallel algorithms
non-preemptive task scheduling
plan-based task scheduling

Quotation Skeleton

Given all this, we prove that the scheduler … long as it is given at least twice … parallelizable, then Equi-partition performs competitively with no extra … characteristics. … [p. 180] Motwani et al. [Theoretical Computer Science 130:17-47 1994] prove that on … [Tucker & Gupta, ACM Symp Operating Systems Principles, 1989], which partitions the processors evenly between the unfinished jobs and … that no non-clairvoyant scheduler has a better competitive … [p. 181] The intuition [behind not-fully parallelizable] is that if Equi-partition … to each job [including those that can not use the extra processors anyway].   Google-1   Google-2

Copyright clearance needed for quotation.

Related Topics up

Topic: parallel algorithms (15 items)
Topic: non-preemptive task scheduling (16 items)
Topic: plan-based task scheduling (13 items)

Copyright © 2002-2008 by C. Bradford Barber. All rights reserved.
Thesa is a trademark of C. Bradford Barber.