Guidelines for Data-Parallel Cycle-Stealing in Networks of Workstations, II: On Maximizing Guaranteed Output

Authors

Arnold L. Rosenberg, University of Massachusetts - Amherst

Publication Date

1999

Abstract

We derive efficient guidelines for scheduling dataparallel computations within a draconian mode of cyclestealing in networks of workstations wherein an interruption by the owner of the “borrowed” workstation kills all jobs currently in progress. We derive both adaptive and non-adaptive scheduling guidelines that maximize, up to low-order additive terms, the amount of work that one is guaranteed to accomplish during a cycle-stealing opportunity, no matter when the opportunity is interrupted—up to a prespecified number of times.

Comments

This paper was harvested from CiteSeer

Recommended Citation

Rosenberg, Arnold L., "Guidelines for Data-Parallel Cycle-Stealing in Networks of Workstations, II: On Maximizing Guaranteed Output" (1999). Computer Science Department Faculty Publication Series. 34.
Retrieved from https://scholarworks.umass.edu/cs_faculty_pubs/34