IEEE.org| IEEE Xplore Digital Library| IEEE Standards| IEEE Spectrum| More Sites

Cart (Loading....) | Create Account | 

Close category search window
Author Searchbeta |  Advanced Search  |  Preferences |  Search Tips  |  More Search Options  
 
Browse Conference Publications > Massively Parallel Computing ... Help

Problems on routing bounded distance assignments in hypercubes

Full Text Sign-In or Purchase

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)
Bagherzadeh, N. ; Dept. of Electr. & Comput. Eng., California Univ., Irvine, CA, USA ; Dowd, M.

The problem of whether an assignment in the hypercube Hn, where the distance from the source to the destination is bounded, can be routed with minimum distance and bounded congestion is considered. It is shown that this is so, if assignments of given “type” can be so routed. Of particular interest is whether for distance 3 and fixed type, minimum distance and congestion 1 can be obtained. This is shown for n⩽6; on the other hand the method suggests possible counter examples. Also, it is shown that distance 2 permutations in H4 have congestion 1 routings

Published in:
Massively Parallel Computing Systems, 1994., Proceedings of the First International Conference on

Date of Conference: 2-6 May 1994

Page(s):
126 - 131
Meeting Date :
02 May 1994-06 May 1994
Print ISBN:
0-8186-6322-7
INSPEC Accession Number:
4847677
Conference Location :
Ischia
Digital Object Identifier :
10.1109/MPCS.1994.367085
Product Type:
Conference Publications

IEEE Account

Purchase Details

Profile Information

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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.