• Login
    View Item 
    •   Home
    • Office of Sponsored Research (OSR)
    • KAUST Funded Research
    • Publications Acknowledging KAUST Support
    • View Item
    •   Home
    • Office of Sponsored Research (OSR)
    • KAUST Funded Research
    • Publications Acknowledging KAUST Support
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of KAUSTCommunitiesIssue DateSubmit DateThis CollectionIssue DateSubmit Date

    My Account

    Login

    Quick Links

    Open Access PolicyORCID LibguideTheses and Dissertations LibguideSubmit an Item

    Statistics

    Display statistics

    Simplifying Scalable Graph Processing with a Domain-Specific Language

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Type
    Conference Paper
    Authors
    Hong, Sungpack
    Salihoglu, Semih
    Widom, Jennifer
    Olukotun, Kunle
    Date
    2014
    Permanent link to this record
    http://hdl.handle.net/10754/599620
    
    Metadata
    Show full item record
    Abstract
    Large-scale graph processing, with its massive data sets, requires distributed processing. However, conventional frameworks for distributed graph processing, such as Pregel, use non-traditional programming models that are well-suited for parallelism and scalability but inconvenient for implementing non-trivial graph algorithms. In this paper, we use Green-Marl, a Domain-Specific Language for graph analysis, to intuitively describe graph algorithms and extend its compiler to generate equivalent Pregel implementations. Using the semantic information captured by Green-Marl, the compiler applies a set of transformation rules that convert imperative graph algorithms into Pregel's programming model. Our experiments show that the Pregel programs generated by the Green-Marl compiler perform similarly to manually coded Pregel implementations of the same algorithms. The compiler is even able to generate a Pregel implementation of a complicated graph algorithm for which a manual Pregel implementation is very challenging.
    Citation
    Hong S, Salihoglu S, Widom J, Olukotun K (2014) Simplifying Scalable Graph Processing with a Domain-Specific Language. Proceedings of Annual IEEE/ACM International Symposium on Code Generation and Optimization - CGO ’14. Available: http://dx.doi.org/10.1145/2581122.2544162.
    Sponsors
    This work was funded by DARPA Contract, Xgraphs; Languageand Algorithms for Heterogeneous Graph Streams, FA8750-12-2-0335; Army contract AHPCRC W911NF-07-2-0027-1; the Na-tional Science Foundation (IIS-0904497) and a KAUST researchgrant; Stanford PPL affiliates program, Pervasive Parallelism Lab:Oracle, AMD, Intel, NVIDIA, and Huawei. Authors also acknowl-edge additional support from Oracle.
    Publisher
    Association for Computing Machinery (ACM)
    Journal
    Proceedings of Annual IEEE/ACM International Symposium on Code Generation and Optimization - CGO '14
    DOI
    10.1145/2581122.2544162
    ae974a485f413a2113503eed53cd6c53
    10.1145/2581122.2544162
    Scopus Count
    Collections
    Publications Acknowledging KAUST Support

    entitlement

     
    DSpace software copyright © 2002-2022  DuraSpace
    Quick Guide | Contact Us | KAUST University Library
    Open Repository is a service hosted by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items. For anonymous users the allowed maximum amount is 50 search results.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.