A parallel progressive radiosity algorithm based on patch data circulation
Çapin, T. K.
Computers and Graphics
307 - 324
Item Usage Stats
MetadataShow full item record
Abstract - Current research on radiosity has concentrated on increasing the accuracy and the speed of the solution. Although algorithmic and meshing techniques decrease the execution time, still excessive computational power is required for complex scenes. Hence, parallelism can be exploited for speeding up the method further. This paper aims at providing a thorough examination of parallelism in the basic progressive refinement radiosity, and investigates its parallelization on distributed-memory parallel architectures. A synchronous scheme, based on static task assignment, is proposed to achieve better coherence for shooting patch selections. An efficient global circulation scheme is proposed for the parallel light distribution computations, which reduces the total volume of concurrent communication by an asymptotical factor. The proposed parallel algorithm is implemented on an Intel's iPSC/2 hypercube multicomputer. Load balance qualities of the proposed static assignment schemes are evaluated experimentally. The effect of coherence in the parallel light distribution computations on the shooting patch selection sequence is also investigated. Theoretical and experimental evaluation is also presented to verify that the proposed parallelization scheme yields equally good performance on multicomputers implementing the simplest (e.g. ring) as well as the richest (e.g. hypercube) interconnection topologies. This paper also proposes and presents a parallel load re-balancing scheme which enhances our basic parallel radiosity algorithm to be usable in the parallelization of radiosity methods adopting adaptive subdivision and meshing techniques. Copyright © 1996 Elsevier Science Ltd.
Distributed Computer Systems
Distributed Memory Parallel Architectures
Patch Data Circulation
Published Version (Please cite this version)http://dx.doi.org/10.1016/0097-8493(95)00132-8
Showing items related by title, author, creator and subject.
Şaykol, E.; Sinop, A. K.; Güdükbay U.; Ulusoy, Ö.; Çetin, A. E. (IEEE, 2004)There is an accelerating demand to access the visual content of documents stored in historical and cultural archives. Availability of electronic imaging tools and effective image processing techniques makes it feasible to ...
Arkin, E.; Tekinerdoğan, Bedir (MDHPCL, 2013)One of the important problems in parallel computing is the mapping of the parallel algorithm to the parallel computing platform. Hereby, for each parallel node the corresponding code for the parallel nodes must be implemented. ...
Erdem, İ. A.; Erdem, M. E.; Atalay, V.; Çetin, A. E. (SPIE, 2004)It is now possible to design real-time, low-cost computer version systems even in personal computers due to the recent advances in electronics and the computer industry. Due to this reason, it is feasible to develop ...