Section: New Software and Platforms
TreeMatch
Keywords: Intensive parallel computing - High-Performance Computing - Hierarchical architecture - Placement
Scientific Description
TreeMatch provides a permutation of the processes to the processors/cores in order to minimize the communication cost of the application.
Important features are : the number of processors can be greater than the number of applications processes , it assumes that the topology is a tree and does not require valuation of the topology (e.g. communication speeds) , it implements different placement algorithms that are switched according to the input size.
Some core algorithms are parallel to speed-up the execution.
TreeMatch is integrated into various software such as the Charm++ programming environment as well as in both major open-source MPI implementations: Open MPI and MPICH2.
Functional Description
TreeMatch is a library for performing process placement based on the topology of the machine and the communication pattern of the application.