An Optimal Parallel Implementation of a Quadratic Transportation Algorithm.
Zenios, Stavros A.
PublisherDefense Technical Information Center
Place of publicationFt. Belvoir
Google Scholar check
MetadataShow full item record
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.