检索结果-内蒙古大学图书馆

MRCN: Throughput-Oriented Multicast routing for Customized Network-on-Chips

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2023年第1期34卷 163-179页

作者： Lee, Young Sik Kim, Yong Wook Han, Tae Hee Sungkyunkwan Univ Dept Elect & Comp Engn Suwon 16419 South Korea Sungkyunkwan Univ Dept Semicond Syst Engn Suwon 16419 South Korea

The relentless proliferation of Big Data and artificial intelligence has compelled computing platform architectures to evolve into heterogeneous multicores for greater energy efficiency. A customized network-on-chip (NoC) supporting interconnection diversity is pivotal for the asymmetric data-access traffic requirements of modern heterogeneous multicore system-on-chip (SoC). A significant portion of on-chip data access comprises single-source multi-destination (SSMD) traffic, which supports barrier synchronization, multi-threading, cache coherency protocols, and deep neural network (DNN) acceleration. By amortizing SSMD traffic, multicast routing is essential for effectively utilizing communication bandwidth. One of the primary concerns in supporting multicast routing in NoCs is to circumvent the additional deadlock conditions caused by branch operations among the active routers. However, it is challenging to implement the throughput-optimized multicast routing in irregular topology-based NoCs because the deadlock conditions become highly complicated, and the Hamiltonian path required to apply the labeling rule may not exist. Two important observations were identified regarding multicast routing in customized NoCs: 1) Even if the NoC lacks a Hamiltonian path, deadlock-freedom can be guaranteed by restricting branch operations to a specific destination. 2) A variable path diversity in a custom topology can be leveraged in routing path allocation and branch. based on these properties, this study proposes a deadlock-free and throughput-enhanced multicast routing for customized NoC (MRCN). MRCN ensures deadlock freedom by utilizing extended routing and router labeling rules. Furthermore, destination router partitioning and traffic-aware adaptive branching are incorporated to reduce packet routing hops and disperse channel traffic. The effectiveness of MRCN was verified using Noxim, a well-known cycle-accurate NoC simulator, under various topologies and traffic patterns.

关键词： Customized network-on-chip multicast routing irregular topology path-based routing packet branching

来源：评论

学校读者我要写书评

暂无评论

Surface-subsurface flow modeling with path-based runoff routing, boundary condition-based coupling, and assimilation of multisource observation data

引用

WATER RESOURCES RESEARCH 2010年第2期46卷

作者： Camporese, M. Paniconi, C. Putti, M. Orlandini, S. Univ Padua Dipartimento Ingn Idraul Marittima Ambientale & G I-35131 Padua Italy Univ Quebec Inst Natl Rech Sci Ctr Eau Terre & Environm Quebec City PQ G1K 9A9 Canada Univ Modena & Reggio Emilia Dipartimento Ingn Meccan & Civile I-41100 Modena Italy Univ Padua Dipartimento Metodi & Modelli Matemat Sci Applica I-35131 Padua Italy

A distributed physically based model incorporating novel approaches for the representation of surface-subsurface processes and interactions is presented. A path-based description of surface flow across the drainage basin is used, with several options for identifying flow directions, for separating channel cells from hillslope cells, and for representing stream channel hydraulic geometry. Lakes and other topographic depressions are identified and specially treated as part of the preprocessing procedures applied to the digital elevation data for the catchment. Threshold-based boundary condition switching is used to partition potential (atmospheric) fluxes into actual fluxes across the land surface and changes in surface storage, thus resolving the exchange fluxes, or coupling, between the surface and subsurface modules. Nested time stepping allows smaller steps to be taken for typically faster and explicitly solved surface runoff routing, while a mesh coarsening option allows larger grid elements to be used for typically slower and more compute-intensive subsurface flow. Sequential data assimilation schemes allow the model predictions to be updated with spatiotemporal observation data of surface and subsurface variables. These approaches are discussed in detail, and the physical and numerical behavior of the model is illustrated over catchment scales ranging from 0.0027 to 356 km(2), addressing different hydrological processes and highlighting the importance of describing coupled surface-subsurface flow.

关键词： surface-groundwater interactions path-based routing boundary condition-based coupling

来源：评论

学校读者我要写书评

暂无评论

Trade-Offs between Latency, Complexity, and Load Balancing with Multicast Algorithms

引用

IEEE TRANSACTIONS ON COMPUTERS 2010年第2期59卷 159-173页

作者： Al-Dubai, Ahmed Y. Ould-Khaoua, Mohamed Mackenzie, Lewis M. Edinburgh Napier Univ Sch Comp Edinburgh EH10 5DT Midlothian Scotland Sultan Qaboos Univ Dept Elect & Comp Engn Coll Engn Muscat Oman Univ Glasgow Dept Comp Sci Glasgow G12 8QQ Lanark Scotland

