|
Title
|
|
|
|
Performance analysis of work stealing in large-scale multithreaded computing
|
|
|
Author
|
|
|
|
|
|
|
Abstract
|
|
|
|
| Randomized work stealing is used in distributed systems to increase performance and improve resource utilization. In this article, we consider randomized work stealing in a large system of homogeneous processors where parent jobs spawn child jobs that can feasibly be executed in parallel with the parent job. We analyse the performance of two work stealing strategies: one where only child jobs can be transferred across servers and the other where parent jobs are transferred. We define a mean-field model to derive the response time distribution in a large-scale system with Poisson arrivals and exponential parent and child job durations. We prove that the model has a unique fixed point that corresponds to the steady state of a structured Markov chain, allowing us to use matrix analytic methods to compute the unique fixed point. The accuracy of the mean-field model is validated using simulation. Using numerical examples, we illustrate the effect of different probe rates, load, and different child job size distributions on performance with respect to the two stealing strategies, individually, and compared to each other. |
|
|
|
Language
|
|
|
|
English
|
|
|
Source (journal)
|
|
|
|
ACM transactions on modeling and performance evaluation of computing systems. - New York, NY, 2015, currens
|
|
|
Publication
|
|
|
|
New York, NY
:
Association for Computing Machinery, Inc
,
2021
|
|
|
ISSN
|
|
|
|
2376-3639
|
|
|
DOI
|
|
|
|
10.1145/3470887
|
|
|
Volume/pages
|
|
|
|
6
:2
(2021)
, 28 p.
|
|
|
Article Reference
|
|
|
|
6
|
|
|
ISI
|
|
|
|
000705074000002
|
|
|
Medium
|
|
|
|
E-only publicatie
|
|
|
Full text (Publisher's DOI)
|
|
|
|
|
|
|
Full text (open access)
|
|
|
|
|
|
|
Full text (publisher's version - intranet only)
|
|
|
|
|
|