In prior work on multiprocessor fairness, efficient techniques with provable properties for reallocating spare processing capacity have been elusive. In this paper, we address thi...
Efficient scheduling of jobs on parallel processors is essential for good performance. However, design of such schedulers is challenging because of the complex interaction between...
Scheduling large amounts of tasks in distributed computing platforms composed of millions of nodes is a challenging goal, even more in a fully decentralized way and with low overhe...
d Abstract) James H. Anderson Department of Computer Science University of North Carolina at Chapel Hill Mark Moiry Department of Computer Science University of Pittsburgh We cons...
Abstract. This paper describes a new and novel scheme for job admission and resource allocation employed by the SODA scheduler in System S. Capable of processing enormous quantitie...
Joel L. Wolf, Nikhil Bansal, Kirsten Hildrum, Suja...