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

A Runtime Optimization Approach for FPGA routing

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 2018年第8期37卷 1706-1710页

作者： Wang, Dekui Duan, Zhenhua Tian, Cong Huang, Bohu Zhang, Nan Xidian Univ ICTT Xian 710071 Shaanxi Peoples R China Xidian Univ ISN Lab Xian 710071 Shaanxi Peoples R China

In this paper, we present a new field-programmable gate array (FPGA) routing approach on the basis of the PathFinder routing algorithm. During each routing iteration, our approach applies a novel timing-based rerouting strategy to only reroute the illegal paths. At a lower level, each maze expansion is started from the relatively dose part of current routing tree to search for the target sink on the routing resource graph. Experimental results demonstrate that on average the proposed approach reduces the routing runtime by 68.5% compared with the timing-driven router in versatile place and route FPGA placement and routing framework, with reduction of 2.5% and 1.4% in critical path delay and wirelength, respectively.

关键词： Field-programmable gate array (FPGA) routing PathFinder rerouting strategy routing algorithm maze router

来源：评论

学校读者我要写书评

暂无评论

Insertion Loss-Aware routing Analysis and Optimization for a Fat-Tree-Based Optical Network-on-Chip

引用

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 2018年第3期37卷 559-572页

作者： Lee, Jae Hoon Kim, Min Soo Han, Tae Hee Sungkyunkwan Univ Coll Informat & Commun Engn Suwon 16419 South Korea

Fat-tree-based optical network-on-chip (FONoC) is an emerging architecture that enables next-generation computing platforms to achieve ultimate performance and energy efficiency. However, the architecture suffers from high insertion loss, which degrades energy efficiency and signal reliability severely. Focusing primarily on microring resonator (MR) drops, we analyze the relationship between the insertion loss caused by MR drops and the routing paths in the FONoCs. Our approach involves developing a simplified graph model named a drop-characterized fat-tree graph with vertex indexing. We propose three types of routing algorithms: 1) insertion loss-minimized deterministic routing;2) minimized loss path-prioritized adaptive routing;and 3) insertion loss-constrained adaptive routing. Furthermore, we present the associated optical router architectures and additional insertion loss optimization by minimizing the number of waveguide crossings. Based on our simulation results for the latency, throughput, energy efficiency, and MR activation power, we discuss the tradeoffs and suggest appropriate optimization techniques to be adopted according to the priorities of the design goals.

关键词： Fat-tree topology insertion loss optical network-on-chip (ONoC) optical router routing algorithm

来源：评论

学校读者我要写书评

暂无评论

Optimizing Color-Based Cooperative Caching in Telco-CDNs by Using Real Datasets 13th

Optimizing Color-Based Cooperative Caching in Telco-CDNs by ...

引用

13th International Conference on Ubiquitous Information Management and Communication (IMCOM)

作者： Anh-Tu Ngoc Tran Minh-Tri Nguyen Thanh-Dang Diep Nakajima, Takuma Nam Thoai Ho Chi Minh City Univ Technol VNUHCM High Performance Comp Lab Fac Comp Sci & Engn Ho Chi Minh City Vietnam Univ Electrocommun Grad Sch Informat Syst Chofu Tokyo Japan

ISBN: (纸本)9783030190637;9783030190620

