Advertisement

Parallel Implementation and Optimizations of Visibility Computing of 3D Scene on Tianhe-2 Supercomputer

  • Zhengwei Xu
  • Xiaodong Wang
  • Congpin Zhang
  • Changmao Wu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11334)

Abstract

Visibility computing is a basic problem in computer graphics, and is often the bottleneck in realistic rendering algorithms. Some of the most common include the determination of the objects visible from a viewpoint, virtual reality, real-time simulation and 3D interactive design. As one technique to accelerate the rendering speed, the research on visibility computing has gained great attention in recent years. Traditional visibility computing on single processor machine has been unable to meet more and more large-scale and complex scenes due to lack parallelism. However, it will face many challenges to design parallel algorithms on a cluster due to imbalance workload among compute nodes, the complicated mathematical model and different domain knowledge. In this paper, we propose an efficient and highly scalable framework for visibility computing on Tianhe-2 supercomputer. Firstly, a new technique called hemispheric visibility computing is designed, which can overcome the visibility missing of traditional perspective algorithm. Secondly, a distributed parallel algorithm for visibility computing is implemented, which is based on the master-worker architecture. Finally, we discuss the issue of granularity of visibility computing and some optimization strategies for improving overall performance. Experiments on Tianhe-2 supercomputer show that our distributed parallel visibility computing framework almost reaches linear speedup by using up to 7680 CPU cores.

Keywords

Visibility computing Performance optimization Parallel implementation 

Notes

Acknowledgment

The authors would like to thank the anonymous referees for their valuable comments and helpful suggestions. The work is supported by the National Natural Science Foundation of China under Grant No. 61672508, No. 61379048 and the National Key Research and Development Program of China under Grant No. 2017YFB1400902.

References

  1. 1.
    Tianhe-2(milkyway-2) (2013). http://top500.org/system/177999
  2. 2.
  3. 3.
    Alipour, S., Ghodsi, M., Güdükbay, U., Golkari, M.: Approximation algorithms for visibility computation and testing over a terrain. Appl. Geom. 9(1), 53–59 (2017)CrossRefGoogle Scholar
  4. 4.
    Arvo, J., Kirk, D.: Particle transport and image synthesis. ACM SIGGRAPH Comput. Graph. 24(4), 63–66 (1990)CrossRefGoogle Scholar
  5. 5.
    Assarsson, U., Moller, T.: Optimized view frustum culling algorithms for bounding boxes. J. Graph. Tools 5(1), 9–22 (2000)CrossRefGoogle Scholar
  6. 6.
    Bittner, J., Havran, V., Slavik, P.: Hierarchical visibility culling with occlusion trees. In: Computer Graphics International, p. 207 (1998)Google Scholar
  7. 7.
    Durand, F., Drettakis, G., Thollot, J., Puech, C.: Conservative visibility preprocessing using extended projections, pp. 239–248 (2000)Google Scholar
  8. 8.
    Ericson, C.: Real-Time Collision Detection (The Morgan Kaufmann Series in Interactive 3-D Technology). Morgan Kaufmann Publishers Inc., Burlington (2004)Google Scholar
  9. 9.
    Li, D., et al.: Parallelizing and optimizing large-scale 3D multiphase flow simulations on the Tianhe-2 supercomputer. Concurr. Comput. Pract. Exp. 28(5), 1678–1692 (2016)CrossRefGoogle Scholar
  10. 10.
    O’Neill, M.E.: PCG: a family of simple fast space-efficient statistically good algorithms for random number generation. ACM Trans. Math. Softw. (2014)Google Scholar
  11. 11.
    Pharr, M., Jakob, W., Humphreys, G.: Physically Based Rendering: From Theory to Implementation. Morgan Kaufmann, Burlington (2016)Google Scholar
  12. 12.
    Jiantao, P., Zha, H.: Research on visibil ity for large-scale and complex scenes. J. Comput. Res. Dev. 42(2), 236–246 (2005)CrossRefGoogle Scholar
  13. 13.
    Rohlf, J., Helman, J.: Iris performer: a high performance multiprocessing toolkit for real-time 3D graphics. In: Proceedings of the 21st annual conference on Computer graphics and interactive techniques, pp. 381–394 (1994)Google Scholar
  14. 14.
    Schaufler, G., Dorsey, J., Decoret, X.: Conservative volumetric visibility with occluder fusion. In: Conference on Computer Graphics and Interactive Techniques, pp. 229–238 (2000)Google Scholar
  15. 15.
    Stamminger, M., Drettakis, G.: Perspective shadow maps. ACM Trans. Graph. (TOG) 21(3), 557–562 (2002)CrossRefGoogle Scholar
  16. 16.
    Teller, S.J., Séquin, C.H.: Visibility preprocessing for interactive walkthroughs. In: Conference on Computer Graphics and Interactive Techniques, pp. 61–70 (1991)Google Scholar
  17. 17.
    Wang, B.: Research on point based global illumination. Ph.D. thesis, Shandong University (2014)Google Scholar
  18. 18.
    Wang, W., Wei, F., Enhua, W.: Visibility determination for rendering large scale scenes. J. Comput.-Aided Des. Comput. Graph. 18(2), 161–169 (2006)Google Scholar
  19. 19.
    Wang, Z., Shu, B., Qiu, X., Wang, Z.: Visibility culling for large dynamic crowds within buildings. J. Comput.-Aided Des. Comput. Graph. 21(3), 331–338 (2009)Google Scholar
  20. 20.
    Woop, S., Feng, L., Wald, I., Benthin, C.: Embree ray tracing kernels for CPUs and the Xeon Phi architecture. In: ACM SIGGRAPH 2013 Talks, p. 44. ACM (2013)Google Scholar
  21. 21.
    Changmao, W., Zhang, Y., Yang, C.: Large scale satellite imagery simulations with physically based ray tracing on Tianhe-1a supercomputer. In: 10th IEEE International Conference on High Performance Computing and Communications (HPCC), pp. 549–556. IEEE (2013)Google Scholar
  22. 22.
    Wu, C., Zhang, Y., Yang, C., Lu, Y.: Physically based parallel ray tracer for the metropolis light transport algorithm on the Tianhe-2 supercomputer. In: 2014 20th IEEE International Conference on Parallel and Distributed Systems (ICPADS), pp. 444–453. IEEE (2014)Google Scholar
  23. 23.
    Zhang, C., Yue, D.: Distributed parallel algorithm of physically based ray tracing. J. Comput. Appl. 34(6), 1591–1594 (2014)MathSciNetGoogle Scholar
  24. 24.
    Zhang, H., Manocha, D., Hudson, T., Hoff, K.E.: Visibility culling using hierarchical occlusion maps. In: Conference on Computer Graphics and Interactive Techniques, pp. 77–88 (1997)Google Scholar
  25. 25.
    Zhao, Y., Yoshigoe, K., Bian, J., Xie, M., Xue, Z., Feng, Y.: A distributed graph-parallel computing system with lightweight communication overhead. IEEE Trans. Big Data 2(3), 204–218 (2017)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  1. 1.School of Computer and Information EngineeringHenan Normal UniversityHenanChina
  2. 2.Laboratory of Parallel Software and Computational Science, Institute of SoftwareChinese Academy of SciencesBeijingChina

Personalised recommendations