The increasing number of collective communication-based services with a mass interest and the parallel increasing demand for service quality are paving the way toward end-to-end QoS guarantees. Although many multicast algorithms in interconnection networks have been widely reported in the literature, most of them handle the multicast communication within limited performance metrics, i.e., either delay/latency or throughput. In contrast, this study investigates the multicast communication within a group of QoS constrains, namely latency, jitter, throughput, and additional traffic caused. In this paper, we present the Qualified Groups (QGs) as a novel path-based multicast algorithm for interconnection networks. To the best of our knowledge, the QG is the first multicast algorithm that considers the multicast latency at both the network and node levels across different traffic scenarios in interconnection networks. Our analysis shows that the proposed multicast algorithm exhibits superior performance characteristics over other well-known path-based multicast algorithms under different operating conditions. In addition, our results show that the QG can significantly improve the parallelism of the multicast communication.

关键词： Interconnection networks multicast communication path-based routing communication algorithms

来源：评论

学校读者我要写书评

暂无评论

A dual-hamiltonian-path-based multicasting strategy for wormhole-routed star graph interconnection networks

引用

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 2002年第12期62卷 1747-1762页

作者： Wang, NC Chu, CP Chen, TS Natl Cheng Kung Univ Dept Comp Sci & Informat Engn Tainan 701 Taiwan Chaoyang Univ Technol Dept Informat & Commun Engn Taichung 413 Taiwan Chang Jung Univ Dept Informat Management Tainan 711 Taiwan

Multicast is an important collective communication operation on multicomputer systems, in which the same message is delivered from a source node to an arbitrary number of destination nodes. The star graph interconnection network has been recognized as an attractive alternative to the popular hypercube network. In this paper, we first address a dual-hamiltonian-path-based routing model with two virtual channels based on two hamiltonian paths (HPs) and a network partitioning strategy for wormhole-routed star graph networks. Then, we propose three efficient multicast routing schemes on basis of such a model. All of the three proposed schemes are proved deadlock-free. The first scheme, network-selection-based dual path routing, selects subnetworks that are constructed either by the first HP or by the second HP for dualpath routing. The second one, optimum dual-path routing, selects subnetworks with optimum routing path for dual-path routing. The third scheme, two phase optimum dual path routing, includes two phases, source-to-relay and relay-to-destination. Finally, experimental results are given to show that our proposed three routing schemes outperform the unicast-based, the HP, and the single-HP-based dual-path routing schemes significantly. (C) 2002 Elsevier Science (USA). All rights reserved.

关键词： multicast path-based routing star graphs virtual channels wormhole routing

来源：评论

学校读者我要写书评

暂无评论

A new adaptive hardware tree-based multicast routing in k-ary n-cubes

引用

IEEE TRANSACTIONS ON COMPUTERS 2001年第7期50卷 647-659页

作者： Kumar, DR Najjar, WA Srimani, PK Univ Colorado Dept Comp Sci & Engn Denver CO 80217 USA Univ Calif Riverside Dept Comp Sci & Engn Riverside CA 92521 USA Clemson Univ Dept Comp Sci Clemson SC 29634 USA

Multicast communication is a key issue in almost all applications that run on any parallel architecture and, hence, efficient implementation of of multicast is critical to the performance of multiprocessor machines. Multicast is implemented in parallel architectures either via software or via hardware. Software-based approaches for implementing multicast can result in high message latencies, while hardware-based schemes can greatly improve performance. Deadlock freedom in multicast communication is much more difficult to achieve resulting in more involved routing algorithms and higher startup delays. Hardware tree-based algorithms do not require these high startup delays, but do suffer from high probabilities of message blocking leading to poor performance. In this paper, we propose a new hardware tree-based routing algorithm (HTA) for multicast communication under virtual cut-through switching in k-ary n-cubes that outperforms existing software and hardware path-based multicast routing schemes. Simulation results are compared against several commonly used multicast routing algorithms and show that HTA performs extremely well under many different conditions.

关键词： multicast communication path-based routing tree-based routing deterministic routing adaptive routing virtual cut-through switching

来源：评论

学校读者我要写书评

暂无评论

Multidestination Multicast Communication based on Hierarchical Block Rings 14

Multidestination Multicast Communication Based on Hierarchic...

引用

14th International Conference on Parallel and Distributed Computing Systems, PDCS 2001

作者： Huang, Jyh-Ming Yang, Ted C. Department of Information Engineering Feng Chia University Taichung Taiwan

ISBN: (纸本)9781618395740

Multidestination multicast, in which a source node can deliver the same message to multiple destinations with a single start-up and thus considerably reduce the communication latency, is a promising scheme in current computer communication. based on a previous model [2], this paper presents a new hierarchical block ring organization (nHBO) multicast scheme. By exploiting a higher degree of parallelism and following the logarithmic characteristics of hierarchical structure, the multicast operations can be concurrently dispersed, and thus a better communication performance can be achieved. To verify the nHBO scheme, thorough comparisons are performed and simulation results demonstrate that it has a smaller number of start-up times than the HL scheme and the multipath scheme, and that it performs superior in terms of communication latency. In addition, the new scheme can perform almost equally well as the dual-path scheme for systems with low start-ups. Furthermore, for systems with a large number of destination nodes, the nHBO scheme appears to be the best choice for multicasting. © (2001) by the International Society for Computers and Their Applications All rights reserved.

