Static packet routing in noc platform using ACO-Based algorithms

Authors:
Luneque Silva Junior;Nadia Nedjah;Luiza de Macedo Mourelle
Affiliations:
Systems Engineering and Computer Science Program, COPPE, Federal University of Rio de Janeiro, Brazil;Department of Electronics Engineering and Telecommunications, State University of Rio de Janeiro, Brazil;Department of Systems Engineering and Computation, State University of Rio de Janeiro, Brazil
Venue:
IDEAL'12 Proceedings of the 13th international conference on Intelligent Data Engineering and Automated Learning
Year:
2012

Citing 9
Cited 0

The turn model for adaptive routing

ISCA '92 Proceedings of the 19th annual international symposium on Computer architecture
TGFF: task graphs for free

Proceedings of the 6th international workshop on Hardware/software codesign
Swarm intelligence: from natural to artificial systems

Swarm intelligence: from natural to artificial systems
The Odd-Even Turn Model for Adaptive Routing

IEEE Transactions on Parallel and Distributed Systems
A Survey of Wormhole Routing Techniques in Direct Networks

Computer
Networks on Chips: A New SoC Paradigm

Computer
Ant colony optimization

IEEE Computational Intelligence Magazine
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Networks-on-Chip (NoC) have been used as an interesting option in design of communication infrastructures for embedded systems, providing a scalable structure and balancing the communication between cores. Because several data packets can be transmitted simultaneously through the network, an efficient routing strategy must be used in order to avoid congestion delays. In this paper, ant colony algorithms were used to find and optimize routes in a mesh-based NoC, where several randomly generated applications have been mapped. The routing optimization is driven by the minimization of total latency in packets transmission between tasks. The simulation results show the effectiveness of the ant colony inspired routing by comparing it with general purpose algorithms for deadlock free routing.