Distributed Parallel Simulation of Primary Sample Space Metropolis Light Transport

  • Changmao Wu
  • Changyou ZhangEmail author
  • Qiao SunEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11334)


Monte-Carlo rendering algorithms are known for producing highly realistic images, but at a significant computational cost, because they rely on tracing up to trillions of light paths through a scene to simulate physically based light transport. For this reason, a large body of research exists on various techniques for accelerating these costly algorithms. As one of the Monte-Carlo rendering algorithms, PSSMLT (Primary Sample Space Metropolis Light Transport) is widely used nowadays for photorealistic rendering. Unfortunately, the computational cost of PSSMLT is still very high since the space of light paths in high-dimension and up to trillions of paths are typically required in such path space. Recent research on PSSMLT has proposed a variety of optimized methods for single node rendering, however, multi-node rendering for PSSMLT is rarely mentioned due in large part to the complicated mathematical model, complicated physical processes and the irregular memory access patterns, and the imbalanced workload of light-carrying paths.

In this paper, we present a highly scalable distributed parallel simulation framework for PSSMLT. Firstly, based on light transport equation, we propose the notion of sub-image with certain property for multi-node rendering and theoretically prove that the whole set of sub-images can be combined to produce the final image; Then we further propose a sub-image based assignment partitioning algorithm for multi-node rendering since the traditional demand-driven assignment partitioning algorithm doesn’t work well. Secondly, we propose a physically based parallel simulation for the PSSMLT algorithm, which is revealed on a parallel computer system in master-worker paradigm. Finally, we discuss the issue of granularity of the assignment partitioning and some optimization strategies for improving overall performance, and then a static/dynamic hybrid scheduling strategy is described. Experiments show that framework has a nearly linear speedup along with the CPU core count up to 9,600 on the Tianhe-2 supercomputer, which suggests that the proposed framework has a high scalability and efficiency.


