Parallel ‘go with the winners’ algorithms in distributed memory models
We parallelize the ‘go with the winners’ algorithm of Aldous and Vazirani (in: Proceedings of the 35th IEEE Symposium on the Foundations of Computer Science, IEEE Computer Society Press, Silver Spring., MD, 1994, pp. 492–501) and analyze the resulting parallel algorithm in the LogP-model (in: Procee...
Uložené v:
| Vydané v: | Journal of parallel and distributed computing Ročník 63; číslo 9; s. 801 - 814 |
|---|---|
| Hlavní autori: | , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
San Diego, CA
Elsevier Inc
01.09.2003
Elsevier |
| Predmet: | |
| ISSN: | 0743-7315, 1096-0848 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | We parallelize the ‘go with the winners’ algorithm of Aldous and Vazirani (in: Proceedings of the 35th IEEE Symposium on the Foundations of Computer Science, IEEE Computer Society Press, Silver Spring., MD, 1994, pp. 492–501) and analyze the resulting parallel algorithm in the LogP-model (in: Proceedings of the Fourth ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming, 1993, pp. 1–12). The main issues in the analysis are load imbalances and communication delays. The result of the analysis is a practical algorithm which, under reasonable assumptions, achieves linear speedup. Finally, we analyze our algorithm for a concrete application: generating models of amorphous chemical structures. |
|---|---|
| AbstractList | We parallelize the ‘go with the winners’ algorithm of Aldous and Vazirani (in: Proceedings of the 35th IEEE Symposium on the Foundations of Computer Science, IEEE Computer Society Press, Silver Spring., MD, 1994, pp. 492–501) and analyze the resulting parallel algorithm in the LogP-model (in: Proceedings of the Fourth ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming, 1993, pp. 1–12). The main issues in the analysis are load imbalances and communication delays. The result of the analysis is a practical algorithm which, under reasonable assumptions, achieves linear speedup. Finally, we analyze our algorithm for a concrete application: generating models of amorphous chemical structures. |
| Author | Lengauer, Thomas Peinado, Marcus |
| Author_xml | – sequence: 1 givenname: Marcus surname: Peinado fullname: Peinado, Marcus email: marcuspe@microsoft.com organization: Microsoft, Redmond, WA 98052, USA – sequence: 2 givenname: Thomas surname: Lengauer fullname: Lengauer, Thomas email: lengauer@mpi-sb.mpg.de organization: Max Planck Institute for Computer Science, 66123 Saarbrücken, Germany |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=15216852$$DView record in Pascal Francis |
| BookMark | eNqFkMtKAzEUhoNUsFYfQchG0MVoLpNMZiVSvFJQUNch1zYyl5KMSnd9DH29PonTVnTp6hwO3__D-fbBoGkbB8ARRmcYYX7-hIqcZgXF7ATRU4QwKjO-A4b95BkSuRiA4S-yB_ZTeu0hzAoxBPePKqqqchVcLT-nLfwI3Qx2M9cvTeNiWi2_oKqmbezvdYKhgTakLgb91jkLa1e3cQHr1roqHYBdr6rkDn_mCLxcXz2Pb7PJw83d-HKSGSJYl2ldEm41LoktUemZUJpyT3PBSy8sccw7irXOPeFUUaKNz5WnQnjOlReioCNwvO2dq2RU5aNqTEhyHkOt4kJiRjAXjPQc23ImtilF5_8QJNfi5EacXFuRiMqNOMn73MU21__k3oOLMpngGuNsiM500rbhn4ZvREN5VQ |
| Cites_doi | 10.1002/rsa.3240040402 10.1137/0222066 10.1109/SFCS.1995.492472 10.1109/HICSS.1995.375476 10.1109/SFCS.1994.365742 10.1145/140901.140903 10.1137/0218077 10.1016/0304-3975(86)90174-X 10.1145/79173.79181 10.1145/155332.155333 10.1145/215399.215427 |
| ContentType | Journal Article |
| Copyright | 2003 Elsevier Inc. 2003 INIST-CNRS |
| Copyright_xml | – notice: 2003 Elsevier Inc. – notice: 2003 INIST-CNRS |
| DBID | AAYXX CITATION IQODW |
| DOI | 10.1016/S0743-7315(03)00109-6 |
| DatabaseName | CrossRef Pascal-Francis |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science Applied Sciences |
| EISSN | 1096-0848 |
| EndPage | 814 |
| ExternalDocumentID | 15216852 10_1016_S0743_7315_03_00109_6 S0743731503001096 |
| GroupedDBID | --K --M -~X .~1 0R~ 1B1 1~. 1~5 29L 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABBOA ABEFU ABFNM ABFSI ABJNI ABMAC ABTAH ABXDB ABYKQ ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADFGL ADHUB ADJOM ADMUD ADTZH AEBSH AECPX AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC CAG COF CS3 DM4 DU5 E.L EBS EFBJH EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q G8K GBLVA GBOLZ HLZ HVGLF HZ~ H~9 IHE J1W JJJVA K-O KOM LG5 LG9 LY7 M41 MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 R2- RIG ROL RPZ SBC SDF SDG SDP SES SET SEW SPC SPCBC SST SSV SSZ T5K TN5 TWZ WUQ XJT XOL XPP ZMT ZU3 ZY4 ~G- ~G0 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD BNPGV IQODW SSH |
| ID | FETCH-LOGICAL-c285t-bb926db192d909f58ab36f34869f8d2e5fe31bb4f263a32bcf4af388f66af8873 |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000186000100003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0743-7315 |
| IngestDate | Wed Apr 02 07:33:45 EDT 2025 Sat Nov 29 07:15:44 EST 2025 Fri Feb 23 02:27:53 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 9 |
| Keywords | LogP model Amorphous solids Second moment method Go with the winners Self-avoiding walks Load balancing Parallel algorithms Parallel algorithm Second moment Distributed memory Parallel programming Distributed algorithm Self avoiding walk LogP model: Second moment method Shared memory Algorithm analysis |
| Language | English |
| License | CC BY 4.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c285t-bb926db192d909f58ab36f34869f8d2e5fe31bb4f263a32bcf4af388f66af8873 |
| PageCount | 14 |
| ParticipantIDs | pascalfrancis_primary_15216852 crossref_primary_10_1016_S0743_7315_03_00109_6 elsevier_sciencedirect_doi_10_1016_S0743_7315_03_00109_6 |
| PublicationCentury | 2000 |
| PublicationDate | 2003-09-01 |
| PublicationDateYYYYMMDD | 2003-09-01 |
| PublicationDate_xml | – month: 09 year: 2003 text: 2003-09-01 day: 01 |
| PublicationDecade | 2000 |
| PublicationPlace | San Diego, CA |
| PublicationPlace_xml | – name: San Diego, CA |
| PublicationTitle | Journal of parallel and distributed computing |
| PublicationYear | 2003 |
| Publisher | Elsevier Inc Elsevier |
| Publisher_xml | – name: Elsevier Inc – name: Elsevier |
| References | D. Culler, R. Karp, D. Patterson, A. Sahay, K. Schauser, E. Santos, R. Subramonian, T. von Eicken, LogP: towards a realistic model of parallel computation, in: Proceedings of the Fourth ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming, 1993, pp. 1–12. B.M. Maggs, L.R. Matheson, R.E. Tarjan, Models of parallel computation: a survey and synthesis, in: Proceedings of the 28th Hawaii International Conference on System Sciences (HICSS), Vol. 2, 1995, pp. 61–70. Lovász, Simonovits (BIB10) 1993; 4 Garey, Johnson (BIB6) 1979 Jerrum, Sinclair (BIB8) October 1993; 22 D. Aldous, U. Vazirani, ‘Go with the winners’ algorithms, in: Proceedings of the 35th IEEE Symposium on the Foundations of Computer Science, IEEE Computer Society Press, Silver Spring, MD, 1994, pp. 492–501. M. Luby, D. Randall, A. Sinclair, Markov chain algorithms for planar lattice structures (extended abstract), in: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, IEEE, 23–25 October, 1995, pp. 150–159. Madras, Slade (BIB12) 1993 Jerrum, Sinclair (BIB7) 1989; 18 A. Alexandrov, M.F. Ionescu, K.E. Schauser, C. Scheiman, LogGP: incorporating long messages into the LogP model, in: Proceedings of the Seventh ACM Symposium on Parallel Algorithms and Architectures, 1995, pp. 95–105. A. Bar-Noy, S. Kipnis, Designing broadcasting algorithms in the postal model for message passing systems, in: Proceedings of the Symposium on Parallel Algorithms and Architectures, 1992, pp. 13–22. Peinado, Lengauer (BIB14) 1997; Vol. 1269 Elliot (BIB5) 1990 Shiryayev (BIB16) 1984 Valiant (BIB17) 1990; 33 D. Randall, A. Sinclair, Testable algorithms for self-avoiding walks, in: Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, Philadelphia, Pennsylvania, 23–25 January 1994, pp. 593–602. Jerrum, Valiant, Vazirani (BIB9) 1986; 43 Valiant (10.1016/S0743-7315(03)00109-6_BIB17) 1990; 33 10.1016/S0743-7315(03)00109-6_BIB15 Shiryayev (10.1016/S0743-7315(03)00109-6_BIB16) 1984 10.1016/S0743-7315(03)00109-6_BIB11 10.1016/S0743-7315(03)00109-6_BIB13 10.1016/S0743-7315(03)00109-6_BIB2 Jerrum (10.1016/S0743-7315(03)00109-6_BIB9) 1986; 43 10.1016/S0743-7315(03)00109-6_BIB1 10.1016/S0743-7315(03)00109-6_BIB4 10.1016/S0743-7315(03)00109-6_BIB3 Elliot (10.1016/S0743-7315(03)00109-6_BIB5) 1990 Garey (10.1016/S0743-7315(03)00109-6_BIB6) 1979 Jerrum (10.1016/S0743-7315(03)00109-6_BIB7) 1989; 18 Peinado (10.1016/S0743-7315(03)00109-6_BIB14) 1997; Vol. 1269 Jerrum (10.1016/S0743-7315(03)00109-6_BIB8) 1993; 22 Madras (10.1016/S0743-7315(03)00109-6_BIB12) 1993 Lovász (10.1016/S0743-7315(03)00109-6_BIB10) 1993; 4 |
| References_xml | – volume: 33 start-page: 103 year: 1990 end-page: 111 ident: BIB17 article-title: A bridging model for parallel computation publication-title: Commun. ACM – year: 1990 ident: BIB5 publication-title: Physics of Amorphous Materials – year: 1979 ident: BIB6 publication-title: Computers and Intractability: A Guide to the Theory of NP-Completeness – reference: M. Luby, D. Randall, A. Sinclair, Markov chain algorithms for planar lattice structures (extended abstract), in: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, IEEE, 23–25 October, 1995, pp. 150–159. – year: 1993 ident: BIB12 publication-title: The Self-Avoiding Walk – volume: 43 start-page: 169 year: 1986 end-page: 188 ident: BIB9 article-title: Random generation of combinatorial structures from a uniform distribution publication-title: Theor. Comput. Sci. – reference: D. Aldous, U. Vazirani, ‘Go with the winners’ algorithms, in: Proceedings of the 35th IEEE Symposium on the Foundations of Computer Science, IEEE Computer Society Press, Silver Spring, MD, 1994, pp. 492–501. – volume: 22 start-page: 1087 year: October 1993 end-page: 1116 ident: BIB8 article-title: Polynomial-time approximation algorithms for the Ising model publication-title: SIAM J. Comput. – reference: A. Bar-Noy, S. Kipnis, Designing broadcasting algorithms in the postal model for message passing systems, in: Proceedings of the Symposium on Parallel Algorithms and Architectures, 1992, pp. 13–22. – year: 1984 ident: BIB16 publication-title: Probability – reference: D. Randall, A. Sinclair, Testable algorithms for self-avoiding walks, in: Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, Philadelphia, Pennsylvania, 23–25 January 1994, pp. 593–602. – reference: B.M. Maggs, L.R. Matheson, R.E. Tarjan, Models of parallel computation: a survey and synthesis, in: Proceedings of the 28th Hawaii International Conference on System Sciences (HICSS), Vol. 2, 1995, pp. 61–70. – volume: 4 start-page: 359 year: 1993 end-page: 412 ident: BIB10 article-title: Random walks in a convex body and an improved volume algorithm publication-title: Random Struct. Algorithms – volume: Vol. 1269 start-page: 135 year: 1997 end-page: 149 ident: BIB14 article-title: Go with the winners generators with applications to molecular modeling publication-title: Proceedings of the First International Workshop on Randomization and Approximation Techniques in Computer Science – volume: 18 start-page: 1149 year: 1989 end-page: 1178 ident: BIB7 article-title: Approximating the permanent publication-title: SIAM J. Comput. – reference: A. Alexandrov, M.F. Ionescu, K.E. Schauser, C. Scheiman, LogGP: incorporating long messages into the LogP model, in: Proceedings of the Seventh ACM Symposium on Parallel Algorithms and Architectures, 1995, pp. 95–105. – reference: D. Culler, R. Karp, D. Patterson, A. Sahay, K. Schauser, E. Santos, R. Subramonian, T. von Eicken, LogP: towards a realistic model of parallel computation, in: Proceedings of the Fourth ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming, 1993, pp. 1–12. – volume: 4 start-page: 359 year: 1993 ident: 10.1016/S0743-7315(03)00109-6_BIB10 article-title: Random walks in a convex body and an improved volume algorithm publication-title: Random Struct. Algorithms doi: 10.1002/rsa.3240040402 – volume: 22 start-page: 1087 issue: 5 year: 1993 ident: 10.1016/S0743-7315(03)00109-6_BIB8 article-title: Polynomial-time approximation algorithms for the Ising model publication-title: SIAM J. Comput. doi: 10.1137/0222066 – ident: 10.1016/S0743-7315(03)00109-6_BIB11 doi: 10.1109/SFCS.1995.492472 – ident: 10.1016/S0743-7315(03)00109-6_BIB13 doi: 10.1109/HICSS.1995.375476 – ident: 10.1016/S0743-7315(03)00109-6_BIB1 doi: 10.1109/SFCS.1994.365742 – ident: 10.1016/S0743-7315(03)00109-6_BIB3 doi: 10.1145/140901.140903 – year: 1979 ident: 10.1016/S0743-7315(03)00109-6_BIB6 – volume: 18 start-page: 1149 year: 1989 ident: 10.1016/S0743-7315(03)00109-6_BIB7 article-title: Approximating the permanent publication-title: SIAM J. Comput. doi: 10.1137/0218077 – volume: Vol. 1269 start-page: 135 year: 1997 ident: 10.1016/S0743-7315(03)00109-6_BIB14 article-title: Go with the winners generators with applications to molecular modeling – volume: 43 start-page: 169 year: 1986 ident: 10.1016/S0743-7315(03)00109-6_BIB9 article-title: Random generation of combinatorial structures from a uniform distribution publication-title: Theor. Comput. Sci. doi: 10.1016/0304-3975(86)90174-X – volume: 33 start-page: 103 year: 1990 ident: 10.1016/S0743-7315(03)00109-6_BIB17 article-title: A bridging model for parallel computation publication-title: Commun. ACM doi: 10.1145/79173.79181 – year: 1990 ident: 10.1016/S0743-7315(03)00109-6_BIB5 – year: 1993 ident: 10.1016/S0743-7315(03)00109-6_BIB12 – ident: 10.1016/S0743-7315(03)00109-6_BIB4 doi: 10.1145/155332.155333 – ident: 10.1016/S0743-7315(03)00109-6_BIB15 – year: 1984 ident: 10.1016/S0743-7315(03)00109-6_BIB16 – ident: 10.1016/S0743-7315(03)00109-6_BIB2 doi: 10.1145/215399.215427 |
| SSID | ssj0011578 |
| Score | 1.6343645 |
| Snippet | We parallelize the ‘go with the winners’ algorithm of Aldous and Vazirani (in: Proceedings of the 35th IEEE Symposium on the Foundations of Computer Science,... |
| SourceID | pascalfrancis crossref elsevier |
| SourceType | Index Database Publisher |
| StartPage | 801 |
| SubjectTerms | Algorithmics. Computability. Computer arithmetics Amorphous solids Applied sciences Computer science; control theory; systems Computer systems and distributed systems. User interface Exact sciences and technology Go with the winners Load balancing LogP model Parallel algorithms Second moment method Self-avoiding walks Software Theoretical computing |
| Title | Parallel ‘go with the winners’ algorithms in distributed memory models |
| URI | https://dx.doi.org/10.1016/S0743-7315(03)00109-6 |
| Volume | 63 |
| WOSCitedRecordID | wos000186000100003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: ScienceDirect database customDbUrl: eissn: 1096-0848 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0011578 issn: 0743-7315 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1La9wwEBbbpIdC6bv0GXRooCU48UqWLB1DSWlDCIGmsDcj2daysLGX3U2a3nLoj2j_Xn5JRy970xL6gF6MsSUNzHwajcfzQOiVqbLapIomlYbtlvHUJJqyMtGMEaNSXXPmEoUP8sNDMRrJo8Hga8yFOZvmTSPOz-Xsv4oanoGwbersX4i7WxQewD0IHa4gdrj-keCP1Nz2R5luxTgGMW6DuxUg8dn12lrEd3JLTcftHN6e-MBYW0fXtsACO_TEBuF-8b1yFtcYsbNIzPrfVyeXrltEPBed7p00qmpDflB52tnyB7Vtyh2Q04crRU8E7UKtgnsspshcieB0NVBz6nM2t2uvZVMb-Sx8ic2ohoOe83CTKzpVBBrhePY5p79ofu-E-NiR27RttzaJdP_-kp-qbbvz2421Q0HP2UH8BlonOZOgG9d3P-yN9ru_UUPmT_S4dp8JttMTfJ3SN4HYdTbO7ZlawM4zvmXKih1zfA_dCbLDux4499Ggbh6gu7G5Bw66_iHajzjClxffxi22CMKAIBwQdHnxHffYwZMGr4gfe-xgj51H6NO7veO375PQeCMpiWDLRGtJeKXB-K9kKg0TSlNuaCa4NKIiNTM1HWqdGcKpokSXJlOGCmE4VwZOLfoYrTVtUz9BmFVDqUr4gmNMZ2kuFc1UKXPKqVaMG_4UbUdWFTNfX6XoAw-Bt4XlbZHSwvG2gAkiMrQIRqI3_gpAwu-mblwRQE8QbFguGHn272s_R7f6LfECrS3np_VLdLM8W04W840AqB8Td5Rx |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Parallel+%E2%80%98go+with+the+winners%E2%80%99+algorithms+in+distributed+memory+models&rft.jtitle=Journal+of+parallel+and+distributed+computing&rft.au=Peinado%2C+Marcus&rft.au=Lengauer%2C+Thomas&rft.date=2003-09-01&rft.pub=Elsevier+Inc&rft.issn=0743-7315&rft.eissn=1096-0848&rft.volume=63&rft.issue=9&rft.spage=801&rft.epage=814&rft_id=info:doi/10.1016%2FS0743-7315%2803%2900109-6&rft.externalDocID=S0743731503001096 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0743-7315&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0743-7315&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0743-7315&client=summon |