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

10th IEEE/ACM International Symposium on Networks-on-Chip (NOCS)

作者： Niazmand, Behrad Azad, Siavoosh Payandeh Flich, Jose Raik, Jaan Jervan, Gert Hollstein, Thomas Tallinn Univ Technol Dept Comp Engn Tallinn Estonia Univ Politecn Valencia Dept Comp Engn Valencia Spain Frankfurt Univ Appl Sci Informat & Ingn Wissensch Frankfurt Germany

ISBN: (纸本)9781467390309

The susceptibility of on-chip communication links and on-chip routers to faults has guided the research towards focusing on fault-tolerance aspects of 2D and 3D Network-on-Chips (NoCs). In this paper, we propose Logic-Based Distributed routing for 3D NoCs (LBDR3D), a scalable, re-configurable and fault-tolerant mechanism, which utilizes only two virtual channels for implementing any deadlock-free turn model routing algorithm in partially vertically connected 3D NoCs. Such networks might emerge either due to the limitation of on-chip area for vertical links or due to occurrence of fault because of wear-out. LBDR3D guarantees live-lock freeness as well as connectivity regardless of the location and number of vertical links as long as faults do not disconnect the network. Our method relies on a limited set of bits which describe the topology and routing algorithm, updated using an offline algorithm. Our Experimental results show the comparison of LBDR3D with three previously proposed fault-tolerant mechanisms, Elevator-First, North-East To Z (NETZ) and East-Then-West (ETW). Compared to Elevator-First, our proposed mechanism is more flexible and in terms of packet latency, it performs better or equal under even extreme fault scenarios for vertical links. Furthermore, as long as the topology is supported by the routing algorithm, LBDR3D can tolerate faults on horizontal links in each layer. In contrast to NETZ and ETW, LBDR3D does not rely on the location of vertical links as long as the network is connected.

关键词： fault-tolerance routing algorithm reconfigurability reliability Network-on-Chip

来源：评论

学校读者我要写书评

暂无评论

Power-Efficient Partially-Adaptive routing in On-chip Mesh Networks 13

Power-Efficient Partially-Adaptive Routing in On-chip Mesh N...

引用

International SoC Design Conference (ISOCC)

作者： Jalili, M. Bourgeois, J. Sarbazi-Azad, H. Inst Res Fundamental Sci IPM Tehran Iran UFC FEMTO ST Inst FC Paris France

ISBN: (纸本)9781509032198

The mesh network-on-chip (MNoC) is the most popular inter-processor communication infrastructures used in modern on-chip systems. Although many routing algorithms have been developed for MNoCs but almost all of them give better performance in cost of more complexity (more virtual channels) and hence extra power consumption. In this paper, we propose a partially adaptive routing algorithm for meshes that requires no virtual channels to ensure deadlock freedom. Simulation experiments show that the proposed method provides good performance while using less power consumption.

关键词： Mesh Network-on-chip (NoC) routing algorithm Performance Power consumption Simulation

来源：评论

学校读者我要写书评

暂无评论

Joint routing and Bitrate Adjustment for DASH Video via Neuro-Dynamic Programming in SDN 1

引用

23rd International Conference on Neural Information Processing (ICONIP)

作者： Zhu, Kunjie Jiang, Junchao Yang, Bowen Cai, Weizhe Yang, Jian Univ Sci & Technol China Hefei Peoples R China

ISBN: (数字)9783319466873

ISBN: (纸本)9783319466873;9783319466866

This paper considers the joint routing and bitrate adjustment optimization for DASH (Dynamic Adaptive Streaming over HTTP) video service using neuro-dynamic programming (NDP) in software-defined networking (SDN). We design an open optimization architecture based on OpenFlow based SDN. Following this architecture, we formulate the joint routing and bitrate adjustment problem as a Markov Decision Process (MDP) for maximizing the average reward. In order to solve the curses of dimensionality, we employ neuro-dynamic programming method to conceive an online learning framework and develop a NDP based joint routing and bitrate adjustment algorithm for DASH video service. At last, an emulation platform based on POX and Mininet is constructed to verify the performance of the proposed algorithm. The experimental results indicate our algorithm has more excellent performance compared with OSPF based algorithm.

关键词： DASH Neuro-dynamic programming Bitrate adjustment routing algorithm Software-defined networking

来源：评论

学校读者我要写书评

暂无评论

A Novel Heuristic routing algorithm for Peer-to -Peer Network

A Novel Heuristic Routing Algorithm for Peer-to -Peer Networ...

引用

International Conference on Smart Materials and Intelligent Systems

作者： Ren Yanhua Shenyang Ligong Univ Sch Econ & Management Shenyang Peoples R China

ISBN: (纸本)9780878492237

To improve the efficiency and effectiveness traditional algorithm which still has some shortcomings, this paper combines with the advantages of genetic algorithm, brings forward a routing algorithm based on novel heuristic genetic algorithm (NHGA). The simulation results show that this algorithm overcomes the shortcomings of genetic algorithm. From the analysis and experiment result, it is concluded that NHGA was exploited to achieve the goal of improving the routing performance, and is superior to genetic algorithm simultaneously.

