@inproceedings{ffd98afa1c5941b8aaef8d64a5e0b931,
title = "MINIMAL-DISTANCE ROUTING FOR KYKLOS II.",
abstract = "A routing strategy is proposed 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 2log//2n. The traffic density, a measure of traffic concentration, is better than previous strategies for up to 2000 processors.",
author = "Du, \{D. Z.\} and Hwang, \{F. K.\} and Odlyzko, \{A. M.\} and Zhang, \{Y. J.\}",
year = "1987",
language = "English (US)",
isbn = "0271006080",
series = "Proceedings of the International Conference on Parallel Processing",
publisher = "Pennsylvania State Univ Press",
pages = "546--549",
editor = "Sahni, \{Sartaj K.\}",
booktitle = "Proceedings of the International Conference on Parallel Processing",
note = "Proc Int Conf Parallel Process 1987 ; Conference date: 17-08-1987 Through 21-08-1987",
}