Partitioning job structures for SW-Banyan networks
Large multiprocessor systems interconnected by multistage SW-Banyan networks may suffer from communication blockage if resources are not adequately allocated to processes within jobs. This communication blockage can quickly lead to performance degradation. Given a set of job structures, the problem is to map these structures on to the network in such a way that the amount of communication blockage induced by the mappings is held to a minimum. In general, this problem is very hard, bearing resemblance to the graph isomorphism problem. It has been solved for certain structure types. The author describes one general purpose mapping method that is suitable for structures that can be partitioned in a particular manner. The structures are mapped onto regular SW-Banyans in such a way that no communication blockage can occur. 11 references.
- OSTI ID:
- 5364271
- Country of Publication:
- United States
- Language:
- English
Similar Records
B-banyan and B-delta networks for multiprocessor systems
Resource allocation in rectangular CC-Banyans