• Login
    View Item 
    •   Home
    • Research
    • Conference Papers
    • View Item
    •   Home
    • Research
    • Conference Papers
    • 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 LibguidePlumX LibguideSubmit an Item

    Statistics

    Display statistics

    Scalable force directed graph layout algorithms using fast multipole methods

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Type
    Conference Paper
    Authors
    Yunis, Enas Abdulrahman
    Yokota, Rio cc
    Ahmadia, Aron cc
    KAUST Department
    Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
    KAUST Supercomputing Laboratory (KSL)
    Computer Science Program
    Extreme Computing Research Center
    Core Labs
    Date
    2012-06
    Permanent link to this record
    http://hdl.handle.net/10754/564557
    
    Metadata
    Show full item record
    Abstract
    We present an extension to ExaFMM, a Fast Multipole Method library, as a generalized approach for fast and scalable execution of the Force-Directed Graph Layout algorithm. The Force-Directed Graph Layout algorithm is a physics-based approach to graph layout that treats the vertices V as repelling charged particles with the edges E connecting them acting as springs. Traditionally, the amount of work required in applying the Force-Directed Graph Layout algorithm is O(|V|2 + |E|) using direct calculations and O(|V| log |V| + |E|) using truncation, filtering, and/or multi-level techniques. Correct application of the Fast Multipole Method allows us to maintain a lower complexity of O(|V| + |E|) while regaining most of the precision lost in other techniques. Solving layout problems for truly large graphs with millions of vertices still requires a scalable algorithm and implementation. We have been able to leverage the scalability and architectural adaptability of the ExaFMM library to create a Force-Directed Graph Layout implementation that runs efficiently on distributed multicore and multi-GPU architectures. © 2012 IEEE.
    Citation
    Yunis, E., Yokota, R., & Ahmadia, A. (2012). Scalable Force Directed Graph Layout Algorithms Using Fast Multipole Methods. 2012 11th International Symposium on Parallel and Distributed Computing. doi:10.1109/ispdc.2012.32
    Publisher
    Institute of Electrical and Electronics Engineers (IEEE)
    Journal
    2012 11th International Symposium on Parallel and Distributed Computing
    Conference/Event name
    2012 11th International Symposium on Parallel and Distributed Computing, ISPDC 2012
    ISBN
    9780769548050
    DOI
    10.1109/ISPDC.2012.32
    ae974a485f413a2113503eed53cd6c53
    10.1109/ISPDC.2012.32
    Scopus Count
    Collections
    Conference Papers; KAUST Supercomputing Laboratory (KSL); Extreme Computing Research Center; Computer Science Program; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

    entitlement

     
    DSpace software copyright © 2002-2021  DuraSpace
    Quick Guide | Contact Us | Send Feedback
    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.