An Algorithm for Multi-Source Broadcasting on Kautz Digraphs Using 2-Cycle Rooted Trees

概要

論文の詳細を見る
Multi-source broadcasting is one of the information dissemination problems on interconnection networks such that some (but not all) units disseminate distinct information to all other units. In this paper, we discuss multi-source broadcasting on the Kautz digraph which is one of the models of interconnection networks. We decompose the Kautz digraph K(d, n) into isomorphic cycle-rooted trees whose root-cycle has length 2, then we present an algorithm for multi-source broadcasting using these cycle-rooted trees. This algorithm is able to treat d(d+1) messages simultaneously and takes the same order for required times as lower bound.