The Data Locality of Work Stealing

This paper studies the data locality of the work-stealing scheduling algorithm on hardware-controlled shared-memory machines, where movement of data to and from the cache is solely controlled by the hardware. We present lower and upper bounds on the number of cache misses when using work stealing, a...

Full description

Bibliographic Details

Published in:	Theory of computing systems Vol. 35; no. 3; pp. 321 - 347
Main Authors:	Acar, Umut A., Blelloch, Guy E., Blumofe, Robert D.
Format:	Journal Article
Language:	English
Published:	New York Springer Nature B.V 01.05.2002
Subjects:	Affinity Algorithms Computation Critical path Hardware Multiprocessor Processors Scheduling Upper bounds Workloads
ISSN:	1432-4350, 1433-0490
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!