Content Delivery Networks (CDNs) play a vital role in efficient content distribution inside the Internet to reduce network traffic and improve users' experience. Because CDNs are usually located outside Internet Service Providers (ISPs), they cannot decrease traffic inside ISPs and on peering links between ISPs and CDNs. Hence, there is a considerable need to deploy CDNs inside ISPs to tackle this issue. Additionally, these CDNs are called Telco-CDNs since we are in the control of ISPs. Traditional caching policies widely used in CDNs can be applied to Telco-CDNs. Nonetheless, the policies are inefficient in the context of Telco-CDNs in that network operators of CDNs have no knowledge of underlying network infrastructure while those of Telco-CDNs do. The fact leads to the emergence of caching algorithms in Telco-CDNs. Color-based caching strategy together with its routing algorithm is regarded as the most effective one with acceptable computation overhead. In principle, contents will be assigned to color tags and periodically re-colorized every interval in the approach. Since the previous study used a simulated dataset following gamma distribution, the characteristics of this dataset did not change every interval. For that reason, there was no experiment to verify the efficiency of the algorithm when the characteristics of the dataset varied. In this paper, we conduct numerous experiments to look the aspect over. The experimental results show that not only the color-based approach still remains prominently effective in comparison with Least Frequently Used (LFU) every interval, but also the strategy with periodical re-colorization outperforms the one without re-colorization. Moreover, the prior research only took account of users' interests in a global manner rather than geographically local regions, which is difficult to attain the optimizing traffic reduction. Thus, we also propose an iteration of the color-based caching strategy by making use of the insight of us

关键词： Co-operative caching Sub-optimal content placement Hybrid caching routing algorithm Dynamic content popularity

来源：评论

学校读者我要写书评

暂无评论

Reducing Dynamic Energy in Networks on Chip

Reducing Dynamic Energy in Networks on Chip

引用

International Congress of Innovation and Trends in Engineering (CONIITI)

作者： Salazar, Arley Villa Patino, Gustavo Univ Antioquia Dept Elect Engn Medellin Colombia

ISBN: (纸本)9781728147468

Networks on Chip (NoCs) have been recognized as a viable solution to solve the Systems on Chip (SoC) design challenges, providing a scalable and efficient communication structure in multicore systems. However, this solution is inefficient in terms of energy consumption. In order to minimize such consumption, it is essential to design an efficient routing algorithm that minimizes energy consumption while maximizing throughput. This paper proposes an energy aware routing algorithm (called EA-NoC) that optimizes the dynamic energy by determining the optimal route between source and destination, avoiding unnecessary energy consumption. The routing algorithms were simulated on a 2D-mesh topology, and compared to the State-of-the-Art routing algorithms implemented in the Noxim simulator. The experimental results show that the proposed algorithm outperforms existing algorithms in literature (28% better on average, in terms of dynamic power).

关键词： routing algorithm MPSoC Energy-Aware Reduction power Green Networking Network on Chip

来源：评论

学校读者我要写书评

暂无评论

Communication Latency Evaluation on a Software-Defined Network-on-Chip 9

Communication Latency Evaluation on a Software-Defined Netwo...

引用

9th Brazilian Symposium on Computing Systems Engineering (SBESC)

作者： Silva, Raul Silveira Cruz, Patricia Pontes Kreutz, Marcio Eduardo Pereira, Monica Magalhaes Univ Fed Rio Grande do Norte UFRN Dept Informat & Appl Math Natal RN Brazil

ISBN: (纸本)9781728163185

In conventional NoCs, it is common to implement the routing strategy inside the circuitry of the router. However, the problem with having only one possible route between source and destination is the lack of alternative paths in case of congestions. A more recent approach to cope with this problem consists in implementing the routing strategy in software in a dedicated core, the Software-Defined Networks-on-Chip (SDNoCs). The strategy relies on managing virtual circuits on demand. In the present work, we evaluate the communication latency of SDNoCs over deterministic and adaptive routing algorithms, varying network traffic. We implement routing algorithms based on graphs theory. The experimental results point that the adaptive algorithm is a better choice for low traffic scenarios, achieving up to 3.6x of speedup when compared with the deterministic approach. However, for intense traffics, both routing algorithms approaches produce similar results.

关键词： Network-on-Chip Software-Defined NoC routing algorithm latency

来源：评论

学校读者我要写书评

暂无评论

Control Singaling Scheme of Upstream Data Transmission for Power Internet of Things 11

Control Singaling Scheme of Upstream Data Transmission for P...

引用

IEEE 11th International Conference on Communication Software and Networks (ICCSN)

