The Community for Technology Leaders
Green Image
<p><it>Abstract—</it>In a network of high performance workstations, many workstations are underutilized by their owners. The problem of using these idle cycles for solving computationally intensive tasks by executing a large task on many workstations has been addressed before [<ref type="bib" rid="D06681">1</ref>] and algorithms with <math><tmath>$O(N^2)$</tmath></math> time and <math><tmath>$O(N)$</tmath></math> space for choosing the optimal subset of workstations out of <math><tmath>$N$</tmath></math> workstations were presented. We improve these algorithms to reduce the running time to <math><tmath>$O(N \log N)$</tmath></math>, while keeping the space requirement the same. The proposed algorithms are particularly useful for SPMD parallelism where computation is the same for all workstations and the data space is partitioned between the workstations.</p><p><it>Index Terms—</it>Task scheduling, SPMD computations, resource allocation, distributed operating systems, networks of workstations.</p>

K. Efe and V. Krishnamoorthy, "Optimal Scheduling of Compute-Intensive Tasks on a Network of Workstations," in IEEE Transactions on Parallel & Distributed Systems, vol. 6, no. , pp. 668-673, 1995.
98 ms
(Ver 3.3 (11022016))