The LRPD test: speculative run-time parallelization of loops with privatization and reduction parallelization

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Lawrence Rauchwerger University of Illinois at Urbana-Champaign
David Padua University of Illinois at Urbana-Champaign
Published in:
Cover Image
Cover Image
 
· Proceeding
PLDI '95 Proceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementation
Pages 218-232
ACM New York, NY, USA ©1995
table of contents ISBN:0-89791-697-2 doi>10.1145/207110.207148
· Newsletter
ACM SIGPLAN Notices Homepage
Volume 30 Issue 6, June 1995
Pages 218 - 232
ACM New York, NY, USA
table of contents doi>10.1145/223428.207148
The LRPD test: speculative run-time parallelization of loops with privatization and reduction parallelization Published by ACM 1995 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 13
· Downloads (12 Months): 69
· Downloads (cumulative): 575
· Citation Count: 75


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