Green-Marl: a DSL for easy and efficient graph analysis

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Sungpack Hong Stanford University, Palo Alto, CA, USA
Hassan Chafi Stanford University & Oracle Labs, Palo Alto, CA, USA
Edic Sedlar Oracle Labs, Belmont, CA, USA
Kunle Olukotun Stanford University, Palo Alto, CA, USA
Green-Marl: a DSL for easy and efficient graph analysis Published by ACM 2012 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 24
· Downloads (12 Months): 243
· Downloads (cumulative): 309
· Citation Count: 6

Published in:
Cover Image
Cover Image
 
· Proceeding
ASPLOS XVII Proceedings of the seventeenth international conference on Architectural Support for Programming Languages and Operating Systems
Pages 349-362
ACM New York, NY, USA ©2012
table of contents ISBN: 978-1-4503-0759-8 doi>10.1145/2150976.2151013
· Newsletter
ACM SIGARCH Computer Architecture News - ASPLOS '12
Volume 40 Issue 1, March 2012
Pages 349-362
ACM New York, NY, USA
table of contents doi>10.1145/2189750.2151013

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