Abstract
Particle-based models are widely spread in the field of computer graphics, and mainly used for real-time simulations of soft deformable bodies. One of the high-demanding computational components of such physically-based simulations is numerical time integration. As the size of the models increases, this component becomes a potential bottleneck in the simulation process, thus parallelism must be deployed in order to preserve the real-time attribute. This paper presents an approach to parallel implicit numeric time integration for graphics clusters. To deal with very large models, we employ a static domain decomposition approach and we fully utilize the massively data parallel capabilities of GPU clusters. We discuss the parallel conjugate gradient algorithm used for time integration and we present a parallel method for generating the very large sparse matrices and vectors involved.
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.
