Rearrangeable Circuit-Switched Hypercube Architectures for Routing Permutations

✍ Scribed by S.B. Choi; A.K. Somani

• Publisher: Elsevier Science
• Year: 1993
• Tongue: English
• Weight: 496 KB
• Volume: 19
• Category: Article
• ISSN: 0743-7315
• DOI: 10.1006/jpdc.1993.1097

✦ Synopsis

Rearrangeable hypercube architectures and routing algorithms are developed to realize arbitrary permutations in circuit switching. We prove that if each connection between two neighboring nodes consists of two pairs of links (two full-duplex communication lines), the hypercube can handle two arbitrary permutations simultaneously. We also prove that a hypercube is rearrangeable if one additional pair of links is provided in any one dimension of connections. 1993 Academic Press. Inc.