English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 56557/90363 (63%)
造訪人次 : 11843341      線上人數 : 69
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: 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 ©   - 回饋