Provably Efficient Online Nonclairvoyant Adaptive Scheduling

Abstract

Multiprocessor scheduling in a shared multiprogramming environment can be structured in two levels, where a kernel-level job scheduler allots processors to jobs and a user-level thread scheduler maps the ready threads of a job onto the allotted processors. We present two provably-efficient two-level scheduling schemes called G-RAD and S-RAD respectively… (More)
DOI: 10.1109/TPDS.2008.39

Topics

4 Figures and Tables

Statistics

0102030201520162017
Citations per Year

Citation Velocity: 11

Averaging 11 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.

Cite this paper

@article{He2007ProvablyEO, title={Provably Efficient Online Nonclairvoyant Adaptive Scheduling}, author={Yuxiong He and Wen-Jing Hsu and Charles E. Leiserson}, journal={2007 IEEE International Parallel and Distributed Processing Symposium}, year={2007}, pages={1-10} }