An Optimal Parallel Implementation of a Quadratic Transportation Algorithm.
Date
1990Publisher
Defense Technical Information CenterPlace of publication
Ft. BelvoirGoogle Scholar check
Metadata
Show full item recordAbstract
We discuss the implementation of a quadratic transportation algorithm on massively parallel computer architectures with hypercube communication networks. The implementation is optimal in the sense that it requires effectively O(m(sub O)m(sub D) over P) operations to perform one iteration of an m(sub O) x m(sub D) problem using P processors. Peak computing rates of 3 GFLOPS are achieved by the algorithm on a 64K Connection Machine CM-2.