Generating fast code from concurrent program dependence graphs

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Jia Zeng Columbia University, New York, NY
Cristian Soviani Columbia University, New York, NY
Stephen A. Edwards Columbia University, New York, NY
Published in:
Cover Image
 
· Proceeding
LCTES '04 Proceedings of the 2004 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems
Pages 175 - 181
ACM New York, NY, USA ©2004
table of contents ISBN:1-58113-806-7 doi>10.1145/997163.997188
· Newsletter
ACM SIGPLAN Notices - LCTES '04 Homepage
Volume 39 Issue 7, July 2004
Pages 175 - 181
ACM New York, NY, USA
table of contents doi>10.1145/998300.997188
Generating fast code from concurrent program dependence graphs Published by ACM 2004 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 10
· Downloads (cumulative): 350
· Citation Count: 4


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