Design machines: Algebraically well described interconnection networks |
| |
| Authors: | Thomas Beth Volker Hatz |
| |
| Institution: | (1) Institute of Algorithms and Cognitive Systems, Faculty of Computer Science, University of Karlsruhe, Am Fasangarten 5, W7500 Karlsruhe, Germany |
| |
| Abstract: | We present a method constructing efficient multiprocessor networks based on combinatorial designs and group theory. The principal idea is to combine 1-factorizations of complete graphs on each block of certain 2-designs, to obtain efficient networks with a short maximum distance between any pair of processors. Using a smart multiplexing technique derived from the 1-factorization of complete graphs we can circumvent the restrictive Moore bound for ( , d)-graphs. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
