Search results for "routing"
showing 10 items of 587 documents
A Novel Fault-Tolerant Routing Algorithm for Mesh-of-Tree Based Network-on-Chips
2019
Use of bus architecture based communication with increasing processing elements in System-on-Chip (SoC) leads to severe degradation of performance and speed of the system. This bottleneck is overcome with the introduction of Network-on-Chips (NoCs). NoCs assist in communication between cores on a single chip using router based packet switching technique. Due to miniaturization, NoCs like every Integrated circuit is prone to different kinds of faults which can be transient, intermittent or permanent. A fault in any one component of such a crucial network can degrade performance leaving other components non-usable. This paper presents a novel Fault-Tolerant routing Algorithm for Mesh-of-Tree …
Addressing Manufacturing Challenges with Cost-Efficient Fault Tolerant Routing
2010
The high-performance computing domain is enriching with the inclusion of Networks-on-chip (NoCs) as a key component of many-core (CMPs or MPSoCs) architectures. NoCs face the communication scalability challenge while meeting tight power, area and latency constraints. Designers must address new challenges that were not present before. Defective components, the enhancement of application-level parallelism or power-aware techniques may break topology regularity, thus, efficient routing becomes a challenge.In this paper, uLBDR (Universal Logic-Based Distributed Routing) is proposed as an efficient logic-based mechanism that adapts to any irregular topology derived from 2D meshes, being an alter…
Run-time scalable NoC for FPGA based virtualized IPs
2017
The integration of virtualized FPGA-based hardware accelerators in a cloud computing is progressing from time to time. As the FPGA has limited resources, the dynamic partial reconfiguration capability of the FPGA is considered to share resources among different virtualized IPs during runtime. On the other hand, the NoC is a promising solution for communication among virtualized FPGA-based IPs. However, not all the virtualized regions of the FPGA will be active all the time. When there is no demand for virtualized IPs, the virtualized regions are loaded with blank bitstreams to save power. However, keeping active the idle components of the NoC connecting with the idle virtualized regions is …
Adaptive Finite Temperature String Method in Collective Variables.
2017
Here we present a modified version of the on-the-fly string method for the localization of the minimum free energy path in a space of arbitrary collective variables. In the proposed approach the shape of the biasing potential is controlled by only two force constants, defining the width of the potential along the string and orthogonal to it. The force constants and the distribution of the string nodes are optimized during the simulation, improving the convergence. The optimized parameters can be used for umbrella sampling with a path CV along the converged string as the reaction coordinate. We test the new method with three fundamentally different processes: chloride attack to chloromethane…
On numerical broadening of particle size spectra: a condensational growth study using PyMPDATA 1.0
2021
Abstract. The work discusses the diffusional growth in particulate systems such as atmospheric clouds. It focuses on the Eulerian modeling approach in which the evolution of the probability density function describing the particle size spectrum is carried out using a fixed-bin discretization. The numerical diffusion problem inherent to the employment of the fixed-bin discretization is scrutinized. The work focuses on the applications of MPDATA family of numerical schemes. Several MPDATA variants are explored including: infinite-gauge, non-oscillatory, third-order-terms and recursive antidiffusive correction (double pass donor cell, DPDC) options. Methodology for handling coordinate transfor…
How much is enough? : The convergence of finite sample scattering properties to those of infinite media
2021
We study the scattering properties of a cloud of particles. The particles are spherical, close to the incident wavelength in size, have a high albedo, and are randomly packed to 20% volume density. We show, using both numerically exact methods for solving the Maxwell equations and radiative-transfer-approximation methods, that the scattering properties of the cloud converge after about ten million particles in the system. After that, the backward-scattered properties of the system should estimate the properties of a macroscopic, practically infinite system. (C) 2021 The Authors. Published by Elsevier Ltd. This is an open access article under the CC BY-NC-ND license (http://creativecommons.o…
A Stochastic Routing Algorithm for Distributed IoT with Unreliable Wireless Links
2016
Punctual and reliable transmission of collected information is indispensable for many Internet of Things (IoT) applications. Such applications rely on IoT devices operating over wireless communication links which are intrinsically unreliable. Consequently to improve packet delivery success while reducing delivery delay is a challenging task for data transmission in the IoT. In this paper, we propose an improved distributed stochastic routing algorithm to increase packet delivery ratio and decrease delivery delay in IoT with unreliable communication links. We adopt the concept of absorbing Markov chain to model the network and evaluate the expected delivery ratio and expected delivery delay …
Large multiple neighborhood search for the soft-clustered vehicle-routing problem
2021
Abstract The soft-clustered vehicle-routing problem (SoftCluVRP) is a variant of the classical capacitated vehicle-routing problem. Customers are partitioned into clusters and all customers of the same cluster must be served by the same vehicle. In this paper, we present a large multiple neighborhood search for the SoftCluVRP. We design and analyze multiple cluster destroy and repair operators as well as two post-optimization components, which are both based on variable neighborhood descent. The first allows inter-route exchanges of complete clusters, while the second searches for intra-route improvements by combining classical neighborhoods (2-opt, Or-opt, double-bridge) and the Balas-Simo…
Adaptive-gain extended Kalman filter: Extension to the continuous-discrete case
2009
In the present article we propose a nonlinear observer that merges the behaviors 1) of an extended Kalman filter, mainly designed to smooth off noise , and 2) of high-gain observers devoted to handle large perturbations in the state estimation. We specifically aim at continuous-discrete systems. The strategy consists in letting the high-gain self adapt according to the innovation. We define innovation computed over a time window and justify its usage via an important lemma. We prove the general convergence of the resulting observer.
Adaptive Feedforward Control of a Pressure Compensated Differential Cylinder
2020
This paper presents the design, simulation and experimental verification of adaptive feedforward motion control for a hydraulic differential cylinder. The proposed solution is implemented on a hydraulic loader crane. Based on common adaptation methods, a typical electro-hydraulic motion control system has been extended with a novel adaptive feedforward controller that has two separate feedforward states, i.e, one for each direction of motion. Simulations show convergence of the feedforward states, as well as 23% reduction in root mean square (RMS) cylinder position error compared to a fixed gain feedforward controller. The experiments show an even more pronounced advantage of the proposed c…