Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Application mapping and NoC configuration using hybrid particle swarm optimization

View through CrossRef
Network-on-Chip (NoC) has been proposed as an interconnection framework for connecting large number of cores for a System-on-Chip (SoC). Assuming a mesh-based NoC, we investigate application mapping and NoC configuration optimization using a hybrid optimization scheme. Our technique, Hybrid Discrete Particle Swarm Optimization (HDPSO), combines Tabu-search, communication volume based core swapping, and swarm intelligence. We employ a Tabu-list to discourage swarm particles to re-visit the explored search space and propose an alternative route towards the intended movement direction. In each iteration of swarm, a sub-swarm containing configuration solutions (sub-particles) searches for optimal configuration for the parent particle (mapping solution). Optimization goals include minimum average communication latency, power, area, credit loop latency, and maximum average link duty factor. The proposed technique is tested for well-known multimedia application core graphs and several large synthetic cores-graphs. It was found that on average our hybrid scheme generates high quality NoC mapping and configuration solutions when compared to some existing stochastic optimization techniques.
Ryerson University Library and Archives
Title: Application mapping and NoC configuration using hybrid particle swarm optimization
Description:
Network-on-Chip (NoC) has been proposed as an interconnection framework for connecting large number of cores for a System-on-Chip (SoC).
Assuming a mesh-based NoC, we investigate application mapping and NoC configuration optimization using a hybrid optimization scheme.
Our technique, Hybrid Discrete Particle Swarm Optimization (HDPSO), combines Tabu-search, communication volume based core swapping, and swarm intelligence.
We employ a Tabu-list to discourage swarm particles to re-visit the explored search space and propose an alternative route towards the intended movement direction.
In each iteration of swarm, a sub-swarm containing configuration solutions (sub-particles) searches for optimal configuration for the parent particle (mapping solution).
Optimization goals include minimum average communication latency, power, area, credit loop latency, and maximum average link duty factor.
The proposed technique is tested for well-known multimedia application core graphs and several large synthetic cores-graphs.
It was found that on average our hybrid scheme generates high quality NoC mapping and configuration solutions when compared to some existing stochastic optimization techniques.

Related Results

Application mapping and NoC configuration using hybrid particle swarm optimization
Application mapping and NoC configuration using hybrid particle swarm optimization
Network-on-Chip (NoC) has been proposed as an interconnection framework for connecting large number of cores for a System-on-Chip (SoC). Assuming a mesh-based NoC, we investigate a...
Modeling Hybrid Metaheuristic Optimization Algorithm for Convergence Prediction
Modeling Hybrid Metaheuristic Optimization Algorithm for Convergence Prediction
The project aims at the design and development of six hybrid nature inspired algorithms based on Grey Wolf Optimization algorithm with Artificial Bee Colony Optimization algorithm ...
Modeling Hybrid Metaheuristic Optimization Algorithm for Convergence Prediction
Modeling Hybrid Metaheuristic Optimization Algorithm for Convergence Prediction
The project aims at the design and development of six hybrid nature inspired algorithms based on Grey Wolf Optimization algorithm with Artificial Bee Colony Optimization algorithm ...
Trajectory optimization of manipulator based on particle swarm optimization with mutation strategy
Trajectory optimization of manipulator based on particle swarm optimization with mutation strategy
Abstract In order to solve the problems of slow convergence speed and low convergence accuracy of adaptive particle swarm algorithm, a particle swarm optimization algorithm...
Quantum Behaved Particle Swarm Optimization Algorithm Based on Artificial Fish Swarm
Quantum Behaved Particle Swarm Optimization Algorithm Based on Artificial Fish Swarm
Quantum behaved particle swarm algorithm is a new intelligent optimization algorithm; the algorithm has less parameters and is easily implemented. In view of the existing quantum b...
Hybrid Optimization Algorithm for Multi-level Image Thresholding Using Salp Swarm Optimization Algorithm and Ant Colony Optimization
Hybrid Optimization Algorithm for Multi-level Image Thresholding Using Salp Swarm Optimization Algorithm and Ant Colony Optimization
The process of identifying optimal threshold for multi-level thresholding in image segmentation is a challenging process. An efficient optimization algorithm is required to find th...
Particle Swarm Optimization and Image Analysis
Particle Swarm Optimization and Image Analysis
Particle Swarm Optimization (PSO) is a simple but powerful optimization algorithm, introduced by Kennedy and Eberhart (Kennedy 1995). Its search for function optima is inspired by ...
Multi-objective Optimal Scheduling Analysis of Power System Based on Improved Particle Swarm Algorithm
Multi-objective Optimal Scheduling Analysis of Power System Based on Improved Particle Swarm Algorithm
Economic Environmental Dispatching (EED) in power systems is a multi-variable, strongly constrained, non-convex, multi-objective optimization problem that is difficult to properly ...

Back to Top