In this paper, we study the exchange of messages among a set of processors linked through an interconnection network. We focus on general, non-unimiform versions of all-to-all (or complete) exchange problems in asynchronous systems with a linear cost model and messages of arbitrary sizes. We extend previous complexity results to show that the general asynchronous problems are NP-complete. We present several approximation algorithms and determine which heuristics are best suited to several parallel systems. We conclude with experimental results that show that our algorithms outperform the native all-to-all exchange algorithm on an IBM SP2 when the number of processors is odd.
Goldman, A., Trystram, D., & Peters, J. (1998). Exchange of messages of different sizes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1457 LNCS, pp. 194–205). Springer Verlag. https://doi.org/10.1007/bfb0018539