The data locality of work stealing

Umut A. Acar, Guy E. Blelloch, Robert D. Blumofe · 2000

This paper studies the data locality of the work-stealing scheduling algorithm on hardware-controlled shared-memory machines. We present lower and upper bounds on the number of cache misses using work stealing, and introduce a locality-guided work-stealing algorithm along with experimental validation.

Read the paper · More papers on PaperTik