Autor(es)

Junqueira Saldanha, Matheus Henrique ; Lopes de Souza, Paulo Sergio ; Rodrigues, JMF ; Cardoso, PJS ; Monteiro, J ; Lam, R ; Krzhizhanovskaya, VV ; Lees, MH ; Dongarra, JJ ; Sloot, PMA

• Tipo de documento: Artigo Científico
• Fonte: COMPUTATIONAL SCIENCE - ICCS 2019, PT I; v. 11536, p. 15-pg., 2019-01-01.

Resumo

The problem of counting collisions or interactions is common in areas as computer graphics and scientific simulations. Since it is a major bottleneck in applications of these areas, a lot of research has been carried out on such subject, mainly focused on techniques that allow calculations to be performed within pruned sets of objects. This paper focuses on how interaction calculation (such as collisions) within these sets can be done more efficiently than existing approaches. Two algorithms are proposed: a sequential algorithm that has linear complexity at the cost of high memory usage; and a parallel algorithm, mathematically proved to be correct, that manages to use GPU resources more efficiently than existing approaches. The proposed and existing algorithms were implemented, and experiments show a speedup of 21.7 for the sequential algorithm (on small problem size), and 1.12 for the parallel proposal (large problem size). By improving interaction calculation, this work contributes to research areas that promote interconnection in the modern world, such as computer graphics and robotics. (AU)

• Processo FAPESP: 17/25410-8 - Predição de Estruturas de Proteínas com Algoritmos Paralelos Ortogonais às Plataformas Paralelas
• Beneficiário: Matheus Henrique Junqueira Saldanha
• Modalidade de apoio: Bolsas no Brasil - Iniciação Científica
• Processo FAPESP: 13/07375-0 - CeMEAI - Centro de Ciências Matemáticas Aplicadas à Indústria
• Beneficiário: Francisco Louzada Neto
• Modalidade de apoio: Auxílio à Pesquisa - Centros de Pesquisa, Inovação e Difusão - CEPIDs