A network flow model for load balancing in circuit-switched multicomputers
- Univ. of Engineering and Technology, Lahore (Pakistan)
In multicomputers that utilize circuit switching or wormhole routing, communication overhead depends largely on link contention - the variation due to distance between nodes is negligible. This has a major impact on the load balancing problem. In this case, there are some nodes with excess load (sources) and others with deficit load (sinks) and it is required to find a matching of sources to sinks that avoids contention. The problem is made complex by the hardwired routing on currently available machines: the user can control only which nodes communicate but not how the messages are routed. Network flow models of message flow in the mesh and the hypercube were developed to solve this problem. The crucial property of these models is the correspondence between minimum cost flows and correctly routed messages. To solve a given load balancing problem, a minimum cost flow algorithm is applied to the network. This permits one to determine efficiently a maximum contention free matching of sources to sinks which, in turn, tells one how much of the given imbalance can be eliminated without contention. 21 refs.
- Research Organization:
- NASA Langley Research Center, Hampton, VA (United States)
- OSTI ID:
- 5542041
- Journal Information:
- IEEE Transactions on Parallel and Distributed Systems (Institute of Electrical and Electronics Engineers); (United States), Vol. 4:6; ISSN 1045-9219
- Country of Publication:
- United States
- Language:
- English
Similar Records
Depth-first search approach for fault-tolerant routing in hypercube multicomputers
Simulation study of a parallel processor with unbalanced loads. Master's thesis