Generalized Algorithm for Parallel Sorting on Product Networks

If G is a connected graph with N nodes, its r dimensional product contains Nr nodes. We present an algorithm which sorts Nr keys stored in the rdimensional product of any graph G in O(r2S(N)) time where S(N) depends on G. We show that for any graph G, S(N) is bounded above by O(N), establishing an upper bound of O(r2N) for the time complexity of sorting Nr keys on any product network. When r is xed, this leads to the asymptotic complexity O(N) to sort Nr keys, which is optimal for several instances of product networks. There are graphs for which S(N) = O(Log2N) which leads to the asymptotic running time of O(Log2N).

• Type: Conference
• Year: 1995
• Where: ICPP
• Authors: Antonio Fernández, Nancy Eleser, Kemal Efe
• Keywords: Connected Graph, Distributed And Parallel Computing, ICPP 1995, Nr Keys, Nr Nodes