Parallel synchronous and asynchronous implementations of the auction algorithm

Authors:
Dimitri P. Bertsekas;David A. Castañon
Affiliations:
Department of Electrical Engineering and Computer Science, M.I.T., Cambridge, MA 02139, USA;Department of Electrical, Computer and Systems Engineering, Boston University, Boston, MA 02215, USA
Venue:
Parallel Computing
Year:
1991

Citing 11
Cited 6

A competitive (dual) simplex method for the assignment problem

Mathematical Programming: Series A and B
Solving minimum-cost flow problems by successive approximation

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
A shortest augmenting path algorithm for dense and sparse linear assignment problems

Computing
Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
The auction algorithm: a distributed relaxation method for the assignment problem

Annals of Operations Research - Special Issue: Parallel Optimization on Novel Computer Architectures
Parallel and distributed computation: numerical methods

Parallel and distributed computation: numerical methods
Dual coordinate step methods for linear network flow problems

Mathematical Programming: Series A and B
The auction algorithm for the transportation problem

Annals of Operations Research
Linear network optimization: algorithms and codes

Linear network optimization: algorithms and codes
Portable Programs for Parallel Processors

Portable Programs for Parallel Processors
EFFICIENT GRAPH ALGORITHMS FOR SEQUENTIAL AND PARALLEL COMPUTERS

EFFICIENT GRAPH ALGORITHMS FOR SEQUENTIAL AND PARALLEL COMPUTERS

Multitarget Tracking Algorithm Parallelization for Distributed-Memory Computing Systems

HPDC '96 Proceedings of the 5th IEEE International Symposium on High Performance Distributed Computing
Parallel implementation of a transportation network model

Journal of Parallel and Distributed Computing
Probabilistic Analysis of Market-based Algorithms for Initial Robotic Formations

International Journal of Robotics Research
Image and animation display with multiple mobile robots

International Journal of Robotics Research
Implementing a multi-agent system in python with an auction-based agreement approach

ProMAS'11 Proceedings of the 9th international conference on Programming Multi-Agent Systems
An auction-based weighted matching implementation on massively parallel architectures

Parallel Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we discuss the parallel implementation of the auction algorithm for the classical assignment problem. We show that the algorithm admits a totally asynchronous implementation and we consider several implementations on a shared memory machine, with varying degrees of synchronization. We also discuss and explore computationally the tradeoffs involved in using asynchronism to reduce the synchronization penalty.