Details

Autor(en) / Beteiligte

• Du, Ding-Zhu
• Hwang, F. K.
• Odlyzko, A. M.
• Zhang, Yanjung

Titel

Minimal-distance routing for KYKLOS II

Ist Teil von

• Networks, 1994-03, Vol.24 (2), p.103-108

Ort / Verlag

New York: Wiley Subscription Services, Inc., A Wiley Company

Erscheinungsjahr

1994

Quelle

Alma/SFX Local Collection

Beschreibungen/Notizen

• We propose a new routing strategy for the KYKLOS II multiprocessor interconnection network that achieves minimum distance for the path between any two processors. For KYKLOS II with 2n processors, the average distance is shorter than those of previous routing strategies by approximately 2 log2n. The traffic density, a measure of traffic concentration, is better than previous strategies for up to 2000 processors, though asymptotically inferior to a strategy proposed by Jenevein and Menezes. © 1994 by John Wiley & Sons, Inc.