Performance of unbuffered shuffle-exchange networks
IEEE Transactions on Computers - The MIT Press scientific computation series
Finite State Model and Compatibility Theory: New Analysis Tools for Permutation Networks
IEEE Transactions on Computers
Best worst mappings for the omega network
IBM Journal of Research and Development
Towards a theory of software protection
Proceedings on Advances in cryptology---CRYPTO '86
Compact grid layouts of multi-level networks
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Tolerating communication latency through dynamic thread invocation in a multithreaded architecture
Compiler optimizations for scalable parallel systems
Memory-Intensive Benchmarks: IRAM vs. Cache-Based Machines
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
On Cost-Optimal Merge of Two Intransitive Sorted Sequences
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Load-Balanced Parallel Merge Sort on Distributed Memory Parallel Computers
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
A 2-D Parallel Convex Hull Algorithm with Optimal Communication Phases
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Optimizing Parallel Bitonic Sort
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
ClusterNet: An Object-Oriented Cluster Network
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Performance Driven Routing in Distributed Environment
IWDC '02 Proceedings of the 4th International Workshop on Distributed Computing, Mobile and Wireless Computing
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Partitioned Parallel Radix Sort
ISHPC '00 Proceedings of the Third International Symposium on High Performance Computing
Parallelizing Merge Sort onto Distributed Memory Parallel Computers
ISHPC '02 Proceedings of the 4th International Symposium on High Performance Computing
Efficient Computation of Recurrence Diameters
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
On the Predictive Quality of BSP-like Cost Functions for NOWs
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
The Design and Verification of a Sorter Core
CHARME '01 Proceedings of the 11th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
Bitonic Sorting on Bene Networks
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Particle-mesh techniques on the MasPar
FRONTIERS '96 Proceedings of the 6th Symposium on the Frontiers of Massively Parallel Computation
Performance Analysis of Multistage Interconnection Networks using a Multicast Algorithm
HPC-ASIA '97 Proceedings of the High-Performance Computing on the Information Superhighway, HPC-Asia '97
A journey into multicomputer routing algorithms
PAS '95 Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis
Performance Analysis of a Multicast Switch Based on Multistage Interconnection Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
A Pipelined Single-Bit Controlled Sorting Network with O(N log^2 N) Bit Complexity
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Self-Stabilizing Smoothing and Counting
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
PDM Sorting Algorithms That Take A Small Number of Passes
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Journal of Parallel and Distributed Computing - Special issue: 18th International parallel and distributed processing symposium
On the Rearrangeability of Reverse Shuffle/Exchange Networks
ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 01
On Sorting Multiple Bitonic Sequences
ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 01
An O(n3 (loglogn/logn)5/4) time algorithm for all pairs shortest paths
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Optimal Sorting Algorithms for Parallel Computers
IEEE Transactions on Computers
Parallel Processing with the Perfect Shuffle
IEEE Transactions on Computers
Parallel Algorithms to Set Up the Benes Permutation Network
IEEE Transactions on Computers
A Partitioning Approach to the Design of Selection Networks
IEEE Transactions on Computers
Broadcast Communications and Distributed Algorithms
IEEE Transactions on Computers
IEEE Transactions on Computers
Binary Trees and Parallel Scheduling Algorithms
IEEE Transactions on Computers
Notes on Shuffle/Exchange-Type Switching Networks
IEEE Transactions on Computers
VLSI Performance Comparison of Banyan and Crossbar Communications Networks
IEEE Transactions on Computers
Interconnections Between Processors and Memory Modules Using the Shuffle-Exchange Network
IEEE Transactions on Computers
The Burroughs Scientific Processor (BSP)
IEEE Transactions on Computers
A Self-Routing Benes Network and Parallel Permutation Algorithms
IEEE Transactions on Computers
Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees
IEEE Transactions on Computers
A Loop-Structured Switching Network
IEEE Transactions on Computers
MANIP A Multicomputer Architecture for Solving Combinatonal Extremum-Search Problems
IEEE Transactions on Computers
On the Complexity of Sorting in Magnetic Bubble Memory Systems
IEEE Transactions on Computers
Parallel Permutations of Data: A Benes Network Control Algorithm for Frequently Used Permutations
IEEE Transactions on Computers
IEEE Transactions on Computers
The Analysis and Design of Some New Sorting Machines
IEEE Transactions on Computers
Implementation of Permutation Functions in Illiac IV-Type Computers
IEEE Transactions on Computers
On a Class of Multistage Interconnection Networks
IEEE Transactions on Computers
Cellular Logic-in-Memory Arrays
IEEE Transactions on Computers
Optimality of a Two-Phase Strategy for Routing in Interconnection Networks
IEEE Transactions on Computers
IEEE Transactions on Computers
Searching, Merging, and Sorting in Parallel Computation
IEEE Transactions on Computers
Packet Switching Networks for Multiprocessors and Data Flow Computers
IEEE Transactions on Computers
IEEE Transactions on Computers
Access and Alignment of Data in an Array Processor
IEEE Transactions on Computers
The Parallel Enumeration Sorting Scheme for VLSI
IEEE Transactions on Computers
Generalized Connection Networks for Parallel Processor Intercommunication
IEEE Transactions on Computers
An Inverted File Processor for Information Retrieval
IEEE Transactions on Computers
Fast parallel GPU-sorting using a hybrid algorithm
Journal of Parallel and Distributed Computing
Inferring Min and Max Invariants Using Max-Plus Polyhedra
SAS '08 Proceedings of the 15th international symposium on Static Analysis
Programmable indexing networks
AFIPS '70 (Spring) Proceedings of the May 5-7, 1970, spring joint computer conference
Analysis of combinatory algorithms: a sample of current methodology
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
A systematic approach to the design of digital bussing structures
AFIPS '72 (Fall, part II) Proceedings of the December 5-7, 1972, fall joint computer conference, part II
Implementing Sorting Networks with Spiking Neural P Systems
Fundamenta Informaticae
A specialized architecture for textual information retrieval
AFIPS '77 Proceedings of the June 13-16, 1977, national computer conference
STARAN parallel processor system hardware
AFIPS '74 Proceedings of the May 6-10, 1974, national computer conference and exposition
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
The architecture of MANIP: a parallel computer system for solving NP-complete problems
AFIPS '81 Proceedings of the May 4-7, 1981, national computer conference
Parallel sorting machines: their speed and efficiency
AFIPS '81 Proceedings of the May 4-7, 1981, national computer conference
Parallel sort and join for high speed database machine operations
AFIPS '81 Proceedings of the May 4-7, 1981, national computer conference
Image understanding architectures
AFIPS '80 Proceedings of the May 19-22, 1980, national computer conference
Exploiting parallelism for the performance enhancement of non-numeric applications
AFIPS '82 Proceedings of the June 7-10, 1982, national computer conference
Optimal conclusive sets for comparator networks
Theoretical Computer Science
Towards Efficient Detection of Two-Dimensional Intersymbol Interference Channels
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
High-throughput low-complexity MIMO detector based on K-best algorithm
Proceedings of the 19th ACM Great Lakes symposium on VLSI
Parallel Algorithms for the Execution of Relational Database Operations Revisited On Grids
International Journal of High Performance Computing Applications
Universal Hard Interaction for Clockless Computation: Dem Glücklichen schlägt keine Stunde!
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Cardinality Networks and Their Applications
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Operator Language: A Program Generation Framework for Fast Kernels
DSL '09 Proceedings of the IFIP TC 2 Working Conference on Domain-Specific Languages
Improved layout of the odd-even sorting network
Computer Networks: The International Journal of Computer and Telecommunications Networking
A randomized, o(log w)-depth 2 smoothing network
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Accelerating certain outputs of merging and sorting networks
Theoretical Computer Science
An Efficient Parallel Sorting Algorithm on Metacube Multiprocessors
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
A hardware architecture for real-time video segmentation utilizing memory reduction techniques
IEEE Transactions on Circuits and Systems for Video Technology
Hybrid preservation of conditionally nonblocking switches under 2-stage interconnection
IEEE Transactions on Communications
Scheduling and routing of AMOs in an intelligent transport system
IEEE Transactions on Intelligent Transportation Systems
A versatile linear insertion sorter based on an FIFO scheme
Microelectronics Journal
IBM Journal of Research and Development
Evolving compare-exchange networks using grammars
Artificial Life
Sort vs. Hash revisited: fast join implementation on modern multi-core CPUs
Proceedings of the VLDB Endowment
Proceedings of the VLDB Endowment
Storage coding for wear leveling in flash memories
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Communication: A note on gray code and odd-even merge
Discrete Applied Mathematics
Communication-space efficient parallel Bitonic sorting on Symmetric Multiprocessors
ACST '08 Proceedings of the Fourth IASTED International Conference on Advances in Computer Science and Technology
A phenomenon in the theory of sorting
Journal of Computer and System Sciences
Paper: Bluestein's FFT for arbitrary N on the hypercube
Parallel Computing
Paper: Hybrid systolic sorters
Parallel Computing
Bureaucratic protocols for secure two-party sorting, selection, and permuting
ASIACCS '10 Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security
Optimal conclusive sets for comparator networks
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
ARC'07 Proceedings of the 3rd international conference on Reconfigurable computing: architectures, tools and applications
Simulating the bitonic sort using P systems
WMC'07 Proceedings of the 8th international conference on Membrane computing
Out-of-order issue logic using sorting networks
Proceedings of the 20th symposium on Great lakes symposium on VLSI
Algorithm and hardware complexity reduction techniques for k-best sphere decoders
Proceedings of the 20th symposium on Great lakes symposium on VLSI
Correcting sorted sequences in a single hop radio network
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Fast sort on CPUs and GPUs: a case for bandwidth oblivious SIMD sort
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Computer Methods and Programs in Biomedicine
Theoretical Computer Science
Hardware-Accelerated RNA Secondary-Structure Alignment
ACM Transactions on Reconfigurable Technology and Systems (TRETS)
Digit-Serial Pipeline Sorter Architecture
Journal of Signal Processing Systems
Parallel search on video cards
HotPar'09 Proceedings of the First USENIX conference on Hot topics in parallelism
Solving Pseudo-Boolean Modularity Constraints
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
High-throughput and area-efficient MIMO symbol detection based on modified Dijkstra's search
IEEE Transactions on Circuits and Systems Part I: Regular Papers
Distance makes the types grow stronger: a calculus for differential privacy
Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
Storage coding for wear leveling in flash memories
IEEE Transactions on Information Theory
A memory interface for multi-purpose multi-stream accelerators
CASES '10 Proceedings of the 2010 international conference on Compilers, architectures and synthesis for embedded systems
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Fast in-place sorting with CUDA based on bitonic sort
PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part I
Privacy-preserving multi-objective evolutionary algorithms
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part II
Automated tuning in parallel sorting on multi-core architectures
EuroPar'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part I
Feature extraction using reconfigurable hardware
ICCVG'10 Proceedings of the 2010 international conference on Computer vision and graphics: Part II
GPU-ABiSort: optimal parallel sorting on stream architectures
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Parallelism and Array Processing
IEEE Transactions on Computers
An Architecture for Bitonic Sorting with Optimal VLSI Performnance
IEEE Transactions on Computers
VLSI Sorting with Reduced Hardware
IEEE Transactions on Computers
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Block processing for rank order filtering using the rank order state machine architecture
ICASSP'93 Proceedings of the 1993 IEEE international conference on Acoustics, speech, and signal processing: plenary, special, audio, underwater acoustics, VLSI, neural networks - Volume I
Bitonic sort in shared SIMD array processor
Proceedings of the 2011 International Conference on Communication, Computing & Security
Proceedings of the 19th ACM/SIGDA international symposium on Field programmable gate arrays
The RLOC is dead - long live the RLOC
Proceedings of the 19th ACM/SIGDA international symposium on Field programmable gate arrays
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
Data broadcasting in SIMD computers
IEEE Transactions on Computers
Efficient sorting with CCD's and magnetic bubble memories
IEEE Transactions on Computers
The topology of cellular partitioning networks
IEEE Transactions on Computers
FPGA vs. multi-core CPUs vs. GPUs: hands-on experience with a sorting application
Facing the multicore-challenge
FPGA vs. multi-core CPUs vs. GPUs: hands-on experience with a sorting application
Facing the multicore-challenge
Perfectly secure oblivious RAM without random oracles
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Optimal base encodings for pseudo-boolean constraints
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
The round complexity of distributed sorting: extended abstract
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
TELE-INFO'11/MINO'11/SIP'11 Proceedings of the 10th WSEAS international conference on Telecommunications and informatics and microelectronics, nanoelectronics, optoelectronics, and WSEAS international conference on Signal processing
External memory breadth-first search with delayed duplicate detection on the GPU
MoChArt'10 Proceedings of the 6th international conference on Model checking and artificial intelligence
Geometry of synthesis iv: compiling affine recursion into static hardware
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
Exascale algorithms for generalized MPI_comm_split
EuroMPI'11 Proceedings of the 18th European MPI Users' Group conference on Recent advances in the message passing interface
Generic constant-round oblivious sorting algorithm for MPC
ProvSec'11 Proceedings of the 5th international conference on Provable security
A cost optimal parallel quicksorting and its implementation on a shared memory parallel computer
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
Expressive array constructs in an embedded GPU kernel programming language
DAMP '12 Proceedings of the 7th workshop on Declarative aspects and applications of multicore programming
Programmable data dependencies and placements
DAMP '12 Proceedings of the 7th workshop on Declarative aspects and applications of multicore programming
Merging and merge-sort in a single hop radio network
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
The VLDB Journal — The International Journal on Very Large Data Bases
Simplification of FEM-models on cell BE
MMCS'08 Proceedings of the 7th international conference on Mathematical Methods for Curves and Surfaces
A simple optimal randomized algorithm for sorting on the PDM
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
On the complexity of min-max sorting networks
Information Sciences: an International Journal
Sorting long sequences in a single hop radio network
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Massively parallel breadth first search using a tree-structured memory model
Proceedings of the 2012 International Workshop on Programming Models and Applications for Multicores and Manycores
OpenCL memory infrastructure for FPGAs (abstract only)
Proceedings of the ACM/SIGDA international symposium on Field Programmable Gate Arrays
Formalising bitonic sort in type theory
TYPES'04 Proceedings of the 2004 international conference on Types for Proofs and Programs
Private information retrieval using trusted hardware
ESORICS'06 Proceedings of the 11th European conference on Research in Computer Security
Parceling the butterfly and the batcher sorting network
Theoretical Computer Science
Aggregate gaze visualization with real-time heatmaps
Proceedings of the Symposium on Eye Tracking Research and Applications
Hiding circuit topology from unbounded reverse engineers
ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy
Rigorous system design: the BIP approach
MEMICS'11 Proceedings of the 7th international conference on Mathematical and Engineering Methods in Computer Science
Secure computation, i/o-efficient algorithms and distributed signatures
CT-RSA'12 Proceedings of the 12th conference on Topics in Cryptology
Formal engineering of the bitonic sort using PVS
IW-FM'98 Proceedings of the 2nd Irish conference on Formal Methods
Computer generation of streaming sorting networks
Proceedings of the 49th Annual Design Automation Conference
A high-performance sorting algorithm for multicore single-instruction multiple-data processors
Software—Practice & Experience
Overview: Switching structures for ATM
Computer Communications
Fast knockout algorithm for self-route concentration
Computer Communications
Area-Efficient Antenna-Scalable MIMO Detector for K-best Sphere Decoding
Journal of Signal Processing Systems
Efficient filters for the simulated evolution of small sorting networks
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Sorting on GPUs for large scale datasets: A thorough comparison
Information Processing and Management: an International Journal
Simplification and streaming of GIS terrain for web clients
Proceedings of the 17th International Conference on 3D Web Technology
Universal Hard Interaction for Clockless Computation: Dem Glücklichen schlägt keine Stunde!
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Eden --- parallel functional programming with haskell
CEFP'11 Proceedings of the 4th Summer School conference on Central European Functional Programming School
Feldspar: application and implementation
CEFP'11 Proceedings of the 4th Summer School conference on Central European Functional Programming School
An Improved Boolean Circuit for Maximum Matching in a Convex Bipartite Graph
Fundamenta Informaticae - Workshop on Combinatorial Algorithms
Implementing Sorting Networks with Spiking Neural P Systems
Fundamenta Informaticae
Softshell: dynamic scheduling on GPUs
ACM Transactions on Graphics (TOG) - Proceedings of ACM SIGGRAPH Asia 2012
An O(n3 log log n/ log2 n) time algorithm for all pairs shortest paths
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
On Different Models for Packet Flow in Multistage Interconnection Networks
Fundamenta Informaticae
Reliable Minimum Finding Comparator Networks
Fundamenta Informaticae
Towards autotuning by alternating communication methods
ACM SIGMETRICS Performance Evaluation Review
Dense geometric flow visualization
EUROVIS'05 Proceedings of the Seventh Joint Eurographics / IEEE VGTC conference on Visualization
Parallel database sort and join operations revisited on grids
HPCC'07 Proceedings of the Third international conference on High Performance Computing and Communications
An optimal parallel prefix-sums algorithm on the memory machine models for GPUs
ICA3PP'12 Proceedings of the 12th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I
Private and oblivious set and multiset operations
Proceedings of the 7th ACM Symposium on Information, Computer and Communications Security
GPU local triangulation: an interpolating surface reconstruction algorithm
EuroVis'08 Proceedings of the 10th Joint Eurographics / IEEE - VGTC conference on Visualization
Raycasting of light field galleries from volumetric data
EuroVis'08 Proceedings of the 10th Joint Eurographics / IEEE - VGTC conference on Visualization
Constrained clustering using SAT
IDA'12 Proceedings of the 11th international conference on Advances in Intelligent Data Analysis
Compiling finite domain constraints to sat with bee*
Theory and Practice of Logic Programming
Distributed oblivious RAM for secure two-party computation
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Practically efficient multi-party sorting protocols from comparison sort algorithms
ICISC'12 Proceedings of the 15th international conference on Information Security and Cryptology
Efficient SAT-based dynamic compaction and relaxation for longest sensitizable paths
Proceedings of the Conference on Design, Automation and Test in Europe
Using symmetry and evolutionary search to minimize sorting networks
The Journal of Machine Learning Research
Journal of Electronic Testing: Theory and Applications
Boolean equi-propagation for concise and efficient SAT encodings of combinatorial problems
Journal of Artificial Intelligence Research
Privacy-preserving matrix factorization
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Sparse suffix tree construction in small space
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
McBits: fast constant-time code-based cryptography
CHES'13 Proceedings of the 15th international conference on Cryptographic Hardware and Embedded Systems
Register level sort algorithm on multi-core SIMD processors
IA^3 '13 Proceedings of the 3rd Workshop on Irregular Applications: Architectures and Algorithms
The route to success: a performance comparison of diagnosis algorithms
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
An object-oriented parallel programming language for distributed-memory parallel computing platforms
Science of Computer Programming
Bitonic sort on a chained-cubic tree interconnection network
Journal of Parallel and Distributed Computing
A Randomized Parallel Three-Dimensional Convex Hull Algorithm for Coarse-Grained Multicomputers
Theory of Computing Systems
On Probabilistic Networks for Selection, Merging, and Sorting
Theory of Computing Systems
| Hi-index | 0.18 |
To achieve high throughput rates today's computers perform several operations simultaneously. Not only are I/O operations performed concurrently with computing, but also, in multiprocessors, several computing operations are done concurrently. A major problem in the design of such a computing system is the connecting together of the various parts of the system (the I/O devices, memories, processing units, etc.) in such a way that all the required data transfers can be accommodated. One common scheme is a high-speed bus which is time-shared by the various parts; speed of available hardware limits this scheme. Another scheme is a cross-bar switch or matrix; limiting factors here are the amount of hardware (an m × n matrix requires m × n cross-points) and the fan-in and fan-out of the hardware.