In parallel/distributed computing systems, the all-to-all personalized communication (or complete exchange) is required in numerous applications of parallel processing. In this paper, we consider this problem for log N stage Multistage Interconnection Networks (MINs). It is proved that the set of admissible permutations for a MIN can be partitioned in Latin Squares. Since routing permutations belonging to a Latin Square provides the all-to-all personalized communication, a method to realize the complete exchange with time complexity O(N), that is optimal, can be derived. This method, compared with other ones in literature, does not necessitate of neither pre-computation nor memory allocation to record the Latin Square, because an explicit construction of it is not required; furthermore it is applicable to any log N stage multistage networks since it is independent of the topology
All-to-all personalized communication on multistage interconnection networks / Massini, Annalisa. - In: DISCRETE APPLIED MATHEMATICS. - ISSN 0166-218X. - 128(2003), pp. 435-446. [10.1016/S0166-218X(02)00504-8]
Scheda prodotto non validato
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo
Titolo: | All-to-all personalized communication on multistage interconnection networks | |
Autori: | ||
Data di pubblicazione: | 2003 | |
Rivista: | ||
Citazione: | All-to-all personalized communication on multistage interconnection networks / Massini, Annalisa. - In: DISCRETE APPLIED MATHEMATICS. - ISSN 0166-218X. - 128(2003), pp. 435-446. [10.1016/S0166-218X(02)00504-8] | |
Handle: | http://hdl.handle.net/11573/44586 | |
Appartiene alla tipologia: | 01a Articolo in rivista |