关键词： Peer-to-Peer routing algorithm genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

Local Congestion Avoidance in Network-on-Chip

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2016年第7期27卷 2062-2073页

作者： Tang, Minghua Lin, Xiaola Palesi, Maurizio GuangDong Univ Finance Dept Comp Sci & Technol Guangzhou 510521 Guangdong Peoples R China Sun Yat Sen Univ Sch Informat Sci & Technol Guangzhou 510275 Guangdong Peoples R China Sun Yat Sen Univ Minist Educ Key Lab Digital Life Guangzhou 510275 Guangdong Peoples R China Kore Univ Kore Italy

Network-on-Chip (NoC) has been made the communication infrastructure for many-core architecture. NoC are subject to congestion, which is claimed to be avoided by many researchers. However, there is no completely understanding of congestion in literature, which hinders its solution. Toward this direction, we firstly carry out study on congestion in this paper. We find that congestion usually occurs at a portion of nodes in a local network region. Moreover, local congestion will significantly decrease system performance and mostly impact some particular communication pairs. Then we attempt to solve local congestion by addressing different local region size, based on Divide-Conquer approach and routing pressure. It avoids congestion in every local region by keeping routing pressure of every local region minimum. Using different local region size will create different routings. Our study shows that the local region size is closely related with the routing performance. When local region size is 5 x 5 the optimal routing performance of large size network could be achieved.

关键词： Network-on-chip routing algorithm divide-conquer routing pressure local congestion

来源：评论

学校读者我要写书评

暂无评论

A Highly Scalable Optical Network-on-Chip With Small Network Diameter and Deadlock Freedom

引用

IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS 2016年第12期24卷 3424-3436页

作者： Wang, Xiaolu Gu, Huaxi Yang, Yintang Wang, Kun Hao, Qinfen Xidian Univ State Key Lab Integrated Serv Networks Xian 710126 Peoples R China Xidian Univ Inst Microelect Xian 710126 Peoples R China Xidian Univ Sch Comp Sci Xian 710126 Peoples R China Huawei Technol Co Ltd Beijing 518129 Peoples R China

To increase the performance of chip multiprocessors, optical network-on-chip (ONoC) becomes promising because of its high bandwidth and low energy consumption. In this paper, we propose an architecture called RPNoC (Ring-based Packet-switched NoC), which uses few optical devices. Specifically, Single-waveguide RPNoC employs only one waveguide. Multiwaveguide RPNoC introduces space division multiplexing to make the architecture highly scalable. A novel wavelength assignment method and a deadlock-free deterministic routing algorithm are jointly designed, which make the network diameter quite small. This design also guarantees deadlock freedom, a little resource use, and low complexity at the same time. Evaluation is carried out for the 64-node RPNoC under different synthetic and realistic traffic patterns. The simulation result shows that it yields high throughput and low latency. Comparison with other packet-switched ONoCs shows that RPNoC has the lowest energy consumption.

关键词： Multiplexing optical network-on-chip (ONoC) packet switching routing algorithm

来源：评论

学校读者我要写书评

暂无评论

Efficient Distributed Query Processing

引用

IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING 2016年第3期13卷 1230-1246页

作者： Kolcun, Roman Boyle, David E. McCann, Julie A. Imperial Coll London Dept Elect & Elect Engn London SW7 2AZ England Imperial Coll London Dept Comp London SW7 2AZ England

A variety of wireless networks, including applications of Wireless Sensor Networks, Internet of Things, and Cyber-physical Systems, increasingly pervade our homes, retail, transportation systems, and manufacturing processes. Traditional approaches communicate data from all sensors to a central system, and users (humans or machines) query this central point for results, typically via the web. As the number of deployed sensors, and thus generated data streams, is increasing exponentially, this traditional approach may no longer be sustainable or desirable in some application contexts. Therefore, new approaches are required to allow users to directly interact with the network, for example, requesting data directly from sensor nodes. This is difficult, as it requires every node to be capable of point-to-point routing, in addition to identifying a subset of nodes that can fulfil a user's query. This paper presents DRAGON, a platform that allows any node in the network to identify all nodes that satisfy user queries, i.e., request data from nodes, and relay the result to the user. The DRAGON platform achieves this in a fully distributed way. No central orchestration is required, network overheads are low, and latency is improved over existing comparable methods. DRAGON is evaluated on networks of various topologies and different network densities. It is compared with the state-of-the-art algorithms based on summary trees, like Innet and SENS-Join. DRAGON is shown to outperform these approaches up to 88% in terms of network traffic required, also a proxy for energy efficiency, and 84% in terms of processing delay. Note to Practitioners-This work is motivated by the continuing deluge of constrained, wirelessly connected sensing and control devices. Networks of communicable sensors and actuators are finding increased applicability across a range of industries and application scenarios. They are often thought of as a subset of the '"nternet of Things." However, due to the inh

关键词： Autonomous and automated sensing and control systems cyber-physical systems distributed query processing distributed storage routing algorithm wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Simulation of Wireless Sensor Networks Based on Directed Diffusion algorithm

引用

INTERNATIONAL JOURNAL OF ONLINE ENGINEERING 2017年第10期13卷 73-85页