作者： Huo, Chao Zhang, Ganghong Zhou, Jie Beijing Smart Chip Microelect Technol Co Ltd Dept Terminal & Commun Beijing Peoples R China

ISBN: (纸本)9781728121840

In order to solve the problems of long copy time and low success rate in the application of high-speed power line communication and wireless dual-mode fusion network, this paper proposes a data transmission upstream signaling technology, introduces the idea of "connection-oriented", uses signaling scheme from the beginning to the end of data transmission, and establishes a "end-to-end" stable transmission path and routing for data upstream transmission. The parameters of bandwidth, time slot and signal power are set by each intermediate node through which the transmission path is interactively terminated by signaling after all data frames have completed the upstream transmission. Simulations and field tests show that the method can ensure the reliability of data upstream transmission in dual-mode network, improve the success rate of communication and reduce communication delay.

关键词： uplink signaling technology power line carrier and wireless dual-mode communication routing algorithm networking

来源：评论

学校读者我要写书评

暂无评论

Improving the throughput of transportation networks with a time-optimization routing strategy

引用

INTERNATIONAL JOURNAL OF GEOGRAPHICAL INFORMATION SCIENCE 2018年第9期32卷 1815-1836页

作者： Liu, Gang Long, Wen Wang, Jingchao Gao, Peichao He, Jing Luo, Zhiyong Li, Lian Li, Yongshu Chengdu Univ Technol Coll Earth Sci Dept Spatial Informat Technol Chengdu Sichuan Peoples R China Chengdu Univ Technol Minist Land & Resources Key Lab Geosci Spatial Informat Technol Chengdu Sichuan Peoples R China Chengdu Univ Technol Coll Tourism & Urban Rural Planning Dept Phys Geog Chengdu Sichuan Peoples R China Hong Kong Polytech Univ Dept Land Surveying & Geoinformat Kowloon Hong Kong Peoples R China Natl Adm Surveying Mapping & Geoinformat Topog Survey Team 6 Chengdu Sichuan Peoples R China Southwest Jiaotong Univ Fac Geosci & Environm Engn Chengdu Sichuan Peoples R China

Traffic congestion, a common and complicated phenomenon in urban transportation systems, is attracting increasing attention from researchers in Geographical Information Science (GIS) and other fields. In this study, we illustrate a general mechanism that reveals the relationship between travel time and dynamic traffic conditions. We measure a vehicle's travel time to its destination along any path, where the travel time is calculated based on the path length and on the real-time traffic volume and transport capacity of each road segment on the path. On the basis of this measurement, we present a simple dynamic routing strategy that allows each vehicle to dynamically choose the path to its destination while imposing the minimum travel time. The application of our routing algorithm to the Chengdu street network, Barabasi-Albert scale-free network and Erdos-Renyi random network shows that the proposed strategy remarkably improves network throughput and balances traffic load distribution. Our findings suggest that mining the time mechanism of network transport is important to explore efficient time-optimization routing algorithms to enhance the transport capacity of urban street networks and other kinds of networks.

关键词： Traffic flow routing algorithm travel time network throughput GIS

来源：评论

学校读者我要写书评

暂无评论

A SDN based approach to improve energy consumption in wireless ad hoc network 5

A SDN based approach to improve energy consumption in wirele...

引用

5th IEEE Annual International Smart Cities Conference (ISC2)

作者： Boulou, Mahamadi Yelemou, Tiguiane Kouraogo, Pegd-Winde Justin Rollande, Doda Afoussatou Ben Sta, Hatem Univ Nazi BONI Bobo Dioulasso Burkina Faso Univ Joseph Ki Zerbo Ouagadougou Burkina Faso Univ Tunis El Manar Tunis Tunisia

ISBN: (纸本)9781728108469

