Optimal Parallel Algorithms for Computing a Vertex of the linear Transportation polytope
暂无分享,去创建一个
ABSTRACT We parallelize the Northwest-Corner Rule for computing a vertex of the polytope of feasible solutions for a linear transportation problem involving m supply depots and n demand depots. The algorithm runs on a CREW PRAM using p
[1] Gerald G. Brown,et al. Design and Implementation of Large-Scale Primal Transshipment Algorithms , 1976 .
[2] Clyde P. Kruskal,et al. Searching, Merging, and Sorting in Parallel Computation , 1983, IEEE Transactions on Computers.
[3] Michael A. Langston,et al. Time-Space Optimal Parallel Merging and Sorting , 1991, IEEE Trans. Computers.