Finite State Model and Compatibility Theory: New Analysis Tools for Permutation Networks
IEEE Transactions on Computers
Rearrangeability of multistage shuffle/exchange networks
ISCA '87 Proceedings of the 14th annual international symposium on Computer architecture
Programming cellular permutation networks through decomposition of symmetric groups
IEEE Transactions on Computers
A Partitioning Strategy for Nonuniform Problems on Multiprocessors
IEEE Transactions on Computers
A New Benes Network Control Algorithm
IEEE Transactions on Computers
APL '90 Conference proceedings on APL 90: for the future
Efficient routing techniques for cooperating processors in dataflow computers
CSC '90 Proceedings of the 1990 ACM annual conference on Cooperation
Universal multistage networks via linear permutations
Proceedings of the 1991 ACM/IEEE conference on Supercomputing
On Self-Routing in Benes and Shuffle-Exchange Networks
IEEE Transactions on Computers
Methods for message routing in parallel machines
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Layered cross product—a technique to construct interconnection networks
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Universality of iterated networks
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
On a Class of Rearrangeable Networks
IEEE Transactions on Computers
Fast Self-Routing Permutation Switching on an Asymptotically Minimum Cost Network
IEEE Transactions on Computers
An analysis model on nonblocking multirate broadcast networks
ICS '94 Proceedings of the 8th international conference on Supercomputing
New Self-Routing Permutation Networks
IEEE Transactions on Computers
A Fast Parallel Algorithm for Routing Unicast Assignments in Benes Networks
IEEE Transactions on Parallel and Distributed Systems
Deterministic on-line routing on area-universal networks
Journal of the ACM (JACM)
Optimal trade-offs between size and slowdown for universal parallel networks
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
On the benefit of supporting virtual channels in wormhole routers
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
The Design of an Optoelectronic Arithmetic Processor Based on Permutation Networks
IEEE Transactions on Computers
Work-preserving emulations of fixed-connection networks
Journal of the ACM (JACM)
Randomized protocols for low-congestion circuit routing in multistage interconnection networks
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Banyan networks for partitioning multiprocessor systems
25 years of the international symposia on Computer architecture (selected papers)
Some compact layouts of the butterfly
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Work-Efficient Routing Algorithms for Rearrangeable Symmetrical Networks
IEEE Transactions on Parallel and Distributed Systems
Improved bounds for all optical routing
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Permutation Realizability and Fault Tolerance Property of the Inside-Out Routing Algorithm
IEEE Transactions on Parallel and Distributed Systems
Shifting Graphs and Their Applications
Journal of the ACM (JACM)
An optimal routing algorithm for mesh-connected Parallel computers
Journal of the ACM (JACM)
An Efficient General-Purpose Parallel Computer
Journal of the ACM (JACM)
Complexity Results for Permuting Data and Other Computations on Parallel Processors
Journal of the ACM (JACM)
A new approach to fast control of r2× r2 3-stage benes networks of r×r crossbar switches
ISCA '90 Proceedings of the 17th annual international symposium on Computer Architecture
Linear-time algorithms for programming cellular permutation arrays
CSC '86 Proceedings of the 1986 ACM fourteenth annual conference on Computer science
New algorithms for realizing paths and permutations through cube-connected networks
CSC '86 Proceedings of the 1986 ACM fourteenth annual conference on Computer science
Performing Permutations on Interconnection Networks by Regularly Changing Switch States
IEEE Transactions on Parallel and Distributed Systems
Classification Categories and Historical Development of Circuit Switching Topologies
ACM Computing Surveys (CSUR)
ACM Transactions on Programming Languages and Systems (TOPLAS)
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
A Benes-Like Theorem for the Shuffle-Exchange Graph
IEEE Transactions on Computers
Broadcast Ring Sandwich Networks
IEEE Transactions on Computers
Routing a Permutation in the Hypercube by Two Sets of Edge-Disjoint Paths
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
A "Single-Box" Re-routing Architecture for a 3-Stage Rearrangeable CLOS Interconnection Networks
PARA '02 Proceedings of the 6th International Conference on Applied Parallel Computing Advanced Scientific Computing
Fast Encryption Algorithm Spectr-H64
MMM-ACNS '01 Proceedings of the International Workshop on Information Assurance in Computer Networks: Methods, Models, and Architectures for Network Security
Controlled Operations as a Cryptographic Primitive
MMM-ACNS '01 Proceedings of the International Workshop on Information Assurance in Computer Networks: Methods, Models, and Architectures for Network Security
On Nonblocking Properties on the Benes Network
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Efficient Mental Card Shuffling via Optimised Arbitrary-Sized Benes Permutation Network
ISC '02 Proceedings of the 5th International Conference on Information Security
Remarks on Mix-Network Based on Permutation Networks
PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Performing BMMC Permutations in Two Passes through the Expanded Delta Network and MasPar MP-2
FRONTIERS '96 Proceedings of the 6th Symposium on the Frontiers of Massively Parallel Computation
Path building in cellular partitioning networks
ISCA '80 Proceedings of the 7th annual symposium on Computer Architecture
ISCA '80 Proceedings of the 7th annual symposium on Computer Architecture
An efficient general purpose parallel computer
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Universal circuits (Preliminary Report)
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
The realization of monotone Boolean functions (Preliminary Version)
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
On non-linear lower bounds in computational complexity
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Banyan networks for partitioning multiprocessor systems
ISCA '73 Proceedings of the 1st annual symposium on Computer architecture
Diagnostic And Computational Reconfiguration In Multiprocessor Systems
ACM '78 Proceedings of the 1978 annual conference
A journey into multicomputer routing algorithms
PAS '95 Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis
Resource requirements for field programmable interconnection chips
VLSID '95 Proceedings of the 8th International Conference on VLSI Design
Efficient Protocols for Permutation Routing on All-Optical Multistage Interconnection Networks
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
On the Bisection Width and Expansion of Butterfly Networks
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Proceedings of the 11th ACM conference on Computer and communications security
The KR-Benes Network: A Control-Optimal Rearrangeable Permutation Network
IEEE Transactions on Computers
Protecting Client Privacy with Trusted Computing at the Server
IEEE Security and Privacy
SODA: A Low-power Architecture For Software Radio
Proceedings of the 33rd annual international symposium on Computer Architecture
On noninterruptive rearrangeable networks
IEEE/ACM Transactions on Networking (TON)
Parallel Algorithms to Set Up the Benes Permutation Network
IEEE Transactions on Computers
VLSI Performance Comparison of Banyan and Crossbar Communications Networks
IEEE Transactions on Computers
IEEE Transactions on Computers
A Self-Routing Benes Network and Parallel Permutation Algorithms
IEEE Transactions on Computers
Time-Space Tradeoffs on Back-to-Back FFT Algorithms
IEEE Transactions on Computers
Parallel Permutations of Data: A Benes Network Control Algorithm for Frequently Used Permutations
IEEE Transactions on Computers
Interconnection Networks from Three State Cells
IEEE Transactions on Computers
Cellular Logic-in-Memory Arrays
IEEE Transactions on Computers
IEEE Transactions on Computers
Access and Alignment of Data in an Array Processor
IEEE Transactions on Computers
Generalized Connection Networks for Parallel Processor Intercommunication
IEEE Transactions on Computers
Improved Garbled Circuit: Free XOR Gates and Applications
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
A Practical Universal Circuit Construction and Secure Evaluation of Private Functions
Financial Cryptography and Data Security
A study of the data commutation problems in a self-repairable multiprocessor
AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference
Programmable indexing networks
AFIPS '70 (Spring) Proceedings of the May 5-7, 1970, spring joint computer conference
TYMNET: a terminal oriented communication network
AFIPS '71 (Spring) Proceedings of the May 18-20, 1971, spring joint computer conference
Interconnection networks: a survey and assessment
AFIPS '74 Proceedings of the May 6-10, 1974, national computer conference and exposition
An economical construction for sorting networks
AFIPS '74 Proceedings of the May 6-10, 1974, national computer conference and exposition
Permuting streaming data using RAMs
Journal of the ACM (JACM)
Information Security and Cryptology --- ICISC 2008
Decomposition of Permutation Networks
IEEE Transactions on Computers
On rearrangeability of tandem connection of banyan-type networks
IEEE Transactions on Communications
On the use of interconnection networks in cryptography
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
A length-flexible threshold cryptosystem with applications
ACISP'03 Proceedings of the 8th Australasian conference on Information security and privacy
Automatic generation of streaming datapaths for arbitrary fixed permutations
Proceedings of the Conference on Design, Automation and Test in Europe
The transposition median problem is NP-complete
Theoretical Computer Science
A theory of decomposition into prime factors of layered interconnection networks
Discrete Applied Mathematics
A fast parallel algorithm for routing in permutation networks
IEEE Transactions on Computers
Kronecker products and shuffle algebra
IEEE Transactions on Computers
The topology of cellular partitioning networks
IEEE Transactions on Computers
An architecture-independent instruction shuffler to protect against side-channel attacks
ACM Transactions on Architecture and Code Optimization (TACO) - HIPEAC Papers
Private information retrieval using trusted hardware
ESORICS'06 Proceedings of the 11th European conference on Research in Computer Security
Perfectly secure multiparty computation and the computational overhead of cryptography
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Fully homomorphic encryption with polylog overhead
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Efficiently shuffling in public
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Is your permutation algorithm unbiased for n ≠ 2m?
PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part I
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks
Theory of Computing Systems
| Hi-index | 0.10 |
In this paper the construction of a switching network capable of n!-permutation of its n input terminals to its n output terminals is described. The building blocks for this network are binary cells capable of permuting their two input terminals to their two output terminals.The number of cells used by the network is n · log2 n - n + 1 = ∑n k=1 2 k. It could be argued that for such a network this number of cells is a lower bound, by noting that binary decision trees in the network can resolve individual terminal assignments only and not the partitioning of the permutation set itself which requires only 2 n! = n k=1 log2 k binary decisions.An algorithm is also given for the setting of the binary cells in the network according to any specified permutation.