Electronic data processing -- Distributed processing, Parallel computers, Computer algorithms
This paper presents an algorithm for scheduling parallel applications in large-scale, multiuser, heterogeneous distributed systems. The approach is primarily targeted at systems that harvest idle cycles in general-purpose workstation networks, but is also applicable to clustered computer systems and massively parallel processors. The algorithm handles unequal processor capacities, multiple architecture types and dynamic variations in the number of processes and available processors. Scheduling decisions are driven by the desire to minimize turnaround time while maintaining fairness among competing applications. For efficiency, the virtual processors (VPs) of each application are gang scheduled on some subset of the available physical processors.
"Dynamic Load Distribution in MIST," K. Al-Saqabi, R. Prouty, D. McNamee, S. Otto and J. Walpole, In Proceedings of the 1997 International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA 97), Las Vegas, Nevada USA, June 30 - July 3, 1997.