SIGN IN
SIGN UP
Provably efficient scheduling for languages with fine-grained parallelism
Full Text:
PDF
Get this Article
Authors:
Guy E. Blelloch
Carnegie Mellon Univ., Pittsburgh, PA
Phillip B. Gibbons
Bell Labs, Murray Hill, NJ
Yossi Matias
Bell Labs, Murray Hill, NJ
Published in:
· Journal
Journal of the ACM (JACM)
JACM Homepage
archive
Volume 46 Issue 2, March 1999
Pages 281-321
ACM
New York, NY
, USA
table of contents
doi>
10.1145/301970.301974
1999 Article
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 18
· Downloads (cumulative): 866
· Citation Count: 33
Tools and Resources
Buy this Article
Recommend the ACM DL
to your organization
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Author Tags
algorithms
dynamic memory
language types
languages
multiprocessing / multiprogramming / multitasking
multithreading
performance
scheduling
Contact Us
|
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
**
Advertisements
Powered by
Did you know the ACM DL App is now available?
Did you know your Organization can subscribe to the ACM Digital Library?
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder