Abstract.
In this paper we analyze the limiting behavior of several randomized work stealing algorithms in a dynamic setting. Our models represent the limiting behavior of systems as the number of processors grows to infinity using differential equations. The advantages of this approach include the ability to model a large variety of systems and to provide accurate numerical approximations of system behavior even when the number of processors is relatively small. We show how this approach can yield significant intuition about the behavior of work stealing algorithms in realistic settings.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received August 20, 1999, and in revised form March 15, 2000, and in final form July 17, 2000. Online publication October 26, 2000.
Rights and permissions
About this article
Cite this article
Mitzenmacher, M. Analyses of Load Stealing Models Based on Families of Differential Equations . Theory Comput. Systems 34, 77–98 (2000). https://doi.org/10.1007/s002240010010
Published:
Issue Date:
DOI: https://doi.org/10.1007/s002240010010