Pareto optimal mapping for tile-based network-on-chip under reliability constraints

DOI10.1080/00207160.2014.892073zbMath1322.68257OpenAlexW2073173499MaRDI QIDQ4983268

Xiaoyu Song, Guo-wu Yang, Qianqi le, William N. N. Hung, Xinpeng Zhang

Publication date: 25 March 2015

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2014.892073

zbMATH Keywords

mappingreliabilityparticle swarm optimizationoptimization algorithmnetwork-on-chip

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20)

Cites Work

• A study of particle swarm optimization particle trajectories
• Using quantum-behaved particle swarm optimization algorithm to solve non-linear programming problems
• New polynomial time algorithms to compute a set of Pareto optimal paths for multi-objective shortest path problems

This page was built for publication: Pareto optimal mapping for tile-based network-on-chip under reliability constraints