Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
Work stealing has proven to be an effective method for scheduling parallel programs on multicore computers. To achieve high… Expand
Is this relevant?
Highly Cited
2010
Highly Cited
2010
This paper introduces SLAW, a Scalable Locality-aware Adaptive Work-stealing scheduler. The SLAW scheduler is designed to address… Expand
  • figure 1
  • figure 2
  • figure 3
  • table I
  • figure 6
Is this relevant?
Highly Cited
2010
Highly Cited
2010
In this paper, we consider a generic model of computational grids, seen as several clusters of homogeneous processors. In such… Expand
  • 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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2009
Highly Cited
2009
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched… Expand
  • figure 1
  • figure 2
  • table 1
  • table 2
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… Expand
  • figure 3
  • figure 8
  • 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… Expand
Is this relevant?
Highly Cited
2000
Highly Cited
2000
AbstractThis paper studies the data locality of the work-stealing scheduling algorithm on hardware-controlled shared-memory… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1999
Highly Cited
1999
This paper studies the problem of efficiently schedulling fully strict (i.e., well-structured) multithreaded computations on… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1994
Highly Cited
1994
  • Robert D. Blumofe
  • Proceedings 35th Annual Symposium on Foundations…
  • 1994
  • Corpus ID: 40566370
This paper studies the problem of efficiently scheduling fully strict (i.e., well-structured) multithreaded computations on… Expand
  • figure 1
  • figure 2
Is this relevant?