Parallel Implementation of the Auction Algorithm on the Intel Hypercube Nader Bag herzadeh
Kent Hawk · 1992
We present our experience in executing the auction algorithm on an iPSC/860 hypercube multiprocessor. We show the performance of the algorithm under synchronous and asynchronous computation models. In order to reduce the number of iterations for this algorithm and effectively increase the inherent parallelism in the auction algorithm, we propose and test a new technique called y-scaling.