Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
The Data Locality of Work Stealing Umut A. Acar
 

Summary: The Data Locality of Work Stealing
Umut A. Acar
umut@cs.cmu.edu
School of Computer Science
Carnegie Mellon University
Guy E. Blelloch
blelloch@cs.cmu.edu
School of Computer Science
Carnegie Mellon University
Robert D. Blumofe
rdb@cs.utexas.edu
Department of Computer Sciences
University of Texas at Austin
January 22, 2002
Abstract
This paper studies the data locality of the work­stealing scheduling algo­
rithm 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, and introduce a locality­guided work­stealing algorithm and

  

Source: Acar, Umut - Programming Languages and Systems Group, Max-Planck Institute for Software Systems

 

Collections: Computer Technologies and Information Sciences