By Topic

Graph-theoretic techniques for computer intraconnection minimization

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)
Carothers, J.D. ; Dept. of Electr. & Comput. Eng., Arizona Univ., Tucson, AZ, USA ; Cragon, H.G.

The design and minimization of computer intraconnections have a great influence on system characteristics such as cost, performance, failure rate, and in the case of VLSI, chip area. The problem addressed was the minimization of computer intraconnections with bandwidth and delay constraints imposed. This research problem has been formally defined as a graph theory problem. An heuristic algorithm, H-RASP2, is presented which approximates a minimal solution for this NP-complete problem in polynomial time. H-RASP2 was tested using a variety of graph sizes and fill's. Analysis of the results shows that for the test cases H-RASP2 provides an excellent approximation to a minimal solution

Published in:

Systems, Man and Cybernetics, IEEE Transactions on  (Volume:23 ,  Issue: 3 )