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

A new power efficient high performance interconnection network for many-core processors

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 2017年 101卷 92-102页

作者： Al Faisal, Faiz Rahman, M. M. Hafizur Inoguchi, Yasushi JAIST Sch Informat Sci Nomi Ishikawa 9231211 Japan IIUM KICT Dept Comp Sci Kuala Lumpur Malaysia JAIST Res Ctr Adv Comp Infrastruct Nomi Ishikawa Japan

Next generation high performance computing will most likely depend on the massively parallel computers. The overall performance of a massively parallel computer system is heavily affected by the interconnection network and its processing nodes. Continuing advances in VLSI technologies promise to deliver more power to individual nodes. However, the on-chip interconnection networks consume up to 50% of the total chip power and off-chip bandwidth is limited to the maximum number of possible out going physical links. In addition, the long wiring and low performance of communication network overwhelm the benefit of parallel computer system whereas it increases total cost. In this paper, we propose a new interconnection network that reduces the problems of high power consumption, long wiring length and low bandwidth issues. We have measured the static network performance and required power consumption of our proposed '3D-TESH' interconnection network and compared the performance with other networks at different levels of hierarchy such as inter-chips, inter-nodes and inter-cabinets. 3D-TESH network has achieved about 52.08% better diameter and about 45.71% better average distance than the 3D-Torus network with 12.61% less router power usage at on-chip level. Furthermore, 3D-TESH requires about 41% less router power usage than 5D Torus at the on-chip level. (C) 2016 Elsevier Inc. All rights reserved.

关键词： Interconnection network 3D-TESH network routing algorithm Static network performance Power estimation

来源：评论

学校读者我要写书评

暂无评论

A modified cluster-head selection algorithm in wireless sensor networks based on LEACH

引用

EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING 2018年第1期2018卷 1页

作者： Zhao, Liang Qu, Shaocheng Yi, Yufan Cent China Normal Univ Dept Elect & Informat Engn Wuhan 430079 Hubei Peoples R China

In order to overcome drawbacks of unreasonable cluster-head selection and excessive energy consumption in wireless sensor networks (WSNs), a modified cluster-head selection algorithm based on LEACH (LEACH-M) was proposed. Based on distributed address assignment mechanism (DAAM) of ZigBee, both residual energy and network address of nodes were taken into account to optimize cluster-head threshold equation. Furthermore, by leveraging a cluster-head competitive mechanism, LEACH-M successfully balanced the network energy burden and dramatically improved energy efficiency. The simulation results in NS-2.35 show that the proposed algorithm can prolong the network lifetime, minimize the energy consumption, and increase the amount of data received at base station whether region is in a 100x100m(2)or in a 300x300m(2).

关键词： Wireless sensor networks (WSNs) routing algorithm Cluster-head selection LEACH NS-2.35

来源：评论

学校读者我要写书评

暂无评论

Kalman Predictor-Based Proactive Dynamic Thermal Management for 3-D NoC Systems With Noisy Thermal Sensors

引用

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 2017年第11期36卷 1869-1882页

作者： Fu, Yuxiang Li, Li Wang, Kun Zhang, Chuan Nanjing Univ Sch Elect Sci & Engn Nanjing 210023 Jiangsu Peoples R China Southeast Univ Natl Mobile Commun Res Lab Nanjing 210096 Jiangsu Peoples R China

Thermal sensor noise has a great impact on the efficiency and effectiveness of a dynamic thermal management (DTM) strategy. To address the problem of forecasting temperature based on noisy thermal sensors, we first propose a Kalman-based runtime thermal prediction scheme. To obtain accurate temperature predictions, a multivariate linear power model and a physically-based state space thermal model for 3-D network-on-chip are also proposed. Simulation results show that it reduces the standard deviations of the prediction error by 46%-53% compared with the auto-regressive based one under sensor noise with sigma = 2. Conventional reactive DTM techniques suffer from significant performance degradation due to their pessimistic reaction, thus, based on the proposed prediction scheme, we further propose a proactive DTM strategy that primarily consists of a thermal-aware routing algorithm and a proactive throttling scheme: 1) to take into account both thermal and congestion issues, we propose a proactive congestion and thermal aware routing algorithm. Simulation results demonstrate that it can achieve better throughput as well as approach better thermal balance. Specifically, under uniform traffic, the proposed scheme reduces the maximum chip temperature by about 3.9 degrees C and achieves 78.3% higher throughput compared with the competing thermal optimization approach based on dynamic programming network and 2) when the temperature exceeds the threshold, existing coarse-grained reactive throttling schemes cool down the overheated nodes at the penalty of significant performance loss. In this paper, a proactive quota-based throttling scheme is proposed. Simulation results show that it improves the throughput up to 11.1% compared with the reactive throttling schemes.

