ASIA unversity:Item 310904400/4668
English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 94286/110023 (86%)
造訪人次 : 21693682      線上人數 : 649
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧：
  • 您可在西文檢索詞彙前後加上"雙引號"，以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋，建議至進階搜尋限定作者欄位，可獲得較完整資料
    •  進階搜尋


    請使用永久網址來引用或連結此文件: http://asiair.asia.edu.tw/ir/handle/310904400/4668


    題名: The average performance of a parallel stable marriage algorithm
    作者: S. S. Tseng
    貢獻者: Department of Information Science and Applications
    日期: 1989
    上傳時間: 2009-11-30 08:03:01 (UTC+0)
    出版者: Asia University
    摘要: 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)).
    關聯: BIT Numerical Mathematics 29(3):488-456
    顯示於類別:[行動商務與多媒體應用學系] 期刊論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    0KbUnknown665檢視/開啟
    310904400-4668.doc36KbMicrosoft Word413檢視/開啟


    在ASIAIR中所有的資料項目都受到原著作權保護.

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回饋