Abstract
The radiosity method is a very demanding process in terms of computing and memory resources. To cope with these problems, parallel solutions have been proposed in the literature. A new parallel solution, based on the use of a shared virtual memory, is proposed. It will be shown that this concept of SVM greatly simplifies the implementation of a parallel algorithm since distributed data are managed by the operating system. This new parallel radiosity algorithm has been implemented on an iPSC/2 hypercube using the Koan SVM. The first results obtained with this algorithm are encouraging since the calculated efficiency curve is nearly linear.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
