Conference paper
A parallel approach to the stable marriage problem
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 |