期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

多播3-Omega交换网的设计思想 被引量：1

Design Principles for 3-Omega Multicast Switching Network
下载PDF
导出
摘要 阐述了具有最佳硬件复杂度且可无阻地在输入/输出间传输任意多播信号的多播3-Omega网的设计思想,设计理念可表述为“置换-复制-置换”,组成形式为“Omega-1+Omega+Omega-1”。它具有O(nlogn)的硬件代价,存储空间和时间复杂度均为O(nlogn),连接建立时间为(logn),传输延迟O(logn),符合Shannon的硬件代价极限标准,具有良好的可实现性。 Principles for design practical self-routing 3-Omega multicast connection networks which can realize arbitrary multicast assignments between its inputs and outputs without any blocking are described. The overall principles behind the architecture can be described as ＂permutation-copy-permutation＂, It is constructed by ＂Omega-l＋Omega＋Omega-l＇. It has an optimal O（nlogn） bits of memory and routing time, O（logn） connection time and O（logn） logic gates delay which meets Shannon＇s lower bound on memory requirements established in the 1950s.
作者 张联 刘刚 顾乃杰
机构地区 中国科学技术大学计算机科学技术系
出处 《计算机工程》 EI CAS CSCD 北大核心 2006年第17期184-185,188,共3页 Computer Engineering
基金 中国科学院软件所计算机科学重点实验室开放课题基金资助项目(SYSKF0501)
关键词 Omega网 多播 扩展还原概念 Omega network： Multicasting Expand-rout-contract concept
分类号 TP393.02 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献9

  • 1Yang Y Y,Wang J C.A New Self-routing Multicast Network[J].IEEE Trans.Parallel and Distributed Systems,1999,10(11):1299-1316.
  • 2顾乃杰,潘伟,李栋,刘刚,陈静.一种新型的可重排多播网络[J].小型微型计算机系统,2003,24(2):179-183. 被引量：2
  • 3Szymanski T H.Design Principles for Practical Self-routing Nonblocking Switching Networks with O(nlogn) Bit-complexity[J].IEEE Transactions on Computers,1997,46(10):1057-1069.
  • 4Shannon C E.Memory Requirements in a Telephone Exchange[J].Bell System Tech.J.,1950,29:343-349.
  • 5U.S.National Science Foundation.Research Priorities in Networking and Communication[R].Arilington,Va.:Report to the NSF Division of Networking and Communications Research and Infrastructure,1994.
  • 6Feng T,Seo S.A New Routing Algorithm for a Class of Rearrangeable Networks[J].IEEE Trans.Computers,1994,43(11):1270-1280.
  • 7Maron D M,Mendlovic D.Comment on a New Routing Algorithm for a Class of Rearrangeable Networks[J].IEEE Trans.Computers,1997,46(6):734.
  • 8Cam H,Forts J A B.Work-efficient Routing Algorithms for Rearrangeable Symmetrical Networks[J].IEEE Trans.Parallel and Distributed Systems,1999,10(7):733-741.
  • 9Lee C,Oruc A Y.Design of Efficient and Easily Routable Generalized Connectors[J].IEEE Trans.Communication,1995,43(2-4):646-650.

二级参考文献10

  • 1[1]Varavithya V and Mohapatra P. Asychronous tree-based multicasting in wormhole-switched MINs[J].IEEE Trans. Parallel and Distributed Systems, Nov. 1999.10(11):1159～1178
  • 2[2]Xu H. Gui Y and Ni L M. Optimal software multicast in wormhole-routed multistage networks[J]. IEEE Trans. Parallel and Distributed Systems, June 1997.8(6):597～607
  • 3[3]Yang Y and Wang J. A new self-routing multicast network[J]. IEEE Trans. Parallel and Distributed Systems, Dec.1999.10(11): 1299～1316
  • 4[4]Andresen S. The looping algorithm extended to base 2t rearrangeable switching networks[J].IEEE Trans. Communications, Oct. 1977.COM-25, (10):1057～1063
  • 5[5]Cam H and Forts J A B. Work-efficient routing algorithms for rearrangeable symmetrical networks[J].IEEE Trans. Parallel and Distributed Systems, July. 1999 10(7):733～741
  • 6[6]Feng T and Seo S. A new routing algorithm for a class of rearrangeable networks[J]. IEEE Trans. Computers, Nov. 1994 43(11):1270～1280
  • 7[7]Maron D M and Mendlovic D. Comment on‘a new routing algorithm for a class of rearrangeable networks'[J]. IEEE Trans. Computers, June. 1997 46(6):734
  • 8[8]Lee T. Nonblocking copy networks for multicast packet switching[J]. IEEE Journ al on Selected Areas in Communications, Dec. 1998 6(9):1455～1647
  • 9[9]Park J, Jacob L and Yoon H. Performance analysis of a multistage interconnect ion networks using a multicast algorithm[C].Proc. of the High-Performance Computing on the Information Superhighway, 79～84, Seoul, Korea, April 1997.
  • 10[10]Lee C Y and Orug A Y. A fast parallel algorithm for routing unicast assignments in benes networks[J]. IEEE Trans. Parallel and Distributed Systems, March 1995.6(3):329～334

共引文献1

同被引文献8

  • 1刘勇,顾乃杰,任开新,刘刚.基于Omega网的新型自路由多播网络[J].山东大学学报（工学版）,2006,36(4):37-43. 被引量：3
  • 2Yang Yuanyuan,Masson G M.Broadcast Ring Sandwich Networks[J].IEEE Trans.on Computers,1995,44(10):1169-1180.
  • 3Houlahan J F.Hypercube Sandwich Approach to Conferencing[J].Journal of Supercomputing,1996,10(3):271-283.
  • 4Du Y,Masson G M.Strictly Nonblocking Conference Networks Using High-dimensional Meshes[J].Networks,1999,33(4):293-308.
  • 5Yang Yuanyuan.A New Conference Network for Group Communication[C]//Proc.of 2001 International Conference on Parallel Processing.Valencia,Spain:[s.n.],2001:141-148.
  • 6Yang Yuanyuan,Wang Jianchao.A Class of Multistage Conference Switching Networks for Group Communication[J].IEEE Transactions on Parallel and Distributed Systems,2004,15(3):228-243.
  • 7王鼎兴,陈国良.互联网结构与分析[M].北京:科学出版社,1990.
  • 8Lee T.Nonblocking Copy Networks for Multicast Packet Switching[J].IEEE Journal on Selected Areas in Communications,1998,6(9):1455-1647.

引证文献1

计算机工程
2006年 第17期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部