UMPa: A multi-objective, multi-level partitioner for communication minimization We propose a directed hypergraph model and a refinement heuristic to distribute communicating tasks among the processing units in a distributed memory setting. The aim is to achieve load balance and minimize the maximum data sent by a processing unit. We also take two other communication metrics into account with a tie-breaking scheme. With this approach, task distributions causing an excessive use of network or a bottleneck processor which participates to almost all of the communication are avoided. par We show on a large number of problem instances that our model improves the maximum data sent by a processor up to 34% for parallel environments with 4,16,64 and 256 processing units compared to the state of the art which only minimizes the total communication volume.