Abstract:
Network communication is critical for high-performance computer applications. At present, with the complication of numerical simulation applications and the increasing scale of parallelism, the need for application software to alleviate congestion and reduce communication protocol overhead is becoming more and more urgent. The traditional message merging method only merges small messages with the goal of reducing the communication protocol overhead and latency. In contrast, from the perspective of scheduling algorithms, this paper proposes an algorithm  for reducing the network congestion of large messages through message rearrangement and improving the effective utilization of the network by merging messages based on priority. Experiments show that our algorithm   can increase the communication performance of real applications by up to 41%, and on average by 10% for each application.