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 proceedingArticle in proceedingsResearchpeer-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 languageEnglish
    Title of host publicationProceedings of NOAS '97
    PublisherInformatics and Mathematical Modelling, Technical University of Denmark, DTU
    Publication date1997
    Pages277-287
    Publication statusPublished - 1997
    EventNordic Operations Research Conference - Copenhagen, Denmark
    Duration: 15 Aug 199716 Aug 1997

    Conference

    ConferenceNordic Operations Research Conference
    CountryDenmark
    CityCopenhagen
    Period15/08/199716/08/1997

    Fingerprint Dive into the research topics of 'A parallel approach to the stable marriage problem'. Together they form a unique fingerprint.

    Cite this