关键词： 3-D network-on-chip (NoC) dynamic thermal management (DTM) Kalman predictor routing algorithm traffic throttling

来源：评论

学校读者我要写书评

暂无评论

Joint flow and virtual machine placement in hybrid cloud data centers

引用

JOURNAL OF NETWORK AND COMPUTER APPLICATIONS 2017年 85卷 4-13页

作者： Roh, Heejun Jung, Cheoulhoon Kim, Kyunghwi Pack, Sangheon Lee, Wonjun Korea Univ Network Res Lab Seoul 02841 South Korea Korea Univ Mobile Network & Commun Lab Seoul 02841 South Korea

With the advance of virtualization technology, the current generation of cloud data centers contains diverse applications which generate massive inter-rack traffic in a distributed and unpredicted manner. However, since existing network architectures are not suitable to supply enough network capacity, there have been several research trials to improve the network capacity with augmented wireless links. Especially, architectural design and link scheduling of wireless-cum-wired hybrid data center networks are of their main interests. However, the existing approaches for hybrid data center networks with direct wireless links have limited performance improvements, since virtual machines are typically placed with less consideration of traffic locality. To this end, in this paper, we conduct a novel approach to flow and virtual machine placement problems in hybrid data center networks. We first design a threshold-based, wireless link-aware flow placement algorithm with low complexity. To enhance traffic locality, we also suggest a set of virtual machine placement algorithms under the flow placement algorithm. To fully exploit the extra capacity of the wireless links, we propose a new clustering metric for the algorithms. Extensive simulation results in hybrid data center networks with 60 gigahertz wireless links shows that combination of the proposed algorithms achieves better performance compared to baseline algorithms in flow completion time, aggregate throughput, and computational complexity.

关键词： Data center routing algorithm Virtual machine placement Hybrid data center networks

来源：评论

学校读者我要写书评

暂无评论

HyCube: A distributed hash table based on a variable metric

引用

PEER-TO-PEER NETWORKING AND APPLICATIONS 2017年第4期10卷 954-982页

作者： Olszak, Artur Warsaw Univ Technol Inst Comp Sci Warsaw Poland

Distributed Hash Tables (DHT) proved to be scalable decentralized systems providing efficient resource location. This paper concentrates on efficiency and resilience to node failures of DHT systems and presents a novel model of a distributed hash table based on a hierarchical hypercube geometry, called HyCube. The DHT geometry, the choice of the metric defining logical distances between nodes, and the routing algorithm have fundamental influence on routing efficiency and resilience. The use of the one-dimensional model (placing the nodes logically on a ring) allows the nodes to maintain sets of references called sequential neighbors - certain numbers of neighbors that are the closest existing nodes in both directions on the ring. Such a model yields a very high level of resilience to node failures. The new approach, presented in the paper, employs a variable multi-dimensional metric adopting the Steinhaus transform. routing, lookup and search algorithms are discussed, as well as routing table nodes selection and self-organization techniques. It is shown that the new approach allows reaching a higher level of resilience to node failures, as well as a shorter average routing path length than with the use of the sequential neighbors sets.

关键词： Distributed hash table routing algorithm Lookup algorithm Search algorithm Failure resilience

来源：评论

学校读者我要写书评

暂无评论

Dynamic routing algorithm Based on Mobile Agent

引用

Procedia Engineering 2012年 29卷 3636-3640页

作者： Li Lan College of Computer and Information Engineering Harbin University of Commerce Harbin China

routing is briefly explained in this paper, as well as the mechanism and the shortcomings of current dynamic routing are analyzed. After briefly introducing the advantages of mobile agent, the paper focuses on applying the new Mobile Agent technology to routing algorithm and proposes an innovative dynamic routing algorithm based on MA.

关键词： Dynamic routing Mobile Agent routing algorithm

来源：评论

学校读者我要写书评

暂无评论

A QoS routing algorithm Based on Ant Colony Optimization and Mobile Agent

引用

Procedia Engineering 2012年 29卷 1208-1212页

作者： CAO Huaihu School of Information of the Central University Finance and Economics Beijing China 100081

