Title :
Massively parallel auction algorithms for the assignment problem
Author :
Wein, Joel M. ; Zenios, Stavros
Author_Institution :
Dept. of Math., MIT, Cambridge, MA, USA
Abstract :
Alternative approaches to the massively parallel implementation of D.P. Bertsekas´ auction algorithm (see Ann. Oper. Res., vol.14, p.105-23, 1988) on the Connection Machine CM2 are discussed. The most efficient implementation is a hybrid Jacobi/Gauss-Seidel implementation. It exploits two different levels of parallelism and an efficient way of communicating the data between them without the need to perform general router operations across the hypercube network. The implementations are evaluated empirically, solving large, dense problems
Keywords :
parallel algorithms; Connection Machine CM2; assignment problem; hybrid Jacobi/Gauss-Seidel implementation; hypercube network; massively parallel auction algorithms; Cities and towns; Contracts; Gaussian processes; Jacobian matrices; Mathematics; Parallel processing; Resource management; Routing; Scientific computing; Telecommunication traffic;
Conference_Titel :
Frontiers of Massively Parallel Computation, 1990. Proceedings., 3rd Symposium on the
Conference_Location :
College Park, MD
Print_ISBN :
0-8186-2053-6
DOI :
10.1109/FMPC.1990.89444
