A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
Some generalized communication modes enabling the dissemination of information among processors of interconnection networks via vertex-disjoint or edge-disjoint paths in one communication step will be investigated. A thorough study of these communication modes will be presented by giving optimal algorithms for broadcasting, accwnulatian and gossiping in most of the well-known parallel architectures. For those networks in which a Hamiltonian path exists (hypercubes, cube connected cycles,doi:10.1007/3-540-55599-4_84 fatcat:64zeze37ivaj5d67tzedqqpysu