文章基本信息

标题：Novel Broadcasting Algorithm of the Complete Recursive Network
本地全文：下载
作者：J.-F. Fang ; W.-Y. Liang ; H.-R. Chen 等
期刊名称：Informatica
印刷版ISSN：1514-8327
电子版ISSN：1854-3871
出版年度：2007
卷号：31
期号：1
出版社：The Slovene Society Informatika, Ljubljana
摘要：The interconnection network considered in this paper is the complete WK-Recursive network that demonstrates many attractive properties, such as high degree of regularity, symmetry and efficient communication. Chen and Duh have proposed a distributed stack-base broadcasting algorithm for the complete WK-Recursive networks [Networks, 24 (1994) 303-317]. To perform this algorithm, a stack of O(log N) elements, where N is the number of nodes, to keep the labels of links is included in each message. Moreover, as a node receives the message, a series of O(log N) pop and push operations on the stack is required. In this paper, we present a novel broadcasting algorithm for the complete WK- Recursive network, which is much simpler and requires only constant data included in each message and constant time to determine the neighbors to forward the message.
关键词：complete WK-Recursive networks; interconnection networks; broadcasting algorithms