Nonblocking Hypercube Architectures And Routing Algorithms For Multiprocessor Systems

다중프로세서 시스템을 위한 블로킹 없는 하이퍼큐브 구조와 루팅 알고리즘

In this paper, we develop enhanced hypercube architectures and routing algorithms to realize arbitrary permutations in circuit switching. We prove that a hypercube is rearrangeable if one additional pair of links (one full-duplex communication line) is provided in only one dimesion of connections. We also prove that if each connection between two neighboring nodes consists of two pairs of links, the hypercube can handle two independent permutations simultaneously.