Parallel synchronous and asynchronous implementations of the auction algorithm

Dimitri P. Bertsekas; David A. Castañon

doi:10.1016/S0167-8191(05)80062-6

Parallel synchronous and asynchronous implementations of the auction algorithm

Dimitri P. Bertsekas, David A. Castañon

Research output: Contribution to journal › Article › peer-review

114 Scopus citations

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.

Original language	English (US)
Pages (from-to)	707-732
Number of pages	26
Journal	Parallel Computing
Volume	17
Issue number	6-7
DOIs	https://doi.org/10.1016/S0167-8191(05)80062-6
State	Published - Sep 1991
Externally published	Yes

Keywords

Assignment problem, auction algorithm
computational results
shared memory machines
synchronous and asynchronous implementation

ASJC Scopus subject areas

Software
Theoretical Computer Science
Hardware and Architecture
Computer Networks and Communications
Computer Graphics and Computer-Aided Design
Artificial Intelligence

Access to Document

10.1016/S0167-8191(05)80062-6

Cite this

@article{e74c1395dd8e48ba92ddc918581c1330,

title = "Parallel synchronous and asynchronous implementations of the auction algorithm",

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.",

keywords = "Assignment problem, auction algorithm, computational results, shared memory machines, synchronous and asynchronous implementation",

author = "Bertsekas, {Dimitri P.} and Casta{\~n}on, {David A.}",

note = "Funding Information: * This work was supported in part by the Innovative Science and Technology Program of the Strategic Defense Initiative Office under the supervision of the Office of Naval Research, contract N00014-88-C-0718. The authors would like to thank the Mathematics and Computer Science Division of the Argonne National Laboratory for providing access to the Advanced Computer Research Facility and training in the use of the Encore Multimax.",

year = "1991",

month = sep,

doi = "10.1016/S0167-8191(05)80062-6",

language = "English (US)",

volume = "17",

pages = "707--732",

journal = "Parallel Computing",

issn = "0167-8191",

publisher = "Elsevier",

number = "6-7",

}

TY - JOUR

T1 - Parallel synchronous and asynchronous implementations of the auction algorithm

AU - Bertsekas, Dimitri P.

AU - Castañon, David A.

N1 - Funding Information: * This work was supported in part by the Innovative Science and Technology Program of the Strategic Defense Initiative Office under the supervision of the Office of Naval Research, contract N00014-88-C-0718. The authors would like to thank the Mathematics and Computer Science Division of the Argonne National Laboratory for providing access to the Advanced Computer Research Facility and training in the use of the Encore Multimax.

PY - 1991/9

Y1 - 1991/9

N2 - 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.

AB - 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.

KW - Assignment problem, auction algorithm

KW - computational results

KW - shared memory machines

KW - synchronous and asynchronous implementation

UR - http://www.scopus.com/inward/record.url?scp=0026226724&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026226724&partnerID=8YFLogxK

U2 - 10.1016/S0167-8191(05)80062-6

DO - 10.1016/S0167-8191(05)80062-6

M3 - Article

AN - SCOPUS:0026226724

SN - 0167-8191

VL - 17

SP - 707

EP - 732

JO - Parallel Computing

JF - Parallel Computing

IS - 6-7

ER -

Parallel synchronous and asynchronous implementations of the auction algorithm

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this