Jorge Monsegny, UP Consultorias and William Agudelo, ICP-Ecopetrol
A new parallel algorithm for shortest path ray tracing
on graphics processing units was implemented. This
algorithm avoids the enforcing of mutual exclusion during
path calculation that is found in other parallel graph
algorithms and that degrades their performance. Tests with
velocity models composed of millions of vertices with
a high conectivity degree show that this parallel algorithm
outperforms the sequential implementation.
![[pdf]](icons/pdf.png){kind=icon}