SIGN IN
SIGN UP
Scheduling multithreaded computations by work stealing
Full Text:
PDF
Buy this Article
Authors:
Robert D. Blumofe
Univ. of Texas at Austin, Austin
Charles E. Leiserson
MIT Lab for Computer Science, Cambridge, MA
Published in:
· Journal
Journal of the ACM (JACM)
JACM Homepage
archive
Volume 46 Issue 5, Sept. 1999
Pages 720-748
ACM
New York, NY
, USA
table of contents
doi>
10.1145/324133.324234
1999 Article
Bibliometrics
· Downloads (6 Weeks): 25
· Downloads (12 Months): 254
· Downloads (cumulative): 2,344
· Citation Count: 124
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
critical-path length
multiprocessor
multithreading
parallel programming
performance
randomized algorithm
scheduling
theory
thread scheduling
threads
work stealing
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