The deficient network bandwidth has severely curtailed the rendering speed of large geometric scenes in parallel graphics rendering systems such as Chromium.Through lossless compression of geometric data in the network transmission, an efficient method which alleviated the network burden was proposed.This method can easily be used to implement different algorithms for specific geometry data compression.The authors applied ZLib and Huffman compression algorithms in Chromium, and tested the speedup and compression ratios of 10 kinds of OpenGL applications, and the parallel performance in the four configurations.The speed of the tested programs that uses ZLib has been improved to different degrees and the maximum raising is 3 times; the average ratio of data compression is above 5.0, up to the maximum 30; the speedup ratio of parallel rendering on a single server is the highest.The overall performance of the ZLib algorithm is good, which can effectively reduce the network traffic.%网络带宽不足严重限制了Chromium等并行图形绘制系统渲染巨型几何场景的速度.通过对网络传输中的几何数据进行无损压缩,提出了一种能有效缓解网络负荷的方法.该方法可以很容易地实现不同算法对特定几何数据的压缩.实现了ZLib和哈夫曼算法对Chromium系统的压缩,测试了系统对10类OpenGL应用程序的加速比和压缩比,以及在4种配置环境下的并行运行效果.使用ZLib算法时,测试程序的运行速度都有不同程度的提高,最高提升3倍;数据压缩比平均在5.0以上,最高为30;并行绘制加速比在单服务器数目下最高.ZLib算法整体表现良好,能有效减少网络通信量.
展开▼
