Provably efficient scheduling for languages with fine-grained parallelism

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Guy E. Blelloch School of Computer Science, Carnegie Mellon University, Pittsburgh, PA
Phillip B. Gibbons AT&T Bell Laboratories, 600 Mountain Avenue, Murray Hill, NJ
Yossi Matias AT&T Bell Laboratories, 600 Mountain Avenue, Murray Hill, NJ
Published in:
Cover Image
 
· Proceeding
SPAA '95 Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Pages 1-12
ACM New York, NY, USA ©1995
table of contents ISBN:0-89791-717-0 doi>10.1145/215399.215403
Provably efficient scheduling for languages with fine-grained parallelism Published by ACM 1995 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 40
· Downloads (cumulative): 321
· Citation Count: 28


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder