Banyan networks for partitioning multiprocessor systems
ISCA '73 Proceedings of the 1st annual symposium on Computer architecture
Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)
Graph theory: An algorithmic approach (Computer science and applied mathematics)
Graph theory: An algorithmic approach (Computer science and applied mathematics)
Performance Evaluation of Nonrectangular Multistage Interconnection Networks
IEEE Transactions on Computers
Partitioning and Permuting Properties of CC-Banyan Networks
IEEE Transactions on Computers
Comparative performance of circuit-switched networks based on blocking probability
Proceedings of the 1989 ACM/IEEE conference on Supercomputing
CSC '90 Proceedings of the 1990 ACM annual conference on Cooperation
Disjoint Task Allocation Algorithms for MIN Machines with Minimal Conflicts
IEEE Transactions on Parallel and Distributed Systems
A Distributed Management Scheme for Partitionable Parallel Computers
IEEE Transactions on Parallel and Distributed Systems
Reconfiguration with Time Division Multiplexed MIN's for Multiprocessor Communications
IEEE Transactions on Parallel and Distributed Systems
Resource allocation in rectangular CC-banyans
ISCA '83 Proceedings of the 10th annual international symposium on Computer architecture
A control processor for a reconfigurable array computer
ISCA '82 Proceedings of the 9th annual symposium on Computer Architecture
VLSI based design principles for MIMD multiprocessor computers with distributed memory management
ISCA '84 Proceedings of the 11th annual international symposium on Computer architecture
| Hi-index | 0.01 |
This paper presents an algorithm for the formation of configurations connecting processors to memory and I/O devices on rectangular SW banyan networks with equivalent processor resources as the base nodes and equivalent memory and I/O resources as the apex nodes. Given a set of resource configuration requests, the algorithm always finds a partition of the network that meets the requests in space and time complexity linear with respect to the number of resources in the network.