Some LCP decompositions of multistage interconnection networks

被引：0
|
作者：
Dept. of Mathematics, Shanghai Jiaotong Univ., Shanghai 200240, China [1 ]
机构：
来源：
J. Shanghai Jiaotong Univ. Sci. | 2006年 / 1卷 / 116-120期
关键词：
Multiprocessing systems - Theorem proving;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Some useful layered cross product decompositons are derived both for general bit permutation networks and for (2n-1)-stage multistage interconnection networks. Several issues in related works are clarified and the rearrangeability of some interesting networks are considered. In particular, the rearrangeability of one class of networks is formulated as a new type of combinatorial design problems.
引用
收藏
相关论文
共 50 条
12345