Minimal‐distance routing for KYKLOS II | Zendy

Du DingZhu | Zendy; Hwang F. K. | Zendy; Odlyzko A. M. | Zendy; Zhang Yanjung | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

Minimal‐distance routing for KYKLOS II

Author(s) -

Du DingZhu,

Hwang F. K.,

Odlyzko A. M.,

Zhang Yanjung

Publication year - 1994

Publication title -

networks

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.977

H-Index - 64

eISSN - 1097-0037

pISSN - 0028-3045

DOI - 10.1002/net.3230240207

Subject(s) - routing (electronic design automation) , multiprocessing , interconnection , computer science , path (computing) , measure (data warehouse) , heavy traffic , parallel computing , combinatorics , mathematics , computer network , engineering , transport engineering , database

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 2 n processors, the average distance is shorter than those of previous routing strategies by approximately 2 log 2 n . 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.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research