Ad-hoc wireless networks are increasingly being used in communications especially in surveillance situations in unfriendly environments. Energy management problem of these communicating autonomous nodes is a major handicap especially for countries with limited financial resources. Indeed, the lifespan of this type of network is that of a few nodes. In this article, we propose the use of Software-Defined Networking (SDN) technology to optimize energy consumption in these nodes. In our approach, establishment and maintenance of path is provided by a controller. Nodes focus on packet switching. This approach is implemented in the well known reactive routing protocol, Ad hoc On-demand Distance Vector (AODV). Analysis of performances of this new protocol, SDN based AODV (S-AODV), that we propose, shows that, comparing with the standard AODV, we significantly improve nodes energy consumption and thus the lifespan of these types of networks, routing load and path establishment delay.

关键词： Sofware-defined networking Wireless network routing algorithm Energy consumption

来源：评论

学校读者我要写书评

暂无评论

A Reliable and Efficient routing algorithm Assisted with Buffer Management in Opportunistic Networks

A Reliable and Efficient Routing Algorithm Assisted with Buf...

引用

International Conference on Instrumentation, Measurement, Computer, Communication and Control

作者： Yukun Yao Xi Chen Zhi Ren Zhihu Liu Chongqing Key Lab of Mobile Communications Technology Chongqing University of Posts and Telecommunications Chongqing China Chongqing Key Lab of Mobile Communications Technology Chongqing University of Posts and Telecommunications Chongqing China

ISBN: (纸本)9781479913930

Short contact time period between nodes as well as limited node buffers usually exist in opportunistic networks, resulting in the increase of delay and the loss of data packets. To address the problem, an improved epidemic routing algorithm(Reliable and Efficient routing algorithm assisted with Buffer Management, REBM) is proposed. Firstly, through the exchange of SV (Summary Vector) control packets, the data packets already reached the destination nodes are removed from the node buffers. Moreover, the data packets destined to the one-hop neighboring nodes obtain the priority to transmit. Theoretical analysis and extensive simulation results showed that the proposed algorithm can effectively increase the delivery rate, shorten the delivery delay, decrease the total number of transmitted data packets and cut down the buffer occupancy without increasing any control overhead.

关键词： opportunistic networks routing algorithm buffer management priority

来源：评论

学校读者我要写书评

暂无评论

REDUCING PROCESSOR-MEMORY PERFORMANCE GAP AND IMPROVING NETWORK-ON-CHIP THROUGHPUT

REDUCING PROCESSOR-MEMORY PERFORMANCE GAP AND IMPROVING NETW...

引用

作者： Naveed Ul Mustafa Bilkent University

学位级别：博士

Performance of computing systems has tremendously improved over last few decades primarily due to decreasing transistor size and increasing clock rate. Billions of transistors placed on a single chip and switching at high clock rate result in overheating of the chip. The demand for performance improvement without increasing the heat dissipation lead to the inception of multi/many core design where multiple cores and/or memories communicate through a network on chip. Unfortunately, performance of memory devices has not improved at the same rate as that of processors and hence become a performance bottleneck. On the other hand, varying traffic pattern in real applications limits the network throughput delivered by a routing algorithm. In this thesis, we address the issue of reducing processor-memory performance gap in two ways: First, by integrating improved and newly developed memory technologies in memory hierarchy of a computing system. Second, by equipping the execution platform with necessary architectural features and enabling its compiler to parallelize memory access instructions. We also address issue of improving network throughput by proposing a selection scheme that switches routing algorithm of an NoC with changing traffic pattern of an application. We present integration of emerging non-volatile memory (NVM) devices in memory hierarchy of a computing system in the context of database management systems (DBMS). To this end, we propose modifications in storage engine (SE) of a DBMS aiming at fast access to data through bypassing the slow disk interfaces while maintaining all the functionalities of a robust DBMS. As a case study, we modify the SE of PostgreSQL and detail the necessary changes and challenges such modifications entail. We evaluate our proposal using a comprehensive emulation platform. Results indicate that our modified SE reduces query execution time by up to 45% and 13% when compared to disk and NVM storage, with average reductions of 19% and

关键词： Memory bound stalls compiler optimization execution time computer vision non volatile memory relational DBMS storage engine network-on-chip routing algorithm throughput

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：