Primary sample space metropolis light transport Physically based ray tracing Assignment partitioning Hybrid scheduling Distributed computing Performance optimization 



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. We thank Benedikt Bitterli [24] for providing the test scenes used in our evaluation. Further, special acknowledgement goes to Dong Wang, Yuanyuan Wan and Huizhong Lu for answering our technical questions on how to using Tianhe-2 supercomputer. We are particularly grateful to Matt Pharr and Wenzel Jakob et al. for the making the PBRT and Mitsuba renderers publicly available [1, 14].


  1. 1.
    Pharr, M., Jakob, W., Humphreys, G.: Physically Based Rendering: From Theory to Implementation, 3rd edn. Morgan Kaufmann Publishers Inc., San Francisco (2016)Google Scholar
  2. 2.
    Pharr, M., Humphreys, G.: Physically Based Rendering: From Theory To Implementation, 2nd edn. Morgan Kaufmann Publishers Inc., San Francisco (2010)Google Scholar
  3. 3.
    Pharr, M., Humphreys, G.: Physically Based Rendering: From Theory To Implementation, 1st edn. Morgan Kaufmann Publishers Inc., San Francisco (2004)Google Scholar
  4. 4.
    Keller, A.: Quasi-Monte: Carlo image synthesis in a nutshell. In: Dick, J., Kuo, F., Peters, G., Sloan, I. (eds.) Monte Carlo and Quasi-Monte Carlo Methods 2012, pp. 213–249. Springer, Heidelberg (2013). Scholar
  5. 5.
    Davidovič, T., Křrivánek, J., Hašan, M., Slusallek, P.: Progressive light transport simulation on the GPU: survey and improvements. ACM Trans. Graph. 33(3), 29:1–29:19 (2014)CrossRefGoogle Scholar
  6. 6.
    Ritschel, T., Dachsbacher, C., Grosch, T., Kautz, J.: The state of the art in interactive global illumination. Comput. Graph. Forum 31(1), 160–188 (2012)CrossRefGoogle Scholar
  7. 7.
    Dutré, P., et al.: State of the art in Monte Carlo global illumination. In: ACM SIGGRAPH 2004 Course Notes, SIGGRAPH 2004. ACM, New York (2004)Google Scholar
  8. 8.
    Kajiya, J.T.: The rendering equation. SIGGRAPH Comput. Graph. 20(4), 143–150 (1986)CrossRefGoogle Scholar
  9. 9.
    Veach, E., Guibas, L.: Bidirectional estimators for light transport. In: Sakas, G., Müller, S., Shirley, P. (eds.) Photorealistic Rendering Techniques, pp. 145–167. Springer, Heidelberg (1995). Scholar
  10. 10.
    Veach, E., Guibas, L.J.: Metropolis light transport. In: Proceedings of the 24th Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH 1997, pp. 65–76. ACM Press/Addison-Wesley Publishing Co., New York (1997)Google Scholar
  11. 11.
    Kelemen, C., Szirmay-Kalos, L., Antal, G., Csonka, F.: A simple and robust mutation strategy for the metropolis light transport algorithm. Comput. Graph. Forum 21(3), 531–540 (2002)CrossRefGoogle Scholar
  12. 12.
    Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Teller, A.H., Teller, E.: Equations of state calculations by fast computing machines. J. Chem. Phys. 21, 1087–1091 (1953)CrossRefGoogle Scholar
  13. 13.
    Fan, S., Chenney, S., Lai, Y.C.: Metropolis photon sampling with optional user guidance. In: Proceedings of the 16th Eurographics Symposium on Rendering, pp. 127–138. Eurographics Association (2005)Google Scholar
  14. 14.
    Jakob, W.: Mitsuba renderer (2018).
  15. 15.
    Veach, E.: Robust Monte Carlo methods for light transport simulation. Ph.D. thesis, Stanford University, Stanford (1998). AAI9837162Google Scholar
  16. 16.
    Keller, A., Premoze, S., Raab, M.: Advanced (quasi) Monte Carlo methods for image synthesis. In ACM SIGGRAPH 2012 Courses, SIGGRAPH 2012, pp. 21:1–21:46. ACM, New York (2012)Google Scholar
  17. 17.
    Wu, C., Zhang, Y., Yang, C.: Large scale satellite imagery simulations with physically based ray tracing on Tianhe-1A supercomputer. In Proceedings of the 15th IEEE International Conference on High Performance Computing and Communications (HPCC), HPCC 2013, Zhangjiajie, China, pp. 549–556. IEEE (2013)Google Scholar
  18. 18.
    Freisleben, B., Hartmann, D., Kielmann, T.: Parallel raytracing: a case study on partitioning and scheduling on workstation clusters. In: Proceedings of the Thirtieth Hawaii International Conference on System Sciences, vol. 1, pp. 596–605, January 1997Google Scholar
  19. 19.
    Reinhard, E.: Scheduling and data management for parallel ray tracing. Technical report, Bristol, UK (1999)Google Scholar
  20. 20.
    Kelemen, C., Szirmay-Kalos, L.: Simple and robust mutation strategy for metropolis light transport algorithm. Technical report TR-186-2-01-18, Institute of Computer Graphics and Algorithms, Vienna University of Technology, Favoritenstrasse 9–11/186, A-1040 Vienna, Austria, July 2001. Human contact: Scholar
  21. 21.
    Plachetka, T.: POV Ray: persistence of vision parallel raytracer. In: Proceedings of Spring Conference on Computer Graphics, Budmerice, Slovakia, pp. 123–129 (1998)Google Scholar
  22. 22.
    Tanenbaum, A.S., Van Steen, M.: Distributed Systems: Principles and Paradigms, 2nd edn. Prentice-Hall, Upper Saddle River (2006)zbMATHGoogle Scholar
  23. 23.
    Tianhe-2 (milkyway-2) (2013).
  24. 24.
    Bitterli, B.: Rendering resources (2016).

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  1. 1.Laboratory of Parallel Software and Computational ScienceInstitute of Software, Chinese Academy of SciencesBeijingChina

Personalised recommendations