Data structures and network algorithms
Data structures and network algorithms
An Invitation to the World of PAX
Computer
Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
The architecture and programming of the Ametek series 2010 multicomputer
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Warp: an integrated solution of high-speed parallel computing
Proceedings of the 1988 ACM/IEEE conference on Supercomputing
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
PAX Computer; High-Speed Parallel Processing and Scientific Computing
PAX Computer; High-Speed Parallel Processing and Scientific Computing
Combinatorial Algorithms
A large scale, homogeneous, fully distributed parallel machine, I
ISCA '77 Proceedings of the 4th annual symposium on Computer architecture
Circuit-switched multicomputers and heuristic load placement
Circuit-switched multicomputers and heuristic load placement
Assignment and Scheduling Communicating Periodic Tasks in Distributed Real-Time Systems
IEEE Transactions on Software Engineering
IEEE Transactions on Computers
The Journal of Supercomputing
Optimizing Computing Costs Using Divisible Load Analysis
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
In multicomputers that utilize circuit switching or wormhole routing, communicationoverhead depends largely on link contention-the variation due to distance between nodesis negligible. This has a major impact on the load balancing problem. In this case there are some nodes with an excess load (sources) and other with a deficit load (sinks). Amatching of sources to sinks is required to avoid contention. The problem is madecomplex by the hardwired routing on currently available machines: The user can controlonly which nodes communicate but not how the messages are routed. Network flowmodels of message flow in the mesh and the hypercube have been developed to solvethis problem. The crucial property of these models is the correspondence betweenminimum cost flows and correctly routed messages. To solve a given load balancingproblem, a minimum cost flow algorithm is applied to the network. This permits theefficient determination of a maximum contention free matching of sources to sinks that, in turn, tells how much of the given imbalance can be eliminated without contention.