Work stealing

Known as: Work-stealing 
In parallel computing, work stealing is a scheduling strategy for multithreaded computer programs. It solves the problem of executing a dynamically… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1994-2018
020406019942018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Partitioned Global Address Space languages like UPC offer a convenient way of expressing large shared data structures, especially… (More)
  • figure 2
  • figure 1
  • figure 3
  • table 1
  • figure 6
Is this relevant?
Highly Cited
2010
Highly Cited
2010
This poster introduces SLAW, a Scalable Locality-aware Adaptive Work-stealing scheduler. The SLAW features an adaptive task… (More)
  • figure 2
  • figure 3
Is this relevant?
2010
2010
NABBIT is a work-stealing library for execution of task graphs with arbitrary dependencies which is implemented as a library for… (More)
Is this relevant?
2010
2010
dynamic load-balancing on hierarchical platforms. In particular, we consider applications involving heavy communications on a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Irregular and dynamic parallel applications pose significant challenges to achieving scalable performance on large-scale… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Load balancing is a technique which allows efficient parallelization of irregular workloads, and a key component of many… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2008
2008
This paper presents some preliminary results on a small light weight user level task management library called Wool. The Wool… (More)
  • table 1
  • table 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
The non-blocking work-stealing algorithm of Arora, Blumofe, and Plaxton (henceforth ABP work-stealing) is on its way to becoming… (More)
  • figure 3
  • figure 9
  • figure 10
Is this relevant?
Highly Cited
2000
Highly Cited
2000
This paper studies the data locality of the work-stealing scheduling algorithm on hardware-controlled shared-memory machines. We… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1994
Highly Cited
1994
This paper studies the problem of efficiently schedulling fully strict (i.e., well-structured) multithreaded computations on… (More)
Is this relevant?