By Topic

A minimum-path mapping algorithm for 2D mesh Network on Chip architecture

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Ge Fen ; Dept. of Electron. Eng., Nanjing Univ. of Aeronaut. & Astronaut., Nanjing ; Wu Ning

In this paper, we present a minimum-path mapping algorithm based on genetic algorithm that automatically maps IP cores onto 2D mesh network on chip (NoC) architecture. Our algorithm consists of node mapping and minimum routing paths selection. These steps map core communication graphs onto 2D mesh NoC architectures for optimizing communication power consumption and balancing the traffic across the links under bandwidth constraint. Experimental results with several random benchmarks and a real application (a MPEG4 decoder) show that our proposed algorithm saves about 30% of power consumption compared to random mapping on average.

Published in:

Circuits and Systems, 2008. APCCAS 2008. IEEE Asia Pacific Conference on

Date of Conference:

Nov. 30 2008-Dec. 3 2008