Issue No. 07 - July (2000 vol. 11)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.877793
<p><b>Abstract</b>—Studies have shown that for a significant fraction of the time, workstations are idle. In this paper, we present a new scheduling policy called Linger-Longer that exploits the fine-grained availability of workstations to run sequential and parallel jobs. We present a two-level workload characterization study and use it to simulate a cluster of workstations running our new policy. We compare two variations of our policy to two previous policies: Immediate-Eviction and Pause-and-Migrate. Our study shows that the Linger-Longer policy can improve the throughput of foreign jobs on a cluster by 60 percent with only a 0.5 percent slowdown of local jobs. For parallel computing, we show that the Linger-Longer policy outperforms reconfiguration strategies when the processor utilization by the local process is 20 percent or less in both synthetic bulk synchronous and real data-parallel applications.</p>
Meta-computing, cluster computing, process migration, networks of workstations, parallel computing.
Jeffrey K. Hollingsworth, Kyung Dong Ryu, "Exploiting Fine-Grained Idle Periods in Networks of Workstations", IEEE Transactions on Parallel & Distributed Systems, vol. 11, no. , pp. 683-698, July 2000, doi:10.1109/71.877793