• 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 LibguidePlumX LibguideSubmit an Item

    Statistics

    Display statistics

    Visualizing Network Traffic to Understand the Performance of Massively Parallel Simulations

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Type
    Article
    Authors
    Landge, A. G.
    Levine, J. A.
    Bhatele, A.
    Isaacs, K. E.
    Gamblin, T.
    Schulz, M.
    Langer, S. H.
    Bremer, Peer-Timo
    Pascucci, V.
    KAUST Grant Number
    KUS-C1-016-04
    Date
    2012-12
    Permanent link to this record
    http://hdl.handle.net/10754/600175
    
    Metadata
    Show full item record
    Abstract
    The performance of massively parallel applications is often heavily impacted by the cost of communication among compute nodes. However, determining how to best use the network is a formidable task, made challenging by the ever increasing size and complexity of modern supercomputers. This paper applies visualization techniques to aid parallel application developers in understanding the network activity by enabling a detailed exploration of the flow of packets through the hardware interconnect. In order to visualize this large and complex data, we employ two linked views of the hardware network. The first is a 2D view, that represents the network structure as one of several simplified planar projections. This view is designed to allow a user to easily identify trends and patterns in the network traffic. The second is a 3D view that augments the 2D view by preserving the physical network topology and providing a context that is familiar to the application developers. Using the massively parallel multi-physics code pF3D as a case study, we demonstrate that our tool provides valuable insight that we use to explain and optimize pF3D-s performance on an IBM Blue Gene/P system. © 1995-2012 IEEE.
    Citation
    Landge AG, Levine JA, Bhatele A, Isaacs KE, Gamblin T, et al. (2012) Visualizing Network Traffic to Understand the Performance of Massively Parallel Simulations. IEEE Transactions on Visualization and Computer Graphics 18: 2467–2476. Available: http://dx.doi.org/10.1109/TVCG.2012.286.
    Sponsors
    This work is supported in part by NSF awards IIS-1045032, OCI-0904631, OCI-0906379 and CCF-0702817, and by a KAUST awardKUS-C1-016-04. This work was also performed under the auspicesof the U.S. Department of Energy by the University of Utah undercontracts DE-SC0001922, DE-AC52-07NA27344 and DE-FC02-06ER25781, and by Lawrence Livermore National Laboratory undercontract DE-AC52-07NA27344 (LLNL-CONF-543359).
    Publisher
    Institute of Electrical and Electronics Engineers (IEEE)
    Journal
    IEEE Transactions on Visualization and Computer Graphics
    DOI
    10.1109/TVCG.2012.286
    PubMed ID
    26357155
    ae974a485f413a2113503eed53cd6c53
    10.1109/TVCG.2012.286
    Scopus Count
    Collections
    Publications Acknowledging KAUST Support

    entitlement

    Related articles

    • Proceedings of the Second Workshop on Theory meets Industry (Erwin-Schrödinger-Institute (ESI), Vienna, Austria, 12-14 June 2007).
    • Authors: Hafner J
    • Issue date: 2008 Feb 13
    • VIOLA-A Multi-Purpose and Web-Based Visualization Tool for Neuronal-Network Simulation Output.
    • Authors: Senk J, Carde C, Hagen E, Kuhlen TW, Diesmann M, Weyers B
    • Issue date: 2018
    • Combing the Communication Hairball: Visualizing Parallel Execution Traces using Logical Time.
    • Authors: Isaacs KE, Bremer PT, Jusufi I, Gamblin T, Bhatele A, Schulz M, Hamann B
    • Issue date: 2014 Dec
    • Torus Pairwise Disjoint-Path Routing.
    • Authors: Bossard A, Kaneko K
    • Issue date: 2018 Nov 13
    • Visualizing Mobility of Public Transportation System.
    • Authors: Zeng W, Fu CW, Arisona SM, Erath A, Qu H
    • Issue date: 2014 Dec
    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.