scholarly journals Optimizing Crosstalk in Optical NoC through Heuristic Fusion Mapping

Electronics ◽  
2020 ◽  
Vol 9 (6) ◽  
pp. 1006
Author(s):  
Xinhao Shi ◽  
Ning Wu ◽  
Fen Ge ◽  
Fang Zhou ◽  
Muhammad Rehan Yahya
Keyword(s):  
Simulated Annealing Algorithm ◽  
Interconnection Network ◽  
Optical Network ◽  
Optical Signal ◽  
Crosstalk Noise ◽  
Mapping Algorithm ◽  
Annealing Algorithm ◽  
On Chip ◽  
Mapping Scheme ◽  
Better Than

Optical network-on-chip is considered to be a promising technology to solve the problems of low bandwidth and high latency in the traditional interconnection network. However, due to the inevitable leakage of optical devices, the optical signal will receive crosstalk noise during transmission. In this paper, a heuristic fusion mapping algorithm PSO_SA for crosstalk optimization is proposed. First, the initial optimal mapping is obtained by particle swarm optimization, and then the local optimization of the mapping scheme is removed by combining with simulated annealing algorithm. The experimental results show that the crosstalk optimization performance of PSO_SA algorithm is better than that of GA algorithm in 263 dec, Wavelet, DVOPD and other applications, and the maximum optimization degree is 28.7%.

scholarly journals Multi-Objective Design of Analog Integrated Circuits Using Simulated Annealing with Crossover Operator and Weight Adjusting

2012 ◽  
Vol 7 (1) ◽  
pp. 7-15
Author(s):  
T. O. Weber ◽  
Wilhelmus A. M. V. Noije
Keyword(s):  
Simulated Annealing ◽  
Integrated Circuits ◽  
Pareto Front ◽  
Analog Circuit ◽  
Simulated Annealing Algorithm ◽  
Global Optimum ◽  
Trade Offs ◽  
Adaptive Simulated Annealing ◽  
Annealing Algorithm ◽  
Better Than

This paper approaches the problem of analog circuit synthesis through the use of a Simulated Annealing algorithm with capability of performing crossovers with past anchor solutions (solutions better than all the others in one of the specifications) and modifying the weight of the Aggregate Objective Function specifications in order to escape local minimums. Search for the global optimum is followed by search for the Pareto front, which represents the trade-offs involved in the design and it is performed using the proposed algorithm together with Particle Swarm Optimization. In order to check the performance of the algorithm, the synthesis of a Miller Amplifier was accomplished in two different situations. The first was the comparison of 40 syntheses for Adaptive Simulated Annealing (ASA), Simulate Annealing/Quenching (SA/SQ) and the proposed SA/SQ algorithm with crossovers using a 20-minute bounded optimization with the aim of comparing the solutions of each method. Results were compared using Wilcoxon-Mann-Whitney test with a significance of 0.05 and showed that simulated annealing with crossovers have higher change of returning a good solution than the other algorithms used in this test. The second situation was the synthesis not bounded by time aiming to achieve the best circuit in order to test the use of crossovers in SA/SQ. The final amplifier using the proposed algorithm had 15.6 MHz of UGF, 82.6 dBV, 61º phase margin, 26 MV/s slew rate, area of 980 μm² and current supply of 297 μA in a 0.35 μm technology and was performed in 84 minutes.

scholarly journals Combined Simulated Annealing Algorithm for the Discrete Facility Location Problem

2012 ◽  
Vol 2012 ◽  
pp. 1-7 ◽  
Author(s):  
Jin Qin ◽  
Ling-lin Ni ◽  
Feng Shi
Keyword(s):  
Simulated Annealing ◽  
Facility Location ◽  
Location Problem ◽  
Simulated Annealing Algorithm ◽  
Facility Location Problem ◽  
Location Decision ◽  
Previous Algorithm ◽  
Annealing Algorithm ◽  
Discrete Facility Location ◽  
Better Than

The combined simulated annealing (CSA) algorithm was developed for the discrete facility location problem (DFLP) in the paper. The method is a two-layer algorithm, in which the external subalgorithm optimizes the decision of the facility location decision while the internal subalgorithm optimizes the decision of the allocation of customer's demand under the determined location decision. The performance of the CSA is tested by 30 instances with different sizes. The computational results show that CSA works much better than the previous algorithm on DFLP and offers a new reasonable alternative solution method to it.

