Map
Index
Random
Help
th

QuoteRef: edmoJ5_1999

topics > all references > ThesaHelp: references e-f



ThesaHelp:
ACM references a-e
ThesaHelp:
references e-f
Topic:
parallel algorithms
Topic:
non-preemptive task scheduling
Topic:
plan-based task scheduling

Reference

Edmonds, J., "Scheduling in the dark", Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, Atlanta Georgia USA, May 1999, ACM SIGACT, pp. 179-188. Google

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


Related Topics up

ThesaHelp: ACM references a-e (259 items)
ThesaHelp: references e-f (168 items)
Topic: parallel algorithms (15 items)
Topic: non-preemptive task scheduling (16 items)
Topic: plan-based task scheduling (13 items)

Collected barberCB 12/02
Copyright © 2002-2008 by C. Bradford Barber. All rights reserved.
Thesa is a trademark of C. Bradford Barber.