Towards an architecture-independent analysis of parallel algorithms
SIAM Journal on Computing
Space-efficient scheduling of multithreaded computations
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
On Optimal Strategies for Cycle-Stealing in Networks of Workstations
IEEE Transactions on Computers
Scheduling multithreaded computations by work stealing
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
We derive guidelines for nearly optimally scheduling data-parallel computations within a draconian mode of cycle-stealing in NOWs. In this computing regimen, workstation A takes control of workstation B 's processor whenever B is idle, with the promise of relinquishing control immediately upon demand--thereby losing work in progress. The typically high communication overhead for supplying workstation B with work and receiving its results militates in favor of supplying B with large amounts of work at a time; the risk of losing work in progress when B is reclaimed militates in favor of supplying B with a succession of small bundles of work. The challenge is to balance these two pressures in a way that maximizes (some measure of) the amount of work accomplished. Our guidelines attempt to maximize the expected work accomplished by workstation B in an episode of cycle-stealing, assuming knowledge of the instantaneous probability of workstation B's being reclaimed. Our study is a step toward rendering prescriptive the descriptive study of cycle-stealing in [3].