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

An improved reconfiguration algorithm for handling 1-point NoC failures

MICROPROCESSORS AND MICROSYSTEMS 2023年第1期101卷

作者： Jain, Anugrah Laxmi, Vijay Gaur, Manoj Singh Sharma, Ashish LNM Inst Informat Technol Jaipur 302031 India Malaviya Natl Inst Technol Jaipur Jaipur 302017 India Indian Inst Technol Jammu Jammu 181221 India Manipal Univ Jaipur Jaipur 303007 India

In today's world, the demands for high-performance computing necessitate faster on-chip communication. Current chips with a large number of on-chip elements need an efficient alternative such as network-on-chip (NoC) for on-chip communication. As technology down scales toward the deep sub-micron, process variability makes the transistors more unreliable. Hence, on-chip elements including NoC can suffer from permanent/transient failures. In an NoC, 1-link/1-router failure can disrupt overall connectivity. The paper presents an improved routing reconfiguration algorithm for handling all 1-point permanent failures in 2D mesh NoC. By 1-point failure, we mean a failure can be occurred on any network link/router. State-of-the -art approaches either require a large number of reconfiguration cycles or provide partial support for 1-point failures, i.e., cover only 1-link failures. Proposed approach performs partial reconfiguration of routing function implemented using logic-bits instead of costly routing tables, thus reducing hardware overheads for larger networks as well. In terms of performance, the average flit latency cycles are reduced up to 31% and the average network throughput is improved up to 14.5% for 1-router failure in 8 x 8 2D mesh NoC. For 2-router failures, the improvements are 20% and 13% in terms of average flit latency cycles and average network throughput, respectively.

关键词： Network-on-chip Routing function reconfiguration algorithm Fault-tolerance

来源：评论

学校读者我要写书评

暂无评论

reconfiguration algorithms for synchronous communication on switch based degradable arrays

引用

PARALLEL COMPUTING 2022年 111卷

作者： Wu, Yalan Wu, Jigang Liu, Peng Han, Yinhe Srikanthan, Thambipillai Guangdong Univ Technol Sch Comp Sci & Technol Guangzhou 510006 Guangdong Peoples R China Chinese Acad Sci Inst Comp Technol Beijing 100190 Peoples R China Nanyang Technol Univ Sch Comp Sci & Engn Singapore 639798 Singapore

Synchronous communication is one of the most important issues in high performance architectures for large scale of parallel computing, such as matrix computing, image processing, etc. Mesh-connected processor array is characteristic of synchronous communication due to the same length of the interconnects between the neighboring processing elements (PEs) in rows/columns. But long interconnects caused by faulty PEs clearly impact the synchronous communication between the adjacent rows/columns. If long interconnects exist between two adjacent rows, we say that a synchronous communication delay is caused. This paper contributes algorithms to construct logical arrays with synchronous communication in a given host array. Specifically, an algorithm for synchronous communication array (ASCA) is firstly presented, to construct a maximum logical array with synchronous communication. When all of the long interconnects are independent each other, the proposed algorithm is proved to be optimal. After that, two heuristic algorithms are also proposed, to construct a logical array with given size, by integrating the proposed ASCA and two exclusion schemes. The proposed two exclusion schemes are based on strategies of divide-and-conquer and the longest logical column first, respectively. In addition, the lower bound of synchronous communication delay for a logical array is calculated by an algorithm also developed in this paper, in order to evaluate the synchronous performance of reconfiguration algorithms. Simulation results show that, the proposed two heuristic algorithms have their own advantages for different cases. The synchronous communication delay of the logical arrays is significantly reduced, and it is very close to the lower bound for the cases of small fault density and larger exclusion rate. For 32 x 32 physical arrays with exclusion rates that are larger than 15%, the synchronous communication delay of logical array is reduced from 11.09 to 6.97, which is more closer t

关键词： Mesh-connected processor array reconfiguration algorithm Fault-tolerance Synchronous communication

来源：评论

学校读者我要写书评

暂无评论

TRACK: An algorithm for fault-tolerant, dynamic and scalable 2D mesh network-on-chip routing reconfiguration

引用

INTEGRATION-THE VLSI JOURNAL 2020年 72卷 92-110页

