• Login
    View Item 
    •   Eurographics DL Home
    • Eurographics Workshops and Symposia
    • EGPGV: Eurographics Workshop on Parallel Graphics and Visualization
    • EGPGV10: Eurographics Symposium on Parallel Graphics and Visualization
    • View Item
    •   Eurographics DL Home
    • Eurographics Workshops and Symposia
    • EGPGV: Eurographics Workshop on Parallel Graphics and Visualization
    • EGPGV10: Eurographics Symposium on Parallel Graphics and Visualization
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Cache-Efficient Parallel Isosurface Extraction for Shared Cache Multicores

    Thumbnail
    View/Open
    081-090.pdf (522.3Kb)
    Date
    2010
    Author
    Tchiboukdjian, Marc
    Danjean, Vincent
    Raffin, Bruno
    Pay-Per-View via TIB Hannover:

    Try if this item/paper is available.

    Metadata
    Show full item record
    Abstract
    This paper proposes to revisit isosurface extraction algorithms taking into consideration two specific aspects of recent multicore architectures: their intrinsic parallelism associated with the presence of multiple computing cores and their cache hierarchy that often includes private caches as well as caches shared between all cores. Taking advantage of these shared caches require adapting the parallelization scheme to make the core collaborate on cache usage and not compete for it, which can impair performance. We propose to have cores working on independent but close data sets that can all fit in the shared cache. We propose two shared cache aware parallel isosurface algorithms, one based on marching tetrahedra, and one using a min-max tree as acceleration data structure. We theoretically prove that in both cases the number of cache misses is the same as for the sequential algorithm for the same cache size. The algorithms are based on the FastCOL cache-oblivious data layout for irregular meshes. The CO layout also enables to build a very compact min-max tree that leads to a reduced number of cache misses. Experiments confirm the interest of these shared cache aware isosurface algorithms, the performance gain increasing as the shared cache size to core number ratio decreases.
    BibTeX
    @inproceedings {10.2312:EGPGV:EGPGV10:081-090,
    booktitle = {Eurographics Symposium on Parallel Graphics and Visualization},
    editor = {James Ahrens and Kurt Debattista and Renato Pajarola},
    title = {{Cache-Efficient Parallel Isosurface Extraction for Shared Cache Multicores}},
    author = {Tchiboukdjian, Marc and Danjean, Vincent and Raffin, Bruno},
    year = {2010},
    publisher = {The Eurographics Association},
    ISSN = {1727-348X},
    ISBN = {978-3-905674-21-7},
    DOI = {10.2312/EGPGV/EGPGV10/081-090}
    }
    URI
    http://dx.doi.org/10.2312/EGPGV/EGPGV10/081-090
    Collections
    • EGPGV10: Eurographics Symposium on Parallel Graphics and Visualization

    Eurographics Association copyright © 2013 - 2022 
    Send Feedback | Contact - Imprint | Data Privacy Policy | Disable Google Analytics
    Theme by @mire NV
    System hosted at  Graz University of Technology.
    TUGFhA
     

     

    Browse

    All of Eurographics DLCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister

    BibTeX | TOC

    Create BibTeX Create Table of Contents

    Eurographics Association copyright © 2013 - 2022 
    Send Feedback | Contact - Imprint | Data Privacy Policy | Disable Google Analytics
    Theme by @mire NV
    System hosted at  Graz University of Technology.
    TUGFhA