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


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


    题名: Balancing buffer utilization in meshes using a "restricted area" concept
    作者: 莊博任;Chuang, Po-jen;Chen, Juei-tang;Jiang, Yue-tsuen
    贡献者: 淡江大學電機工程學系
    日期: 2002-08
    上传时间: 2010-03-26 21:32:04 (UTC+8)
    出版者: Piscataway: Institute of Electrical and Electronics Engineers (IEEE)
    摘要: Adaptive routing and virtual channels are used to increase routing adaptivity in wormhole-routed two-dimensional meshes. But increasing channel buffer utilization without considering even distribution of the traffic loads tends to cause congestion in the most adaptive routing area. To avoid such traffic congestion, a concept of the restricted area is proposed. The proposed restricted area, defined to be a part of the network where message transmission concentrates, can be located following the region of adaptivity. By properly guiding message routing inside and outside the area, we are able to achieve more balanced buffer utilization and to reduce traffic congestion accordingly. The performance of several routing algorithms with or without using the restricted area is simulated and evaluated under various traffic loads and distribution patterns. The results indicate that routing algorithms with the restricted areas yield constantly larger throughput and smaller latency than routing algorithms without using the concept.
    關聯: IEEE Transactions on Parallel and Distributed Systems 13(8), pp.814-827
    DOI: 10.1109/TPDS.2002.1028438
    显示于类别:[電機工程學系暨研究所] 期刊論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    1045-9219_13(8)p814-827.pdf6936KbAdobe PDF477检视/开启

    在機構典藏中所有的数据项都受到原著作权保护.

    TAIR相关文章

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