Skip to main content
SpringerLink
Log in

The average performance of a parallel stable marriage algorithm

  • Part I Computer Science
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

In this paper, Tseng and Lee's parallel algorithm to solve the stable marriage prolem is analyzed. It is shown that the average number of parallel proposals of the algorithm is of ordern by usingn processors on a CREW PRAM, where each parallel proposal requiresO(loglog(n) time on CREW PRAM by applying the parallel selection algorithms of Valiant or Shiloach and Vishkin. Therefore, our parallel algorithm requiresO(nloglog(n)) time. The speed-up achieved is log(n)/loglog(n) since the average number of proposals required by applying McVitie and Wilson's algorithm to solve the stable marriage problem isO(nlog(n)).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Allison, L.,Stable marriages by coroutines, Information Processing Letters, Vol. 16, No. 2, Feb. 1983, pp. 611–65.

    Article  Google Scholar 

  2. Gale, D. and Shapley, L. S.,College admissions and the stability of marriage, Am. Math. Monthly 69, 1962, pp. 9–15.

    Google Scholar 

  3. Hull, M. E. C.,A parallel view of stable marriages, Information Processing Letters, Vol. 18, No. 1, Feb. 1984, pp. 63–66.

    Article  Google Scholar 

  4. Kapur, D. and Krishnamoorthy, M. S.,Worst-case choice for the stable marriage problem, Information Processing Letters, Vol. 21, July 1985, pp. 27–30.

    Article  Google Scholar 

  5. Knuth, D. E.,The Art of Computer Programming, Vol. 1/Fundamental Algorithms, 2nd Edition, Addison-Wesley, Reading, Mass., 1973.

    Google Scholar 

  6. McVitie, D. G. and Wilson, L. B.,Stable marriage assignment for unequal sets, BIT 10, 1970, pp. 295–309.

    Article  Google Scholar 

  7. McVitie, D. G. and Wilson, L. B.,The stable marriage problem, Communication of the ACM, Vol. 14, No. 7, July 1971, pp. 486–490.

    Article  Google Scholar 

  8. McVitie, D. G. and Wilson, L. B.,Algorithm 411, Pts. 1–3. Three procedures for the stable marriage problem, Communication of the ACM, Vol. 14, No. 7, July 1971, pp. 491–492.

    Article  Google Scholar 

  9. Quinn, M. J.,A note on two parallel algorithms to solve the stable marriage problem, BIT 25, 1985, pp. 473–476.

    Article  Google Scholar 

  10. Shiloach, Y. and Vishkin, U.,Finding the maximum, merging, and sorting in a parallel computation model, Journal of Algorithms, Vol. 2, 1981, pp. 88–102.

    Article  Google Scholar 

  11. Tseng, S. S. and Lee, R. C. T.,A parallel algorithm to solve the stable marriage problem. BIT 24, 1984, 308–316.

    Article  Google Scholar 

  12. Valiant, L. G.,Parallelism in comparison problems, SIAM Journal of Computing, Vol. 4, No. 3, Sep. 1975, pp. 348–455.

    Article  Google Scholar 

  13. Wilson, L. B.,An analysis of the stable marriage assignment algorithm. BIT 12, 1972, pp. 569–575.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Information Science, National Chiao Tung University, Hsinchu, Taiwan 30050, Republic of China

    S. S. Tseng

Authors
  1. S. S. Tseng
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tseng, S.S. The average performance of a parallel stable marriage algorithm. BIT 29, 448–456 (1989). https://doi.org/10.1007/BF02219230

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02219230

CR Category

Keywords

Search

Navigation