作者： Jain, Anugrah Laxmi, Vijay Tripathi, Meenakshi Gaur, Manoj Singh Bishnoi, Rimpy Malaviya Natl Inst Technol Jaipur Jaipur 302017 Rajasthan India Indian Inst Technol Jammu Jammu 181221 Jammu & Kashmir India

Network-on-chip (NoC) is a reliable and scalable on-chip interconnect solution particularly used for MPSoCs and CMPs. Increasing susceptibility of NoC to failures is becoming a new research concern. Failures in components such as on-chip link or router may disrupt the underlying routing function. reconfiguration of routing function is required to sustain network connectivity while maintaining deadlock-freedom in event of failure(s). Existing approaches either use routing tables or meta-data or involve all network nodes for participation in the reconfiguration process. This paper proposes TRACK, an algorithm for fast and scalable routing reconfiguration. It uses logic-based routing instead of tables and identifies affected nodes (i.e., rows/columns of mesh network) by single and double-link failures. In the proposed algorithm, reconfiguration is needed only for the affected nodes and the remaining network can continue to work. TRACK outperforms the existing one and reduces latency up to 42% and improves throughput up to 22% for single and double-link failures in 8 x 8 2D mesh network-on-chip. By employing logic-based routing, hardware cost is also reduced, i.e., 30% in area and 29.5% in power overhead for a 16 x 16 mesh router.

关键词： Network-on-chip Routing function reconfiguration algorithm Scalability Fault-tolerance

来源：评论

学校读者我要写书评

暂无评论

High precision reconstruction for compressed ultrafast off-axis holography

引用

OPTICS COMMUNICATIONS 2024年 553卷

作者： Ma, Zhao Ding, Yi Li, Yingrong Yuan, Xiaoqun Xi, Jiangtao Wuyi Univ Fac Intelligent Mfg Jiangmen 529020 Peoples R China Wuhan Univ Sch Informat Management Wuhan 430072 Peoples R China Univ Wollongong Sch Elect Comp Telecommun Engn Wollongong 2522 Australia

Existing compressed ultrafast photography (CUP) mainly acquires the light intensity and loses the phase information that characterizes the spatial features. In this paper, we propose a compressed ultrafast holographic imaging system to achieve phase measurement in ultrafast dynamic samples. In the proposed imaging system, the Mach-Zehnder interference structure is incorporated into compressed ultrafast photography. Based on this imaging system, a reconstruction method combining the plug-and-play generalized alternating projection (PnPGAP) framework and the depth filtering of prior FastDVDNet is proposed to recover the hologram sequence in ultrafast temporal resolution. FastDVDNet employs the correlation between frames to enhance denoising performance and maintain temporal continuity, thus obtaining better results for ultrafast hologram sequence reconstruction. The simulation results indicate that the proposed method outperforms other reconstruction methods in terms of average peak signal-to-noise ratio (PSNR) and structural similarity (SSIM).

关键词： Compressed ultrafast holographic imaging Compressed ultrafast photography Mach-Zehnder reconfiguration algorithm

来源：评论

学校读者我要写书评

暂无评论

The hamiltonian path graph is connected for simple s, t paths in rectangular grid graphs

引用

JOURNAL OF COMBINATORIAL OPTIMIZATION 2024年第4期48卷 1-48页

作者： Nishat, Rahnuma Islam Srinivasan, Venkatesh Whitesides, Sue Brock Univ Dept Comp Sci St Catharines ON Canada Santa Clara Univ Dept Math & Comp Sci Santa Clara CA USA Univ Victoria Dept Comp Sci Victoria BC Canada

An s, t Hamiltonian path P for an m xn rectangular grid graph G is a Hamiltonian path from the top-left corner s to the bottom-right corner t. We define an operation "square-switch" on s, t Hamiltonian paths P affecting only those edges of P that lie in some small (2 units by 2 units) square subgrid of G. We prove that when applied to suitable locations, the result of the square-switch is another s, t Hamiltonian path. Then we use square-switch to achieve a reconfiguration result for a subfamily of s, t Hamiltonian paths we call simple paths, that has the minimum number of bends for each maximal internal subpath connecting any two vertices on the boundary of the grid graph. We give an algorithmic proof that the Hamiltonian path graph G whose vertices represent simple paths is connected when edges arise from the square-switch operation: our algorithm reconfigures any given initial simple path P to any given target simple path P ' in O(|P|) time and O(|P|) space using at most 5|P|/4 square-switches, where |P| = m x n is the number of vertices in the grid graph G and hence in any Hamiltonian path P for G. Thus the diameter of the simple path graph G is at most 5mn/ 4 for the square-switch operation, which we show is asymptotically tight for this operation.

