By Topic

Embedding meshes on the star graph

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)
Ranka, S. ; Sch. of Comput. & Inf. Sci., Syracuse Univ., NY, USA ; Wang, J. ; Yeh, N.

Algorithms for mapping n-dimensional meshes on a star graph of degree n with expansion 1 and dilation 3 are developed. It is shown that an n-degree star graph can efficiently simulate an n-dimensional mesh. The analysis indicates that the algorithms developed for uniform meshes may not be efficiently simulated on the star graph

Published in:

Supercomputing '90., Proceedings of

Date of Conference:

12-16 Nov 1990