We show that moderately increasing the speed of the processor used by the nonclairvoyant scheduler effectively gives this scheduler the power of clairvoyance. Furthermore, we show that there exist online algorithms with bounded competitive ratios on all inputs that are not closely correlated with processor speed. We consider the following on line scheduling problem.
Speed is as powerful as clairvoyance.
Doc 20 Nonclairvoyant scheduling - Motwani, Phillips et al. Doc 18 line scheduling to maximize task completions - Baruah, Haritsa et al. The graph only includes citing articles where the year of publication is known.