A parallel approach to the stable marriage problem

Jesper Larsen; Claus C. Carøe; David Pisinger

A parallel approach to the stable marriage problem

Jesper Larsen, Claus C. Carøe (Editor), David Pisinger (Editor)

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

Abstract

This paper describes two parallel algorithms for the stable marriage problem implemented on a MIMD parallel computer. The algorithms are tested against sequential algorithms on randomly generated and worst-case instances. The results clearly show that the combination fo a very simple problem and a commercial MIMD system results in parallel algorithms which are not competitive with sequential algorithms wrt. practical performance. 1 Introduction In 1962 the Stable Marriage Problem was.

Original language	English
Title of host publication	Proceedings of NOAS '97
Publisher	Informatics and Mathematical Modelling, Technical University of Denmark, DTU
Publication date	1997
Pages	277-287
Publication status	Published - 1997
Event	Nordic Operations Research Conference - Copenhagen, Denmark Duration: 15 Aug 1997 → 16 Aug 1997

Conference

Conference	Nordic Operations Research Conference
Country/Territory	Denmark
City	Copenhagen
Period	15/08/1997 → 16/08/1997

OpenUrl availability

Full text

Cite this

@inproceedings{f8feb240ecd242f1afe46d5f2f0719a3,

title = "A parallel approach to the stable marriage problem",

abstract = "This paper describes two parallel algorithms for the stable marriage problem implemented on a MIMD parallel computer. The algorithms are tested against sequential algorithms on randomly generated and worst-case instances. The results clearly show that the combination fo a very simple problem and a commercial MIMD system results in parallel algorithms which are not competitive with sequential algorithms wrt. practical performance. 1 Introduction In 1962 the Stable Marriage Problem was.",

author = "Jesper Larsen and {C. Car{\o}e}, Claus and David Pisinger",

year = "1997",

language = "English",

pages = "277--287",

booktitle = "Proceedings of NOAS '97",

publisher = "Informatics and Mathematical Modelling, Technical University of Denmark, DTU",

note = "Nordic Operations Research Conference, NOAS '97 ; Conference date: 15-08-1997 Through 16-08-1997",

}

TY - GEN

T1 - A parallel approach to the stable marriage problem

AU - Larsen, Jesper

A2 - C. Carøe, Claus

A2 - Pisinger, David

PY - 1997

Y1 - 1997

N2 - This paper describes two parallel algorithms for the stable marriage problem implemented on a MIMD parallel computer. The algorithms are tested against sequential algorithms on randomly generated and worst-case instances. The results clearly show that the combination fo a very simple problem and a commercial MIMD system results in parallel algorithms which are not competitive with sequential algorithms wrt. practical performance. 1 Introduction In 1962 the Stable Marriage Problem was.

AB - This paper describes two parallel algorithms for the stable marriage problem implemented on a MIMD parallel computer. The algorithms are tested against sequential algorithms on randomly generated and worst-case instances. The results clearly show that the combination fo a very simple problem and a commercial MIMD system results in parallel algorithms which are not competitive with sequential algorithms wrt. practical performance. 1 Introduction In 1962 the Stable Marriage Problem was.

M3 - Article in proceedings

SP - 277

EP - 287

BT - Proceedings of NOAS '97

PB - Informatics and Mathematical Modelling, Technical University of Denmark, DTU

T2 - Nordic Operations Research Conference

Y2 - 15 August 1997 through 16 August 1997

ER -

A parallel approach to the stable marriage problem

Abstract

Conference

OpenUrl availability

Fingerprint

Cite this