A method of batching conflict routings in shuffle-exchange networks

Authors:
Yi-Hao Zhang;Yue-Hong Shen;Min Dong;Yi-Min Jiang
Affiliations:
Institute of Communication Engineering, PLA University of Science and Technology, Nanjing 210007, China and Institute of Command Automation, PLA University of Science and Technology, Nanjing 21000 ...;Institute of Communication Engineering, PLA University of Science and Technology, Nanjing 210007, China;Institute of Communication Engineering, PLA University of Science and Technology, Nanjing 210007, China;78046 PLA Troops, Chengdu 610011, China
Venue:
Theoretical Computer Science
Year:
2014

Citing 8
Cited 0

Interpolation between bases and the shuffle exchange network

European Journal of Combinatorics
Banyan networks for partitioning multiprocessor systems

ISCA '73 Proceedings of the 1st annual symposium on Computer architecture
Parallel Processing with the Perfect Shuffle

IEEE Transactions on Computers
Access and Alignment of Data in an Array Processor

IEEE Transactions on Computers
The Shuffle-Exchange Mesh Topology for 3D NoCs

ISPAN '08 Proceedings of the The International Symposium on Parallel Architectures, Algorithms, and Networks
All-to-All Personalized Exchange Algorithms in Generalized Shuffle-Exchange Networks

ICN '09 Proceedings of the 2009 Eighth International Conference on Networks
The Parallelization Design of Chaotic Encryption System Based on Mulit-level Shuffle-Exchange Network

IIH-MSP '09 Proceedings of the 2009 Fifth International Conference on Intelligent Information Hiding and Multimedia Signal Processing
From parallelism levels to a multi-ASIP architecture for turbo decoding

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

Quantified Score

Hi-index	5.23

Visualization

Abstract

In order to resolve the problem of separating conflict routings in shuffle-exchange networks, we define the concepts of the maximal no-conflict routing group and the least no-conflict routing grouping (LNCRG), as well as an associated eigenfunction and covering function. Based on these concepts, we propose a theoretical and practical method of computing the LNCRG using Boolean algebra. In addition, an algorithm for approximately computing the LNCRG is put forward to improve the efficiency of batching routings. Our theoretical analysis and experiments show that the time efficiency and accuracy of the algorithm are excellent. The proposed method provides strong support for the batching of routing policies in large-scale information exchanges.