SIGN IN
SIGN UP
The data locality of work stealing
Full Text:
PDF
Buy this Article
Authors:
Umut A. Acar
School of Computer Science, Carnegie Mellon University
Guy E. Blelloch
School of Computer Science, Carnegie Mellon University
Robert D. Blumofe
Department of Computer Sciences, University of Texas at Austin
Published in:
· Proceeding
SPAA '00
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Pages 1-12
ACM
New York, NY
, USA
©2000
table of contents
ISBN:1-58113-185-2
doi>
10.1145/341800.341801
2000 Article
Bibliometrics
· Downloads (6 Weeks): 10
· Downloads (12 Months): 99
· Downloads (cumulative): 683
· Citation Count: 32
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
SPAA '13
Share:
|
Tags:
algorithms
design
experimentation
measurement
parallel algorithms
parallelism and concurrency
performance
scheduling
sequencing and scheduling
theory
verification
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder