Parallel shortest path auction algorithms

L. C. Polymenakos; D. P. Bertsekas

doi:10.1016/0167-8191(94)90035-3

Parallel shortest path auction algorithms

L. C. Polymenakos, D. P. Bertsekas

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

11 Scopus citations

Abstract

In this paper we discuss the parallel implementation of the auction algorithm for shortest path problems. We show that both the one-sided and the two-sided versions of the algorithm admit asynchronous implementations. We implemented the parallel schemes for the algorithm on a shared memory machine and tested its efficiency under various degrees of synchronization and for different types of problems. We discuss the efficiency of the parallel implementation of the many origins-one destination problem, the all origins-one destination problem, and the many origins-many destinations problem.

Original language	English (US)
Pages (from-to)	1221-1247
Number of pages	27
Journal	Parallel Computing
Volume	20
Issue number	9
DOIs	https://doi.org/10.1016/0167-8191(94)90035-3
State	Published - Sep 1994
Externally published	Yes

Keywords

Auction algorithm
Parallel implementation
Performance results
Shared memory multiprocessor
Shortest path problem

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/0167-8191(94)90035-3

Cite this

@article{6692c930d49344509f56915c156c2b8f,

title = "Parallel shortest path auction algorithms",

abstract = "In this paper we discuss the parallel implementation of the auction algorithm for shortest path problems. We show that both the one-sided and the two-sided versions of the algorithm admit asynchronous implementations. We implemented the parallel schemes for the algorithm on a shared memory machine and tested its efficiency under various degrees of synchronization and for different types of problems. We discuss the efficiency of the parallel implementation of the many origins-one destination problem, the all origins-one destination problem, and the many origins-many destinations problem.",

keywords = "Auction algorithm, Parallel implementation, Performance results, Shared memory multiprocessor, Shortest path problem",

author = "Polymenakos, {L. C.} and Bertsekas, {D. P.}",

note = "Funding Information: t Work supported by NSF under Grants No. DDM-8903385 and CCR-9108058. Thanks are due for comments and assistance with the parallel asynchronous codes to David Castanon. * Corresponding author. Email: bertsekas@lids.mit.edu",

year = "1994",

month = sep,

doi = "10.1016/0167-8191(94)90035-3",

language = "English (US)",

volume = "20",

pages = "1221--1247",

journal = "Parallel Computing",

issn = "0167-8191",

publisher = "Elsevier",

number = "9",

}

TY - JOUR

T1 - Parallel shortest path auction algorithms

AU - Polymenakos, L. C.

AU - Bertsekas, D. P.

N1 - Funding Information: t Work supported by NSF under Grants No. DDM-8903385 and CCR-9108058. Thanks are due for comments and assistance with the parallel asynchronous codes to David Castanon. * Corresponding author. Email: bertsekas@lids.mit.edu

PY - 1994/9

Y1 - 1994/9

N2 - In this paper we discuss the parallel implementation of the auction algorithm for shortest path problems. We show that both the one-sided and the two-sided versions of the algorithm admit asynchronous implementations. We implemented the parallel schemes for the algorithm on a shared memory machine and tested its efficiency under various degrees of synchronization and for different types of problems. We discuss the efficiency of the parallel implementation of the many origins-one destination problem, the all origins-one destination problem, and the many origins-many destinations problem.

AB - In this paper we discuss the parallel implementation of the auction algorithm for shortest path problems. We show that both the one-sided and the two-sided versions of the algorithm admit asynchronous implementations. We implemented the parallel schemes for the algorithm on a shared memory machine and tested its efficiency under various degrees of synchronization and for different types of problems. We discuss the efficiency of the parallel implementation of the many origins-one destination problem, the all origins-one destination problem, and the many origins-many destinations problem.

KW - Auction algorithm

KW - Parallel implementation

KW - Performance results

KW - Shared memory multiprocessor

KW - Shortest path problem

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

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

U2 - 10.1016/0167-8191(94)90035-3

DO - 10.1016/0167-8191(94)90035-3

M3 - Article

AN - SCOPUS:0028494927

SN - 0167-8191

VL - 20

SP - 1221

EP - 1247

JO - Parallel Computing

JF - Parallel Computing

IS - 9

ER -

Parallel shortest path auction algorithms

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this