ROUTING AND BROADCASTING ON INCOMPLETE AND GRAY CODE INCOMPLETE HYPERCUBES
作者:
IVAN STOJMENOVIĆ,
期刊:
Parallel Algorithms and Applications
(Taylor Available online 1993)
卷期:
Volume 1,
issue 3
页码: 167-177
ISSN:1063-7192
年代: 1993
DOI:10.1080/10637199308915439
出版商: Taylor & Francis Group
关键词: Hypercubes;incomplete hypercubes;routing;broadcasting;data communication;Gray code;asynchronous and synchronous hypercube models;C.1.2;F.1.2;F.2.2
数据来源: Taylor
摘要:
We propose new deadlock-free routing and broadcasting algorithms for incomplete hypercube network that have optimal communication and computation time. Broadcasting algorithm may run on one-port communication model of hypercube and is suitable for both the asynchronous (MIMD, or distributed) and synchronous (SIMD, or parallel) hypercube models. Routing and broadcasting procedures have optimal distance paths between any two nodes. We then introduce a new model of computation, Gray code incomplete hypercube (GCIH), which is an interval of nodes of hypercube in Gray code order, and obtain similar results for the new model.
点击下载:
PDF (258KB)
返 回