Dynamic Load Distribution in MIST
Khaled Al-Saqabi, Robert Prouty, Dylan McNamee, Steve W. Otto, Jonathan Walpole · PDXScholar (Portland State University) · 1997
: 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. Keywords: Scheduling, distributed systems, heterogeneity, process migration. 1. Introduction Recent years have witnessed rapid advances in the performance of commodity micro-processor and network hardware. From a parallel computing perspect...