作者： Tong, Yu Hubei Normal Univ Huangshi Hubei Peoples R China

In order to reduce the energy consumption and data congestion caused by flooding at the initial stage of the network, the cluster head and the boundary node are used as the key nodes to reduce the data flow in the network, so that the network has better delay performance. Various clustering algorithms in wireless sensor networks and the improved method of clustering protocols are introduced. On the basis of directed diffusion algorithm, a directed diffusion protocol based on CONID clustering is studied. Through the OMNeT++ basic platform, the wireless sensor network simulation platform is built on the basis of the MiXiM module. The platform uses a hierarchical structure, and its network layer implements a directed diffusion protocol based on CONID clustering. The application layer implements the two step WLS localization algorithm. The MAC layer uses the FIexiTP protocol. The physical layer uses the simplest flat path fading model. Because the sensor has both perception and data transmission characteristics, the dual channel communication model is adopted. The platform is suitable for wireless sensor network detection, localization and tracking algorithm simulation. Through the hierarchical function of the platform, it can analyze the practicability and effectiveness of the algorithm in more detail, and has certain value. It can also be used in the simulation of cross layer protocols, and can combine several parameters to perform joint analysis of system performance. Simulation results show that the CONID based directional diffusion protocol has better delay performance than the conventional directed diffusion protocol. Finally, the performance of the two step WLS location protocol is analyzed from several perspectives, which provides an example for the platform.

关键词： CONID clustering directed diffusion (DD) routing algorithm OMNeT++ MiXiM

来源：评论

学校读者我要写书评

暂无评论

A Deadlock-Free and Connectivity-Guaranteed Methodology for Achieving Fault-Tolerance in On-Chip Networks

引用

IEEE TRANSACTIONS ON COMPUTERS 2016年第2期65卷 353-366页

作者： Ren, Pengju Ren, Xiaowei Sane, Sudhanshu Kinsy, Michel A. Zheng, Nanning Xi An Jiao Tong Univ Dept Elect & Informat Engn Xian 710049 Shaanxi Peoples R China Univ Oregon Dept Comp & Informat Eugene OR 97403 USA

To improve the reliability of on-chip network based systems, we design a deadlock-free routing technique that is more resilient to component failures and guarantees a higher degree of node connectivity. The routing methodology consists of three key steps. First, we determine the maximal connected subgraph of the faulty network by checking whether the defective components happen to be the cut vertices and bridges of the network topology. A precise fault diagnosis mechanism is used to identify partial defective routers. Second, we construct an acyclic channel dependency graph that breaks all cycles and preserves connectivity of the maximal connected subgraph. This is done through the cycle-breaking and connectivity guaranteed (CBCG) algorithm. Finally, we introduce a fault-tolerant adaptive routing scheme that can be used with or without virtual channels for network congestion avoidance and high-throughput routing. The simulation results show both the effectiveness and robustness of the proposed approach. For an 8 x 8 2D-Mesh with 40 percent of link damage, full connectivity and deadlock freedom are still archived without disabling any faultless router in 98.18 percent of the simulations. In a 2D-Torus, the simulation percentage is even higher (99.93 percent). The hardware overhead for supporting the introduced features is minimal. An on-line implementation of CBCG using TSMC 65nm library has only 0.966 and 1.139 percent area overhead for the 8 x 8 and 16 x 16 2D-Meshes.

关键词： Fault-tolerance Network-on-chip Channel Dependency Graph Reliability routing algorithm

来源：评论

学校读者我要写书评

暂无评论

The twisted crossed cube

引用

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2016年第5期28卷 1507-1526页

作者： Wang, Xinyang Liang, Jiarong Qi, Deyu Lin, Weiwei S China Univ Technol Comp Syst Res Inst Guangzhou 510006 Guangdong Peoples R China Guangxi Univ Sch Comp Elect & Informat Nanning 530004 Peoples R China

The topology of interconnection networks plays an important role in the performance of parallel and distributed computing systems. In this paper, we propose a new interconnection network called twisted crossed cube (TCQ(n)) and investigate its basic network properties in terms of the regularity, connectivity, fault tolerance, recursiveness, hamiltonicity and ability to simulate other architectures, and so on. Then, we develop an effective routing algorithm Route (u, v) for TCQ(n) that takes no more than d(u, v)+1 steps for any two nodes (u, v) to communicate with each other, and the routing process shows that the diameter, wide diameter, and fault-tolerant diameter of TCQ(n) are about half of the corresponding diameters of the equivalent hypercube with the same dimension. In the end, by combining TCQ(n) with crossed cube (CQ(n)), we propose a preferable dynamic network structure, that is, the dynamic crossed cube, which has the same network diameter as TCQ(n)/CQ(n) and better properties in other respects, for example, its connection complexity is half of that of TCQ(n)/CQ(n) when the network scale is large enough, and the number of its average routing steps is also much smaller than that in TCQ(n)/CQ(n). Copyright (c) 2015 John Wiley & Sons, Ltd.

关键词： twisted crossed cube crossed cube dynamic crossed cube routing algorithm embedding strategy network diameter

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：