scholarly journals Threshold Accepting Heuristic for Fair Flow Optimization in Wireless Mesh Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-11 ◽  
Author(s):  
Jarosław Hurkała ◽  
Tomasz Śliwiński
Keyword(s):  
Wireless Mesh Networks ◽  
Simulated Annealing Algorithm ◽  
Mesh Networks ◽  
Difficult Problem ◽  
Weighted Averaging ◽  
Mixed Integer ◽  
Threshold Accepting ◽  
Wireless Mesh ◽  
Annealing Algorithm ◽  
Better Than

Developing effective, fairness-preserving optimization algorithms is of considerable importance in systems which serve many users. In this paper we show the results of the threshold accepting procedure applied to extremely difficult problem of fair resource allocation in wireless mesh networks (WMN). The fairness is modeled by allowing preferences with regard to distribution of Internet traffic between network participants. As aggregation operator we utilize weighted ordered weighted averaging (WOWA). In the underlaying optimization problem, the physical medium properties cause strong interference among simultaneously operating node devices, leading to nonlinearities in the mixed-integer pricing subproblem. That is where the threshold accepting procedure is applied. We show that, the threshold accepting heuristic performs much better than the widely utilized simulated annealing algorithm.

Research on Printed Wiring Boards Manufacture Based on Optimization

2013 ◽  
Vol 312 ◽  
pp. 506-510
Author(s):  
Jiang Ze Hu ◽  
An Ni Peng ◽  
Xin Zhong Lu
Keyword(s):  
Genetic Algorithm ◽  
Simulated Annealing ◽  
Shortest Path ◽  
Ant Colony Algorithm ◽  
Simulated Annealing Algorithm ◽  
Programming Model ◽  
Printed Wiring Boards ◽  
Tool Switching ◽  
Annealing Algorithm ◽  
Better Than

The efficiency E of a punch for making printed wiring boards is decided by its cost and time. The weight of cost and time is different in different companies. In this paper, we establish a bi-object programming model to measure E. We use an algorithm for obtaining an order of tool switching. Considering how to calculate the shortest path for every tool, we compare three modern optimizationalgorithms. We find Ant colony Algorithm is best in computing the shortest path, but it will cost a lot of time in running. Genetic Algorithm is better than Simulated Annealing Algorithm in time and cost. We make some improvements on these algorithms.

scholarly journals Power and Signal-to-Noise Ratio Optimization in Mesh-Based Hybrid Optical Network-on-Chip using Semiconductor Optical Amplifiers

2019 ◽  
Vol 9 (6) ◽  
pp. 1251 ◽  
Author(s):  
Jun Yeong Jang ◽  
Min Su Kim ◽  
Chang-Lin Li ◽  
Tae Hee Han
Keyword(s):  
Optical Amplifiers ◽  
Signal To Noise Ratio ◽  
Optical Network ◽  
Semiconductor Optical Amplifiers ◽  
Network On Chip ◽  
Laser Source ◽  
Crosstalk Noise ◽  
Worst Case ◽  
And Performance ◽  
On Chip

To address the performance bottleneck in metal-based interconnects, hybrid optical network-on-chip (HONoC) has emerged as a new alternative. However, as the size of the HONoC grows, insertion loss and crosstalk noise increase, leading to excessive laser source output power and performance degradation. Therefore, we propose a low-power scalable HONoC architecture by incorporating semiconductor optical amplifiers (SOAs). An SOA placement algorithm is developed considering insertion loss and crosstalk noise. Furthermore, we establish a worst-case crosstalk noise model of SOA-enabled HONoC and induce optimized SOA gains with respect to power consumption and performance, respectively. Extensive simulations for worst-case signal-to-noise ratio (SNR) and power consumption are conducted under various traffic patterns and different network sizes. Simulation results show that the proposed SOA-enabled HONoC architecture and the associated algorithm help sustain the performance as network size increases without additional laser source power.

Sign in / Sign up

Export Citation Format

Share Document