Data distributions for sparse matrix vector multiplication
Parallel Computing
Performance and Scalability of Preconditioned Conjugate Gradient Methods on Parallel Computers
IEEE Transactions on Parallel and Distributed Systems
Versatile and efficient techniques for simulating cloth and other deformable objects
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
Large steps in cloth simulation
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Numerical Linear Algebra for High Performance Computers
Numerical Linear Algebra for High Performance Computers
A Parallel Cloth Simulator Using Multilevel Algorithms
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Simulating Cloth Free-Form Deformation with a Beowulf Cluster
Proceedings of the 9th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
Parallel techniques in irregular codes: cloth simulation as case of study
Journal of Parallel and Distributed Computing
Virtual try on: an application in need of GPU optimization
Proceedings of the ATIP/A*CRC Workshop on Accelerator Technologies for High-Performance Computing: Does Asia Lead the Way?
Parallel implicit integration for cloth animations on distributed memory architectures
EG PGV'04 Proceedings of the 5th Eurographics conference on Parallel Graphics and Visualization
Exploiting parallelism in physically-based simulations on multi-core processor architectures
EG PGV'07 Proceedings of the 7th Eurographics conference on Parallel Graphics and Visualization
| Hi-index | 0.00 |
The computational requirements of cloth and other non-rigid solid simulations are high and often the running time is far from real time. In this paper, an efficient solution of the problem on parallel computer is presented. An application, which combines data parallelism with task parallelism has been developed, achieving a good load balancing and minimizing the communication cost. The execution time obtained for a typical problem size, its super-linear speed-up, and the iso-scalability shown by the model, will allow to reach real-time simulations in sceneries of growing complexity, using the most powerful multiprocessors.