Generalized ϒ networks

Aaron Harwood, Hong Shen

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


The ϒ topology[4] suggests many avenues of interesting network formulation due to its irregular distribution of node degree, namely its ability to provide (formula presented) average cost networks[2] with maximum degree Θ (log2 n) and modular scalability[3]. The ϒ network has proven difficult to transform into a regular network though. We present a general form of ϒ network based on powers of r ≥ 2 with diameter (formula presented) and average cost (formula presented) where n = rt ∈ ℝ and t ∈ ℕ with the tradeoff being increased maximum degree from 2t – 1 to 2rt – 2t – r + 1. For applications requiring bounded degree we provide a modified general ϒ construction with maximum degree 2r and diameter (formula presented) while maintaining the order of average cost at (formula presented). This results in a maximum cost of Θ (rt).

Original languageEnglish
Title of host publicationHigh Performance Computing - 2nd International Symposium, ISHPC 1999, Proceedings
EditorsKazuki Joe, Akira Fukuda, Constantine Polychronopoulos, Shinji Tomita
PublisherSpringer Verlag
Number of pages8
ISBN (Print)3540659692, 9783540659693
Publication statusPublished - 1999
Externally publishedYes
Event2nd International Symposium on High Performance Computing, ISHPC 1999 - Kyoto, Japan
Duration: 26 May 199928 May 1999

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference2nd International Symposium on High Performance Computing, ISHPC 1999


Dive into the research topics of 'Generalized ϒ networks'. Together they form a unique fingerprint.

Cite this