使用NVLink的拓扑感知图像合成

Cameron Christensen, T. Fogal, Nathan Luehr, Cliff Woolley
{"title":"使用NVLink的拓扑感知图像合成","authors":"Cameron Christensen, T. Fogal, Nathan Luehr, Cliff Woolley","doi":"10.1109/LDAV.2016.7874334","DOIUrl":null,"url":null,"abstract":"Compositing is a significant factor in distributed visualization performance at scale on high-performance computing (HPC) systems. For applications such as Para VieworVisIt, the common approach is “sort-last” rendering. For this approach, data are split up to be rendered such that each MPI rank has one or more portions of the over-all domain. After rendering its individual piece(s), each rank has one or more partial images that must be composited with the others to form the final image. The common approach for this step is to use a tree-like communication pattern to reduce the rendered images down to a single image to be displayed to the user. A variety of algorithms have been explored to perform this step efficiently in order to achieve interactive rendering on massive systems [7, 3, 8, 4].","PeriodicalId":148570,"journal":{"name":"2016 IEEE 6th Symposium on Large Data Analysis and Visualization (LDAV)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Topology-aware image compositing using NVLink\",\"authors\":\"Cameron Christensen, T. Fogal, Nathan Luehr, Cliff Woolley\",\"doi\":\"10.1109/LDAV.2016.7874334\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Compositing is a significant factor in distributed visualization performance at scale on high-performance computing (HPC) systems. For applications such as Para VieworVisIt, the common approach is “sort-last” rendering. For this approach, data are split up to be rendered such that each MPI rank has one or more portions of the over-all domain. After rendering its individual piece(s), each rank has one or more partial images that must be composited with the others to form the final image. The common approach for this step is to use a tree-like communication pattern to reduce the rendered images down to a single image to be displayed to the user. A variety of algorithms have been explored to perform this step efficiently in order to achieve interactive rendering on massive systems [7, 3, 8, 4].\",\"PeriodicalId\":148570,\"journal\":{\"name\":\"2016 IEEE 6th Symposium on Large Data Analysis and Visualization (LDAV)\",\"volume\":\"34 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE 6th Symposium on Large Data Analysis and Visualization (LDAV)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LDAV.2016.7874334\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE 6th Symposium on Large Data Analysis and Visualization (LDAV)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LDAV.2016.7874334","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

在高性能计算(HPC)系统上,合成是影响大规模分布式可视化性能的一个重要因素。对于Para VieworVisIt这样的应用程序,常见的方法是“sort-last”呈现。对于这种方法,数据被拆分以呈现,使每个MPI排名具有总体域的一个或多个部分。在渲染其单独的部分之后,每个等级都有一个或多个部分图像,必须与其他图像合成以形成最终图像。此步骤的常用方法是使用树状通信模式将呈现的图像减少为要显示给用户的单个图像。为了在大规模系统上实现交互渲染,已经探索了各种算法来有效地执行这一步骤[7,3,8,4]。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Topology-aware image compositing using NVLink
Compositing is a significant factor in distributed visualization performance at scale on high-performance computing (HPC) systems. For applications such as Para VieworVisIt, the common approach is “sort-last” rendering. For this approach, data are split up to be rendered such that each MPI rank has one or more portions of the over-all domain. After rendering its individual piece(s), each rank has one or more partial images that must be composited with the others to form the final image. The common approach for this step is to use a tree-like communication pattern to reduce the rendered images down to a single image to be displayed to the user. A variety of algorithms have been explored to perform this step efficiently in order to achieve interactive rendering on massive systems [7, 3, 8, 4].
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信