关键词： block ring collective communication multicast Multidestination worm path-based routing

来源：评论

学校读者我要写书评

暂无评论

Multiple multicast with minimized node contention on wormhole k-ary n-cube networks

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 1999年第4期10卷 371-393页

作者： Kesavan, R Panda, DK Compaq Inc Cupertino CA 95014 USA Ohio State Univ Dept Comp & Informat Sci Columbus OH 43210 USA

This paper presents a new approach to minimize node contention while performing multiple multicast/broadcast on wormhole k-ary n-cube networks with overlapped destination sets. The existing multicast algorithms in the literature deliver poor performance under multiple multicast because these algorithms have been designed with only single multicast in mind. The new algorithms introduced in this paper do not use any global knowledge about the respective destination sets of the concurrent multicasts. Instead, only local information and a source-specific partitioning approach are used. For systems supporting unicast message-passing, a new SPUmesh (Source-Partitioned Umesh) algorithm is proposed and is shown to be superior than the conventional Umesh algorithm [2] for multiple multicast. Two different algorithms, SQHL (Source-Quadrant Hierarchical Leader) and SCHL (Source-Centered Hierarchical Leader), are proposed for systems with multidestination message-passing and shown to be superior than the HL scheme [3]. All of these algorithms perform 1) 5-10 times faster than the existing algorithms under multiple multicast and 2) as fast as existing algorithms under single multicast. Furthermore, the SCHL scheme demonstrates that the latency of multiple multicast can, in fact, be reduced as the degree of multicast increases beyond a certain number. Thus, these algorithms demonstrate significant potential to be used for designing fast and scalable collective communication libraries on current and future generation wormhole systems.

关键词： collective communication multicast broadcast wormhole routing meshes k-ary n-cube unicast and multidestination message passing path-based routing

来源：评论

学校读者我要写书评

暂无评论

A trip-based multicasting model in wormhole-routed networks with virtual channels

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 1996年第2期7卷 138-150页

作者： Tseng, YC Panda, DK Lai, TH CHUNG HUA POLYTECH INST DEPT COMP SCI HSINCHU 30067 TAIWAN

This paper focuses on efficient multicasting in wormhole-routed networks. A trip-based model is proposed to support adaptive, distributed, and deadlock-free multiple multicast on any network with arbitrary topology using at most two virtual channels per physical channel. This model significantly generalizes the path-based model proposed earlier [21], [22], which works only for Hamiltonian networks and cannot be applicable to networks with arbitrary topology resulted due to system faults. Fundamentals of the trip-based model, including the necessary and sufficient condition to be deadlock-free, and the use of appropriate number of virtual channels to avoid deadlock are investigated. The potential of this model is illustrated by applying it to hypercubes with faulty nodes. Simulation results indicate that the proposed model can implement multiple multicast on faulty hypercubes with negligible performance degradation.

关键词： routing algorithm interprocessor communication multicast virtual channel wormhole-routing path-based routing collective communication fault tolerance

来源：评论

学校读者我要写书评

暂无评论

FAST BARRIER SYNCHRONIZATION IN WORMHOLE K-ARY N-CUBE NETWORKS WITH MULTIDESTINATION WORMS

引用

FUTURE GENERATION COMPUTER SYSTEMS 1995年第6期11卷 585-602页

作者： PANDA, DK Dept. of Computer and Information Science The Ohio State University Columbus OH 43210-1277 USA

This paper presents a new approach to implement fast barrier synchronization in wormhole k-ary n-cubes. The novelty lies in using multidestination messages instead of the traditional single destination messages. Two different multidestination worm types, gather and broadcasting, are introduced to implement the report and wake-up phases of barrier synchronization, respectively. Algorithms for complete and arbitrary set barrier synchronization are presented using these new worms. It is shown that complete barrier synchronization in a k-ary n-cube system with e-cube routing can be implemented with 2n communication start-ups as compared to 2nlog(2)k start-ups needed with unicast-based message passing. This leads to an asymptotic improvement by a factor of log(2)k. Simulation results for different system and architectural parameters indicate that the new framework can reduce barrier synchronization cost considerably compared to the unicast-based scheme. For arbitrary set barrier, an interesting trend is observed where the synchronization cost keeps on reducing beyond a certain number of participating nodes. The framework demonstrates potential for supporting fast barrier synchronization in large wormhole-routed systems.

关键词： BARRIER SYNCHRONIZATION COLLECTIVE COMMUNICATION WORMHOLE routing VIRTUAL CUT-THROUGH BROADCASTING, MULTICASTING, MESHES, K-ARY N-CUBES path-based routing

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：