.svg)
.svg)
.svg)
.svg)
.svg)
.svg)
.png)
Paper
Parallel Algorithms for Intersection Computation
Presenter
I graduated from the University of Illinois,Urbana-Champaign in 2018 with a Ph.D in Computer Science. My advisor was Dr. Marc Snir and I developed a multi-threaded data partitioner for meshes and random point clouds as part of my thesis. After working for three years as R&D Engineer at Ansys, Inc, I joined Illinois Institute of Technology, Chicago in 2022 as R&D developer. My research interests are in the areas of Parallel Algorithms, HPC Software Architecture and Performance Modeling.
Description
This paper discusses parallel algorithms for computing intersections
between pairs of meshes. We used parallel intersection algorithms
to compute interpolation weights in coupled solvers which are part
of multi-physics simulations. We present a parallel algorithm for
computing intersections that has linear computational complexity.
We analyze the computation and communication complexities of
this algorithm, along with lower bounds for parallel intersection
computation. The algorithm has low contention and can be executed
on many-core CPUs or offloaded to GPUs. We present strong scaling
results for this algorithm on a heterogeneous machine with multiple
GPUs per node.