Exchanging messages of different sizes

This paper deals with the study of the exchange of messages among a set of processors linked through an interconnection network. We focus on general, non-uniform versions of message 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 heuristics and determine which algorithms are best suited to several parallel systems. We propose new algorithms that combine the advantages of some of the heuristics. We conclude with experiments and simulations of the algorithms and analyses of their performances.

• Type: Journal
• Year: 2006
• Where: JPDC
• Authors: Alfredo Goldman, Joseph G. Peters, Denis Trystram
• Keywords: General Asynchronous Problems, JPDC 2006, Linear Cost Model, Message Exchange Problems