Reconfiguration Procedures for a Polymorphic and Partitionable Multiprocessor
IEEE Transactions on Computers
The Architecture of SM3: A Dynamically Partitionable Multicomputer System
IEEE Transactions on Computers
Switching and Finite Automata Theory: Computer Science Series
Switching and Finite Automata Theory: Computer Science Series
ISCA '84 Proceedings of the 11th annual international symposium on Computer architecture
Cube structures for multiprocessors
Communications of the ACM
Disjoint Task Allocation Algorithms for MIN Machines with Minimal Conflicts
IEEE Transactions on Parallel and Distributed Systems
Allocation and Mapping Based Reliability Analysis of Multistage Interconnection Networks
IEEE Transactions on Computers
IEEE Transactions on Computers
Partitionability of the Multistage Interconnection Networks
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
| Hi-index | 15.00 |
A resource-management mechanism is presented for a multiprocessor system consisting of a pool of homogeneous processing elements interconnected by multistage networks. The mechanism aims at making effective use of hardware resources of the multiprocessor system in support of high-performance parallel computations. It can create many physically independent subsystems simultaneously without incurring internal fragmentation,. Each subsystem can configure itself to form a desired topology for matching the structure of the parallel computation. The mechanism is distributed in nature; it is divided into three functionally disjoint procedures that can reside in different loci for handling various resource-management tasks concurrently. Simulation results show that, by eliminating internal fragmentation, the mechanism achieves better source utilization than a reference machine.