Previous 1 2 [3] [4] [5] [6] [7] [8]

Journal of Inforamtion Science and Engineering, Vol.7 No.1, pp.1-12 (March 1991)
Rearrangeability of Cascaded Delta Networks

Nian-Shing Chen, Shing-Tsaan Huang and Kung-Chung Hsieh
Institute of Computer Science
National Tsing-Hua University
Hsinchu, Taiwan 30043, Republic of China

This paper proposes a new class of rearrangeable networks, called cascaded delta networks. Due to the more generalized link pattern, delta networks are regarded as generalized MINs, which cover most MINs proposed in the literature, such as the omega network, base-line network, flip network, indirect-binary-cube network, regular SW-banyan, and so on. A cascaded delta network is a concatenation of a reduced-delta network and an inverse delta network. We show the rearrangeability of the new networks and provide a control setting algorithm for the networks.

        The major distinctive point for the new networks is that they do not necessarily have shuffle-type link patterns, the buddy property, or the stack property as previously known rearrangeable networks have. This makes the new networks more general than previous ones.

Keywords: cascaded delta networks, delta networks, multi-stage interconnection networks (MIN), rearrangeability, shuffle exchange

Received March 10, 1990; revised June 15, 1990.
Communicated by Ferng-Ching Lin.