关键词： reconfiguration algorithm Hamiltonian paths Simple paths Rectangular grid graphs Optimal-time algorithm Lower bound Solution-space graph

来源：评论

学校读者我要写书评

暂无评论

Square dynamic reconfiguration for the partial shaded photovoltaic system - simulation and experimental analysis

引用

ENERGY SOURCES PART A-RECOVERY UTILIZATION AND ENVIRONMENTAL EFFECTS 2022年第3期44卷 6868-6885页

作者： Shakthivel, Suriya Kala David, Prince Winston Backiyam, Sathya Periya Murugan, Madhu Shobini Kamaraj Coll Engn & Technol Dept Elect & Elect & Engn Madurai Tamil Nadu India Kamaraj Coll Engn & Technol Dept Elect & Elect Engn Madurai Tamil Nadu India Sri Vidhya Coll Engn & Technol Dept Elect & Elect Engn Virudunagar India

The solar photovoltaic system often encounters partial shading issues which invariably affect the output power generation from the PV array. Partial shading conditions cannot be discarded but able to be diminished using reconfiguration techniques. A new square dynamic reconfiguration algorithm is critically analyzed in this paper for the partial shaded Photovoltaic System. However, several other dynamic reconfiguration algorithms exist, the proposed square dynamic reconfiguration technique extracts maximum power from the PV array using a feasible switching circuit. In this method, an 8 x 8 PV array splits into four quadrants of each 4 x 4 matrix is investigated and a switching matrix is introduced between the quadrants in this proposed square dynamic reconfiguration algorithm. Each quadrant possesses an equal number of rows and columns. The row current in terms of the short circuit current of each row is utilized to categorize the different cases. The simulation work of this proposed SDR method is conducted in MATLAB Simulink software for 8 x 8 matrices and the experimentation is accomplished using a test setup of a 4 x 4 PV array. Randomly seven shading types are considered to verify the effectiveness of our work. In the switching matrix, only 16 switches are taken to extract a maximum power of 136 W out from the 160 W experimentation 4 x 4 PV array test set up under partial shading. The herein conducted research work provides an innovative and simpler reconfiguration algorithm because of its lesser number of switches in the switching circuit with a convenient operation to generate power during partial shading conditions.

关键词： Square-based dynamic reconfiguration photovoltaic (PV) array reconfiguration algorithm switching matrix partial shading

来源：评论

学校读者我要写书评

暂无评论

A fully reconfigurable series-parallel photovoltaic module for higher energy yields in urban environments

引用

RENEWABLE ENERGY 2021年 179卷 1-11页

作者： Calcabrini, Andres Muttillo, Mirco Weegink, Raoul Manganiello, Patrizio Zeman, Miro Isabella, Olindo Delft Univ Technol Dept Elect Sustainable Energy Postbus 5031 NL-2600 GA Delft Netherlands

