Optimized visualization for tiled displays

Mario Lorenz, G. Brunnett
{"title":"Optimized visualization for tiled displays","authors":"Mario Lorenz, G. Brunnett","doi":"10.2312/EGPGV/EGPGV06/127-135","DOIUrl":null,"url":null,"abstract":"In this paper we present new functionality we added to the Chromium framework. When driving tiled displays using a sort-first configuration based on the Tilesort stream procession unit (SPU) the performance bottlenecks are the high utilization of the client host caused by the expensive sorting and bucketing of geometry and the high bandwidth consumption caused by a significant amount of redundant unicast transmissions. We addressed these problems with an implementation of a true point-to-multipoint connection type using UDP multicast. Based on this functionality we developed the so called OPT-SPU. This SPU replaces the widely used Tilesort-SPU in typical Sort-First environments. Tile-sorting and state differencing is not necessary because Multicasting allows us to send the geometry to all server nodes at once. Instead of tile-sorting a conventional frustum culling method is used to avoid needless server utilization caused by rendering of geometry outside their viewports. This approach leads to significant lower processor and memory load on the client and a very effective utilization of available network bandwidth. To avoid redundant transmissions of identical command sequences that are generated by the application several times we put a transparent stream cache into the multicast communication channel. In addition, frustum and hardware accelerated occlusion culling methods may be used to eliminate unnecessary transfer of invisible geometry. Finally, a software based method for synchronization of buffer swap operations at all servers was implemented. In a nutshell, for the first time an appropriate combination of our optimizations makes it possible to render large scenes synchronously on an arbitary number of tiles at nearly constant performance.","PeriodicalId":90824,"journal":{"name":"Eurographics Symposium on Parallel Graphics and Visualization : EG PGV : [proceedings]. Eurographics Symposium on Parallel Graphics and Visualization","volume":"27 1","pages":"127-135"},"PeriodicalIF":0.0000,"publicationDate":"2006-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Eurographics Symposium on Parallel Graphics and Visualization : EG PGV : [proceedings]. Eurographics Symposium on Parallel Graphics and Visualization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2312/EGPGV/EGPGV06/127-135","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12

Abstract

In this paper we present new functionality we added to the Chromium framework. When driving tiled displays using a sort-first configuration based on the Tilesort stream procession unit (SPU) the performance bottlenecks are the high utilization of the client host caused by the expensive sorting and bucketing of geometry and the high bandwidth consumption caused by a significant amount of redundant unicast transmissions. We addressed these problems with an implementation of a true point-to-multipoint connection type using UDP multicast. Based on this functionality we developed the so called OPT-SPU. This SPU replaces the widely used Tilesort-SPU in typical Sort-First environments. Tile-sorting and state differencing is not necessary because Multicasting allows us to send the geometry to all server nodes at once. Instead of tile-sorting a conventional frustum culling method is used to avoid needless server utilization caused by rendering of geometry outside their viewports. This approach leads to significant lower processor and memory load on the client and a very effective utilization of available network bandwidth. To avoid redundant transmissions of identical command sequences that are generated by the application several times we put a transparent stream cache into the multicast communication channel. In addition, frustum and hardware accelerated occlusion culling methods may be used to eliminate unnecessary transfer of invisible geometry. Finally, a software based method for synchronization of buffer swap operations at all servers was implemented. In a nutshell, for the first time an appropriate combination of our optimizations makes it possible to render large scenes synchronously on an arbitary number of tiles at nearly constant performance.
优化了平铺显示的可视化
在本文中,我们将介绍我们添加到Chromium框架中的新功能。当使用基于平铺排序流处理单元(SPU)的排序优先配置驱动平铺显示时,性能瓶颈是由昂贵的几何排序和桶形引起的客户端主机的高利用率以及由大量冗余单播传输引起的高带宽消耗。我们通过使用UDP多播实现真正的点对多点连接类型来解决这些问题。基于这个功能,我们开发了所谓的OPT-SPU。该SPU取代了在典型排序优先环境中广泛使用的tile - sort-SPU。瓦片排序和状态差异不是必需的,因为多播允许我们一次将几何图形发送到所有服务器节点。而不是瓷砖排序,传统的截锥体剔除方法被用来避免不必要的服务器占用,因为渲染几何图形在他们的视口之外。这种方法显著降低了客户机上的处理器和内存负载,并非常有效地利用了可用的网络带宽。为了避免应用程序多次生成的相同命令序列的冗余传输,我们将透明流缓存放入多播通信通道中。此外,可以使用截锥体和硬件加速遮挡剔除方法来消除不必要的不可见几何的转移。最后,实现了一种在所有服务器上同步缓冲区交换操作的软件方法。简而言之,这是我们的优化第一次让我们能够在任意数量的贴图上以几乎恒定的性能同步渲染大型场景。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信