Skip Navigation

The Computer Journal 1998 41(1):52-56; doi:10.1093/comjnl/41.1.52
© 1998 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Kwai, D.-M.
Right arrow Articles by Parhami, B.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Tight Bounds on the Diameter of Gaussian Cubes

D.-M. Kwai and B. Parhami

Department of Electrical and Computer Engineering, University of California, Santa Barbara, CA 93106-9560, USA Email: parhami{at}ece.ucsb.edu

Gaussian cubes are derived by removing links from a hypercube in a periodic fashion. By varying the partition parameter, one can obtain networks with different characteristics, while maintaining a basic framework for computation and communication. Unfortunately, such networks are in general not regular, making it difficult to derive their topological properties explicitly. In this paper, we study the diameter of Gaussian cubes and show the trade-off between cost and performance.


Received February 2, 1997. revised November 20, 1997.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.