About

Log in?

DTU users get better search results including licensed content and discounts on order fees.

Anyone can log in and get personalized features such as favorites, tags and feeds.

Log in as DTU user Log in as non-DTU user No thanks

DTU Findit

Conference paper

A parallel approach to the stable marriage problem

In Proceedings of Noas '97 — 1997, pp. 277-287
From

Operations Research, Department of Informatics and Mathematical Modeling, Technical University of Denmark1

Department of Informatics and Mathematical Modeling, Technical University of Denmark2

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.

Language: English
Publisher: Informatics and Mathematical Modelling, Technical University of Denmark, DTU
Year: 1997
Pages: 277-287
Proceedings: Nordic Operations Research Conference
Types: Conference paper
ORCIDs: Larsen, Jesper

DTU users get better search results including licensed content and discounts on order fees.

Log in as DTU user

Access

Analysis