MINIMAL-DISTANCE ROUTING FOR KYKLOS II.

D. Z. Du, F. K. Hwang, A. M. Odlyzko, Y. J. Zhang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationProceedings of the International Conference on Parallel Processing
EditorsSartaj K. Sahni
PublisherPennsylvania State Univ Press
Pages546-549
Number of pages4
ISBN (Print)0271006080
StatePublished - Dec 1 1987
EventProc Int Conf Parallel Process 1987 - Universal Park, PA, USA
Duration: Aug 17 1987Aug 21 1987

Publication series

NameProceedings of the International Conference on Parallel Processing
ISSN (Print)0190-3918

Other

OtherProc Int Conf Parallel Process 1987
CityUniversal Park, PA, USA
Period8/17/878/21/87

Fingerprint Dive into the research topics of 'MINIMAL-DISTANCE ROUTING FOR KYKLOS II.'. Together they form a unique fingerprint.

Cite this