Go home now Header Background Image
Search
Submission Procedure
share: |
 
Follow us
 
 
 
 
Volume 18 / Issue 7

available in:   PDF (223 kB) PS (527 kB)
 
get:  
Similar Docs BibTeX   Write a comment
  
get:  
Links into Future
 
DOI:   10.3217/jucs-018-07-0917

 

ACO-based Algorithms for Search and Optimization of Routes in NoC Platform

Luneque Silva Junior (State University of Rio de Janeiro, Brazil)

Nadia Nedjah (State University of Rio de Janeiro, Brazil)

Luiza de Macedo Mourelle (State University of Rio de Janeiro, Brazil)

Abstract: Network-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. The routing optimization is driven by the minimization of total latency in packets transmission. The simulation results show the effectiveness of the ant colony inspired routing by comparing it with general purpose algorithms for deadlock free routing under different traffic patterns.

Keywords: ant colony optimization, network-on-chip, packet routing

Categories: B.4.3, I.2.8, I.6.3