Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
Performance results of the simplex algorithm for a set of real-world linear programming models
Communications of the ACM
The Gamma network: A multiprocessor interconnection network with redundant paths
ISCA '82 Proceedings of the 9th annual symposium on Computer Architecture
Throughput analysis and configuration design of a shared-resource multiprocessor system: PUMPS
ISCA '81 Proceedings of the 8th annual symposium on Computer Architecture
Banyan networks for partitioning multiprocessor systems
ISCA '73 Proceedings of the 1st annual symposium on Computer architecture
Performance analysis of circuit switching, baseline interconnection networks
ISCA '84 Proceedings of the 11th annual international symposium on Computer architecture
Resource allocation in computer networks (scheduling, csma/cd, multiple buses, interconnection)
Resource allocation in computer networks (scheduling, csma/cd, multiple buses, interconnection)
Graph Theory With Applications
Graph Theory With Applications
| Hi-index | 14.98 |
Circuit-switched interconnection networks for resource sharing in multiprocessors are studied. Resource scheduling in systems with such an interconnection network entails the efficient search for a mapping from requesting processors to free resources such that circuit blockages in the network are minimized and resources are maximally used. The optimal mapping is obtained by transforming the scheduling problems into various network flow problems to which existing algorithms can be applied. A distributed architecture to realize a maximum flow algorithm using token propagations is described. The method is applicable to any general loop-free network configuration in which the requesting processors and free resources can be partitioned into two disjoint subsets.