A Guide to Particle Advection Performance
The performance of particle advection-based flow visualization techniques is complex, since computational work can vary based on many factors, including number of particles, duration, and mesh type. Further, while many approaches have been introduced to optimize performance, the efficacy of a given...
Gespeichert in:
Hauptverfasser: | , , , , , |
---|---|
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | |
container_start_page | |
container_title | |
container_volume | |
creator | Yenpure, Abhishek Sane, Sudhanshu Binyahib, Roba Pugmire, David Garth, Christoph Childs, Hank |
description | The performance of particle advection-based flow visualization techniques is
complex, since computational work can vary based on many factors, including
number of particles, duration, and mesh type. Further, while many approaches
have been introduced to optimize performance, the efficacy of a given approach
can be similarly complex. In this work, we seek to establish a guide for
particle advection performance by conducting a comprehensive survey of the
area. We begin by identifying the building blocks for particle advection and
establishing a simple cost model incorporating these building blocks. We then
survey existing optimizations for particle advection, using two high-level
categories: algorithmic optimizations and hardware efficiency. The
sub-categories of algorithmic optimizations include solvers, cell locators, I/O
efficiency, and precomputation, while the sub-categories of hardware efficiency
all involve parallelism: shared-memory, distributed-memory, and hybrid.
Finally, we conclude the survey by identifying current gaps in particle
advection performance, and in particular on achieving a workflow for predicting
performance under various optimizations. |
doi_str_mv | 10.48550/arxiv.2201.08440 |
format | Article |
fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2201_08440</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2201_08440</sourcerecordid><originalsourceid>FETCH-LOGICAL-a670-90effe0bf65b416ab2b9c0ab915d7b375cb08c098368b8ca052dfcb750b8d2a53</originalsourceid><addsrcrecordid>eNotzrsKwjAUgOEsDqI-gJNZHVpP06ZNxyLeQLCDezknFwi0VmIVfXvxMv3bz8fYPIE4U1LCCsPTP2IhIIlBZRmM2bLiu7s3lg89rzEMXreWV-Zh9eD7C69tcH3o8KLtlI0ctjc7-3fCztvNeb2PjqfdYV0dI8wLiEqwzlkgl0vKkhxJUKkBqUykKSgtpCZQGkqV5oqURpDCOE2FBFJGoEwnbPHbfq3NNfgOw6v5mJuvOX0D7QI7QQ</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>A Guide to Particle Advection Performance</title><source>arXiv.org</source><creator>Yenpure, Abhishek ; Sane, Sudhanshu ; Binyahib, Roba ; Pugmire, David ; Garth, Christoph ; Childs, Hank</creator><creatorcontrib>Yenpure, Abhishek ; Sane, Sudhanshu ; Binyahib, Roba ; Pugmire, David ; Garth, Christoph ; Childs, Hank</creatorcontrib><description>The performance of particle advection-based flow visualization techniques is
complex, since computational work can vary based on many factors, including
number of particles, duration, and mesh type. Further, while many approaches
have been introduced to optimize performance, the efficacy of a given approach
can be similarly complex. In this work, we seek to establish a guide for
particle advection performance by conducting a comprehensive survey of the
area. We begin by identifying the building blocks for particle advection and
establishing a simple cost model incorporating these building blocks. We then
survey existing optimizations for particle advection, using two high-level
categories: algorithmic optimizations and hardware efficiency. The
sub-categories of algorithmic optimizations include solvers, cell locators, I/O
efficiency, and precomputation, while the sub-categories of hardware efficiency
all involve parallelism: shared-memory, distributed-memory, and hybrid.
Finally, we conclude the survey by identifying current gaps in particle
advection performance, and in particular on achieving a workflow for predicting
performance under various optimizations.</description><identifier>DOI: 10.48550/arxiv.2201.08440</identifier><language>eng</language><subject>Computer Science - Distributed, Parallel, and Cluster Computing ; Computer Science - Graphics ; Computer Science - Performance</subject><creationdate>2022-01</creationdate><rights>http://creativecommons.org/licenses/by/4.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2201.08440$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2201.08440$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Yenpure, Abhishek</creatorcontrib><creatorcontrib>Sane, Sudhanshu</creatorcontrib><creatorcontrib>Binyahib, Roba</creatorcontrib><creatorcontrib>Pugmire, David</creatorcontrib><creatorcontrib>Garth, Christoph</creatorcontrib><creatorcontrib>Childs, Hank</creatorcontrib><title>A Guide to Particle Advection Performance</title><description>The performance of particle advection-based flow visualization techniques is
complex, since computational work can vary based on many factors, including
number of particles, duration, and mesh type. Further, while many approaches
have been introduced to optimize performance, the efficacy of a given approach
can be similarly complex. In this work, we seek to establish a guide for
particle advection performance by conducting a comprehensive survey of the
area. We begin by identifying the building blocks for particle advection and
establishing a simple cost model incorporating these building blocks. We then
survey existing optimizations for particle advection, using two high-level
categories: algorithmic optimizations and hardware efficiency. The
sub-categories of algorithmic optimizations include solvers, cell locators, I/O
efficiency, and precomputation, while the sub-categories of hardware efficiency
all involve parallelism: shared-memory, distributed-memory, and hybrid.
Finally, we conclude the survey by identifying current gaps in particle
advection performance, and in particular on achieving a workflow for predicting
performance under various optimizations.</description><subject>Computer Science - Distributed, Parallel, and Cluster Computing</subject><subject>Computer Science - Graphics</subject><subject>Computer Science - Performance</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotzrsKwjAUgOEsDqI-gJNZHVpP06ZNxyLeQLCDezknFwi0VmIVfXvxMv3bz8fYPIE4U1LCCsPTP2IhIIlBZRmM2bLiu7s3lg89rzEMXreWV-Zh9eD7C69tcH3o8KLtlI0ctjc7-3fCztvNeb2PjqfdYV0dI8wLiEqwzlkgl0vKkhxJUKkBqUykKSgtpCZQGkqV5oqURpDCOE2FBFJGoEwnbPHbfq3NNfgOw6v5mJuvOX0D7QI7QQ</recordid><startdate>20220120</startdate><enddate>20220120</enddate><creator>Yenpure, Abhishek</creator><creator>Sane, Sudhanshu</creator><creator>Binyahib, Roba</creator><creator>Pugmire, David</creator><creator>Garth, Christoph</creator><creator>Childs, Hank</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20220120</creationdate><title>A Guide to Particle Advection Performance</title><author>Yenpure, Abhishek ; Sane, Sudhanshu ; Binyahib, Roba ; Pugmire, David ; Garth, Christoph ; Childs, Hank</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a670-90effe0bf65b416ab2b9c0ab915d7b375cb08c098368b8ca052dfcb750b8d2a53</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Computer Science - Distributed, Parallel, and Cluster Computing</topic><topic>Computer Science - Graphics</topic><topic>Computer Science - Performance</topic><toplevel>online_resources</toplevel><creatorcontrib>Yenpure, Abhishek</creatorcontrib><creatorcontrib>Sane, Sudhanshu</creatorcontrib><creatorcontrib>Binyahib, Roba</creatorcontrib><creatorcontrib>Pugmire, David</creatorcontrib><creatorcontrib>Garth, Christoph</creatorcontrib><creatorcontrib>Childs, Hank</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Yenpure, Abhishek</au><au>Sane, Sudhanshu</au><au>Binyahib, Roba</au><au>Pugmire, David</au><au>Garth, Christoph</au><au>Childs, Hank</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Guide to Particle Advection Performance</atitle><date>2022-01-20</date><risdate>2022</risdate><abstract>The performance of particle advection-based flow visualization techniques is
complex, since computational work can vary based on many factors, including
number of particles, duration, and mesh type. Further, while many approaches
have been introduced to optimize performance, the efficacy of a given approach
can be similarly complex. In this work, we seek to establish a guide for
particle advection performance by conducting a comprehensive survey of the
area. We begin by identifying the building blocks for particle advection and
establishing a simple cost model incorporating these building blocks. We then
survey existing optimizations for particle advection, using two high-level
categories: algorithmic optimizations and hardware efficiency. The
sub-categories of algorithmic optimizations include solvers, cell locators, I/O
efficiency, and precomputation, while the sub-categories of hardware efficiency
all involve parallelism: shared-memory, distributed-memory, and hybrid.
Finally, we conclude the survey by identifying current gaps in particle
advection performance, and in particular on achieving a workflow for predicting
performance under various optimizations.</abstract><doi>10.48550/arxiv.2201.08440</doi><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | DOI: 10.48550/arxiv.2201.08440 |
ispartof | |
issn | |
language | eng |
recordid | cdi_arxiv_primary_2201_08440 |
source | arXiv.org |
subjects | Computer Science - Distributed, Parallel, and Cluster Computing Computer Science - Graphics Computer Science - Performance |
title | A Guide to Particle Advection Performance |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-18T23%3A21%3A31IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20Guide%20to%20Particle%20Advection%20Performance&rft.au=Yenpure,%20Abhishek&rft.date=2022-01-20&rft_id=info:doi/10.48550/arxiv.2201.08440&rft_dat=%3Carxiv_GOX%3E2201_08440%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |