Cart (Loading....) | Create Account
Close category search window
 

Energy-aware Mapping for Tree-based NoC Architectures by Recursive Bipartitioning

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

3 Author(s)
Zhengwei Chang ; Sch. of Comput. Sci. & Eng., Univ. of Electron. Sci. & Technol. of China, Chengdu ; Guangze Xiong ; Nan Sang

In this paper, we present an approach to map intellectual property (IP) cores onto tree based network-on-chip (NoC) architecture such that the total communication energy is minimized. We first formulate the problem of energy-aware mapping, and then propose a recursive bipartitioning algorithm to solve it. The proposed technique is an efficient divide-and-conquer approach, based on the Kernighan-Lin mincut bisection heuristic. Experimental results show that the recursive bipartitioning method is very fast and effective, so it is suited to both quick design space exploration and producing excellent results.

Published in:

Embedded Software and Systems, 2008. ICESS '08. International Conference on

Date of Conference:

29-31 July 2008

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.