On-the-fly clustering for exascale molecular dynamics simulations. - presented by Dr Alizée Dubois and Thierry Carrard

On-the-fly clustering for exascale molecular dynamics simulations.

Alizée Dubois and Thierry Carrard

ADThierry Carrard
Slide at 27:09
Activités
Visionneur de documents
3 mars 15:28
sur 68
pres_algo_killian.pdf
192,2%
METHODOLOGY AND TECHNICAL BOTTLENECKS
CONNECTED COMPONENTS ANALYSIS
IMAGE PROCESSING
GRAPH PROCESSING
COMMUNITY
COMMUNITY
Shared Memory Parallelization
Distributed Memory
Finite number of pass
Iterative algorithm
Not scalable beyond a single
Scalable, but requires multiple
node
iterations
Necessity to port the algorithm
To be adapted for 3D images
to a distributed memory system
while limiting the number of
passes
A. DUBOIS - T. CARRARD - COMPUTER PHYSICS COMMUNICATIONS SEMINAR SERIES - 03/03/25
II Votre écran est partagé par le biais de l'application app.zoom.us.
Arrêter le partage
Masquer
Share slide
Summary (AI generated)

The image processing method for developing connected components has been established. We will now transition to a new implementation focused on graph processing.

As previously mentioned, the algorithm developed during the PhD is efficient and well-optimized. However, it has a limitation: it consolidates information into a central MPI node. To address this, we aimed to create an alternative algorithm for two main reasons. First, we sought a simpler algorithm that could be adapted for GPU implementation in the near future. Second, for large simulations, we wanted to ensure robustness, avoiding scenarios where all information is gathered on a single node.

The alternative implementation we have recently finalized maintains the same starting point as before. Regarding the local MPI process, it operates similarly to the previous algorithm.