Author： Sinop Ali Kemal Abaci Tolga Akkuş Ümit Gürsoy Attila Güdükbay Ugur
Publisher： Springer Publishing Company
ISSN： 0920-8542
Source： The Journal of Supercomputing, Vol.31, Iss.3, 2005-03, pp. : 249-263
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
In this paper, we present a parallel system called PHR for computing hierarchical radiosity solutions of complex scenes. The system is targeted for multi-processor architectures with distributed memory. The system evaluates and subdivides the interactions level by level in a breadth first fashion, and the interactions are redistributed at the end of each level to keep load balanced. In order to allow interactions freely travel across processors, all the patch data is replicated on all the processors. Hence, the system favors load balancing at the expense of increased communication volume. However, the results show that the overhead of communication is negligible compared with total execution time. We obtained a speed-up of 25 for 32 processors in our test scenes.
Related content
Access to resources
Recommend
A novel dynamic load balancing scheme for parallel systems
By Lan Z. Taylor V.E. Bryan G.
Journal of Parallel and Distributed Computing, Vol. 62, Iss. 12, 2002-12 ,pp. :