Guidelines for Data-Parallel Cycle-Steal
β
Arnold L. Rosenberg
π
Article
π
1999
π
Elsevier Science
π
English
β 192 KB
We derive computationally efficient guidelines for nearly optimal scheduling of data-parallel computations within a draconian mode of cycle-stealing in networks of workstations (nows). In this computing regimen, workstation A takes control of workstation B 's processor whenever it is idle, with the