Andrew G. Shewmaker, Carlos Maltzahn, Scott Brandt, Katia Obraczka, Ivo Jimenez
11/06/2013 06:13 PM
Computer Science
The RUN (Reduction to UNiprocessor)[3] algorithm was first described by Regnier, et al. as a novel solution to real-time multiprocessor scheduling, but its ideas can be applied to other scheduling problems involving arrays of similar resources. This technical report briefly describes how RUN can improve the management of network routes, queueing disciplines, disks, and batch schedulers.
