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.
|Title of host publication||Proceedings of NOAS '97|
|Publisher||Informatics and Mathematical Modelling, Technical University of Denmark, DTU|
|Publication status||Published - 1997|
|Event||Nordic Operations Research Conference - Copenhagen, Denmark|
Duration: 15 Aug 1997 → 16 Aug 1997
|Conference||Nordic Operations Research Conference|
|Period||15/08/1997 → 16/08/1997|