Аннотация:We consider a new approach to the classical problem of allocating
parallel application processes to nodes of a high-performance computing sys-
tem. A new algorithm which analyzes the communication structure of processes
is presented. The obtained communication structure can be used to recommend
mapping for a high-performance computing system with a given topology. The
input for the proposed algorithm is the data representing the total length of
messages sent between every two processes. A set of processes is analyzed as a
system of particles which evolve under the in fluence of attractive and repulsive
forces. The identified configuration of the particles reflects the communication
structure of the underlying parallel application and can be used for effective
mapping heuristics.