Photovoltaic modules in the urban environment are very often exposed to uneven illumination conditions. The electrical interconnection between solar cells in a photovoltaic module limits the power that a solar module can generate under partial shading conditions. In this article, we introduce a PV module that is able to dynamically reconfigure the interconnection between its solar cells to minimise conduction and mismatch losses according to the irradiance distribution on its surface. Using an accurate simulation framework, it is determined that a reconfigurable PV module can generate over 12% more energy than a standard PV module with fixed topology and six bypass diodes, and as much energy as a fixed series-parallel module with six parallel strings, but at significantly lower currents. Simulation results are validated experimentally using a photovoltaic module with six reconfigurable blocks of cells controlled by a switching matrix on a high-performance solar flash simulator. (c) 2021 The Authors. Published by Elsevier Ltd. This is an open access article under the CC BY license (http://***/licenses/by/4.0/).

关键词： Reconfigurable PV module reconfiguration algorithm Urban PV Partial shading Shading tolerance

来源：评论

学校读者我要写书评

暂无评论

Distribution Network reconfiguration Method with Distributed Generators Based on an Improved Shuffled Frog Leaping algorithm

Distribution Network Reconfiguration Method with Distributed...

引用

IEEE IAS/PES Power Africa Conference

作者： Dong, Xuzhu Wu, Zhengrong Chen, Liming Liu, Zhiwen Xu, Xiaoliang Elect Power Res Inst China Southern Power Grid Guangzhou Peoples R China Nanjing NARI Relays Elect Co Ltd Nanjing Peoples R China

ISBN: (纸本)9781538641637

Reconstruction of a distribution network is a complex nonlinear combinatorial optimization problem. A reconfiguration algorithm of a distribution network based on an improved shuffled frog leaping algorithm using molecular dynamics theory and cloud simulation theory was proposed to solve the problems of slow convergence for current distribution network reconfiguration method. The reconstruction optimization process of the distribution network was as follows. First, the integer coding strategy based on the independent loop was adopted, and the initial data of distribution network was input, followed by random generation of the effective initial swarm of corresponding scale;Second, the distribution network was simplified, and the effective solution was obtained based on the reconfiguration network simplification principle;Third, the back forward sweep algorithm method for was used for the power flow calculation of effective solutions;Finally, iterative swarm optimization was conducted based on the improved shuffled frog leaping algorithm(SFLA). The simulation results based on the IEEE33 node distribution system showed that the active network loss value of the system was decreased obviously, reaching 16.57%. The active power P increased significantly compared with that before the reconfiguration in which the distributed generators (DGs) were accessed. The proposed algorithm has good optimization performance in solving the problem of distribution network reconfiguration compared with the traditional particle swarm optimization (PSO) and the differential evolution algorithm (DE).

关键词： Distributed generator distribution network reconfiguration algorithm improved shuffled frog leaping algorithm

来源：评论

学校读者我要写书评

暂无评论

Distributed tunneling reconfiguration of cubic modular robots without meta-module's disassembling in severe space requirement

引用

ROBOTICS AND AUTONOMOUS SYSTEMS 2020年第0期124卷 103369-000页

作者： Kawano, Hiroshi NIT Corp NTT Commun Sci Labs Atsugi Kanagawa 2430198 Japan

This paper studies a tunneling-based reconfiguration algorithm for cubic modular robots. Tunneling-based reconfiguration is a promising approach for cubic modular robot reconfiguration in severe space requirements. This is because a tunneling modular robot only uses spaces occupied by the start and goal configurations. However, previously proposed methods have a limitation on the arrangement of the start and goal configurations, in which the overlapped part between them must be connected. We propose a tunneling reconfiguration algorithm that removes the limitation and is available for cases with multi-overlapped parts between the start and goal configurations. It is often the case that a tunneling-based reconfiguration assumes the use of a meta-module-based structure to maintain the connectivity and mobility of the robot structure. However, in previous methods, the meta-modules often come apart during the tunneling process, and each module belongs to a different meta-module before and after the reconfiguration. The proposed algorithm also solves this problem. We implement the algorithm in a distributed form and prove its completeness for assumed robot structures. We examine the proposed tunneling algorithm by simulation. (C) 2019 Elsevier B.V. All rights reserved.

关键词： Cubic modular robots reconfiguration algorithm Distributed robots

来源：评论

学校读者我要写书评

暂无评论

Reconfigurable electrical interconnection strategies for photovoltaic arrays: A review

引用

RENEWABLE & SUSTAINABLE ENERGY REVIEWS 2014年 33卷 412-426页

作者： La Manna, Damiano Vigni, Vincenzo Li Sanseverino, Eleonora Riva Di Dio, Vincenzo Romano, Pietro Univ Palermo DEIM Palermo Italy

Non-uniform irradiance significantly decreases the power delivered by solar photovoltaic arrays. A promising technique for compensating these power losses relies on dynamically reconfiguring the electrical connections between photovoltaic modules. This paper presents the current state-of-the-art strategies for photovoltaic array reconfiguration in order to increase the power output under partial shading and mismatch conditions. The different approaches have been compared in terms of effectiveness of the control algorithms, monitored electrical and environmental variables, overall hardware complexity and specific features of each solution. Finally, the most challenging aspects of the reconfiguration strategy are identified and further discussed. (C) 2014 Elsevier Ltd. All rights reserved.

关键词： Partial shading Reconfigurable photovoltaic array Electrical mismatch reconfiguration algorithm TCT Switching matrix MPPT

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：