Guide to parallel programming on Sequent computer systems: 2nd edition
Guide to parallel programming on Sequent computer systems: 2nd edition
A survey of dynamic network flows
Annals of Operations Research
A modeling/solution approach for optimal deployment of a weapons arsenal
Annals of Operations Research
Linear network optimization: algorithms and codes
Linear network optimization: algorithms and codes
Network programming
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Pivot Strategies for Primal-Simplex Network Codes
Journal of the ACM (JACM)
Monitors: an operating system structuring concept
Communications of the ACM
Network Models in Optimization and Their Applications in Practice
Network Models in Optimization and Their Applications in Practice
Algorithms for Network Programming
Algorithms for Network Programming
| Hi-index | 0.00 |
This paper reports on thedevelopment of a very efficient method for partitioning the networksimplex basis subtree in which dual values must be updated duringa pivot. The partitioning procedure may be concurrently executedby multiple processes. The resulting rapid decomposition of thesubtree allows an arbitrary number of processes to be utilized inthe actual dual update. This approach alleviates a primary limitationof the most efficient parallel network simplex implementationpublished to date. The new code performs at least as well as theprevious implementation on medium-scale problems and reduces averagesolution time by over 34% on large-scale problems.