Deterministic Routing of h-relations on the Multibutterfly

In this paper we devise an optimal deterministic algorithm for routing h-relations on-line on an N-input/output multibutterfly. The algorithm, which is obtained by generalizing the circuit-switching techniques of [3], routes any h-relation with messages of X bits in O , hX + logN steps in the bit model, and in O , hdX=logNe + logN communication steps in the word model. Unlike other recently developed algorithms, our algorithm does not need extra levels of expanders, hence minimizes the layout area. Moreover, the network topology does not depend on h.

• Type: Conference
• Year: 1998
• Where: IPPS
• Authors: Andrea Pietracaprina
• Keywords: Distributed And Parallel Computing, IPPS 1998, LogN Communication Steps, LogN Steps, Optimal Deterministic Algorithm