The current Internet can only provide “best effort” transport service, so it is becoming a very urgent task how to provide QoS guarantees for growing video on demand, multimedia conferencing and other multimedia applications based on the existing network architecture. This paper proposes a QoS routing algorithm based on mobile agent and ant colony (QR2A). The QR2A algorithm combines various constraints and network load conditions with the ant colony algorithm in the pheromone, while not only meets the QoS requirements, and solve the problem of network load balancing effectively, and the algorithm is less cost. Meanwhile, the paper also gives formal description, correctness and convergence analysis of QR2A algorithm. Finally practical effect of the algorithm is verified through by the simulation experiment.

关键词： QoS routing algorithm Ant Colony Optimization,Agent

来源：评论

学校读者我要写书评

暂无评论

A New Method of Designing NoC routing algorithm

A New Method of Designing NoC Routing Algorithm

引用

International Conference on Consumer Electronics, Communications and Networks

作者： Minghua Tang Chunhui Wu Department of Computer Science and Technology GuangDong University of Finance

ISBN: (纸本)9781457714146

Consumer electronics products contain complex System-on-Chip (SOC) which needs efficient communication interconnects. Network-on-Chip (NoC) is a scalable solution for the communication requirement of SoC. Devising an effective routing algorithm for NoC is a great challenge. In this paper, we present a methodology of designing routing algorithms based on divide-conquer approach. In total, 266 effective routing algorithms which have better performance than Odd-Even are obtained. Simulation results show that the new routing can decrease the average packet latency up to 54.5% over than Odd-Even.

关键词： Network-on-Chip routing algorithm Divide-Conquer Odd-Even

来源：评论

学校读者我要写书评

暂无评论

A New Approach to Fault-Tolerant routing algorithm on SLmesh

A New Approach to Fault-Tolerant Routing Algorithm on SLmesh

引用

2012 IEEE 14th International Conference on Communication Technology

作者： Xiongqing Zhong Peilei Bao Huaxi Gu Na Zhang Ke Chen State Key Lab of ISN Xidian University

ISBN: (纸本)9781467321006

With the increasing scale of integrated circuits,fault appears more than ever in the ***’s significant to apply fault-tolerant routing *** this paper,we proposed an algorithm based on spare links mesh which will fully utilizes the idle ports while keeping the router size *** a faulty router is detected,its neighboring routers change the links of their idle ports to route the packets around the faulty *** a result,XY routing algorithm in mesh can work even a faulty router exist in the ***,the algorithm can provide partially-adaptive routing in some neighboring routers around the faulty ***,these neighboring routers won’t be easily congested and it may reduce the latency by decreasing some hops of the *** experimental results show that this algorithm is feasible and the performance of delay and throughput of the network is improved.

关键词： fault-tolerant routing algorithm reconfiguration performance NoC

来源：评论

学校读者我要写书评

暂无评论

A Learning-Based Thermal-Sensitive Power Optimization Approach for Optical NoCs

引用

ACM JOURNAL ON EMERGING TECHNOLOGIES IN COMPUTING SYSTEMS 2018年第2期14卷 21-21页

作者： Zhang, Zhe Ye, Yaoyao Shanghai Jiao Tong Univ Sch Elect Informat & Elect Engn Dept Micronano Elect Shanghai 200240 Peoples R China

Optical networks-on-chip (NoCs) based on silicon photonics have been proposed as emerging on-chip communication architectures for chip multiprocessors with large core counts. However, due to the thermal sensitivity of optical devices used in optical NoCs, on-chip temperature variations cause significant thermal-induced optical power loss, which would counteract the power advantages of optical NoCs. To tackle this problem, in this work, we propose a learning-based thermal-sensitive power optimization approach for mesh or torus-based optical NoCs in the presence of temperature variations. The key techniques proposed include an initial device-setting and thermal-tuning mechanism that is a device-level optimization technique, and a learning-based thermal-sensitive adaptive routing algorithm that is a network-level optimization technique. Simulation results of an 8x8 mesh-based optical NoC show that the proposed initial device-setting and thermal-tuning mechanism confines theworst-case thermal-induced optical energy consumption to be on the order of tens of pJ/bit, by avoiding significant thermal-induced optical power loss caused by temperature-dependent wavelength shifts. Besides, it shows that the learning-based thermal-sensitive adaptive routing algorithm is able to find an optimal path with the minimum estimated thermal-induced optical power consumption for each communication pair. The proposed routing has a greater space for optimization, especially for applications with more long-distance traffic.

关键词： Optical network-on-chip thermal sensitivity routing algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：