Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

A Methodology Based on Maximal-Profit Spanning Tree for Designing Application Specific Networks on Chip (ASNOC)

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)
Yuan-Long Jeang ; Dept. of Inf. Eng., Kun Shan Univ., Tainan ; Chung-Wei Hung ; Chuen-Muh Chiang

In this paper, a methodology based on a mix-mode interconnection architecture is proposed for constructing application specific networks on chip to minimize the total communication time. The proposed architecture uses a globally asynchronous communication network and a locally synchronous bus (or cross-bar or multistage interconnection network MIN). A complete graph is constructed such that each vertex represents an IP core or a set of IP cores connecting by a locally synchronous bus (or cross-bar or MIN) and each edge has a weight (profit) representing a communication ratio (CR) for each pair of vertices. A maximal-profit spanning tree is constructed to represent the final network on chip. Comparisons on cost and total communication times with the SPIN architecture, mesh architecture, and binary tree architecture using Huffman-coding-like algorithm show that the new methodology has better results

Published in:

Innovative Computing, Information and Control, 2006. ICICIC '06. First International Conference on  (Volume:2 )

Date of Conference:

Aug. 30 2006-Sept. 1 2006