English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 57517/91034 (63%)
造访人次 : 13451150      在线人数 : 243
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻

    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/59901

    题名: Efficient path-based multicast in wormhole-routed mesh networks
    作者: Chen, Tzung-Shi;Chang, Chih-yung;Sheu, Jang-Ping
    贡献者: 淡江大學資訊工程學系
    关键词: Interconnection networks;Mesh networks;Multicast;Wormhole routing;Parallel computing
    日期: 2000-07
    上传时间: 2011-10-05 22:25:20 (UTC+8)
    出版者: Amsterdam: Elsevier BV * North-Holland
    摘要: The capability of multidestination wormhole allows a message to be propagated along any valid path in a wormhole-routed network conforming to the underlying base routing scheme. The multicast on the path-based routing model is highly dependent on the spatial locality of destinations participating in multicasting. In this paper, we propose two proximity grouping schemes for efficient multicast in wormhole-routed mesh networks with multidestination capability by exploiting the spatial locality of the destination set. The first grouping scheme, graph-based proximity grouping, is proposed to group the destinations together with locality to construct several disjoint sub-meshes. This is achieved by modeling the proximity grouping problem to graph partitioning problem. The second one, pattern-based proximity grouping, is proposed by the pattern classification schemes to achieve the goal of the proximity grouping. By simulation results, we show the routing performance gains over the traditional Hamiltonian-path routing scheme.
    關聯: Journal of systems architecture 46(10), pp.919-930
    DOI: 10.1016/S1383-7621(99)00049-1
    显示于类别:[資訊工程學系暨研究所] 期刊論文


    档案 大小格式浏览次数



    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回馈