The Parallel Complexity of Element Distinctness is $\Omega ( \sqrt{\log n} )
We consider the problem of element distinctness. Here $n$ synchronized processors, each given an integer input, must decide whether these integers are pairwise distinct, while communicating via an infinitely large shared memory. If simultaneous write access to a memory cell is forbidden, then a lowe...
Saved in:
Published in | SIAM journal on discrete mathematics Vol. 1; no. 3; pp. 399 - 410 |
---|---|
Main Authors | , , , |
Format | Journal Article |
Language | English |
Published |
Philadelphia
Society for Industrial and Applied Mathematics
01.08.1988
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Abstract | We consider the problem of element distinctness. Here $n$ synchronized processors, each given an integer input, must decide whether these integers are pairwise distinct, while communicating via an infinitely large shared memory. If simultaneous write access to a memory cell is forbidden, then a lower bound of $\Omega ( \log n )$ on the number of steps easily follows (from S. Cook, C. Dwork, and R. Reischuk, SIAM J. Comput., 15 (1986), pp. 87-97.) When several (different) values can be written simultaneously to any cell, then there is an simple algorithm requiring $O ( 1 )$ steps. We consider the intermediate model, in which simultaneous writes to a single cell are allowed only if all values written are equal. We prove a lower bound of $\Omega ( ( \log n )^{1 /2} )$ steps, improving the previous lower bound of $\Omega ( \log \log \log n )$ steps (F. E. Fich, F. Meyer auf der Heide, and A. Wigderson, Adv. in Comput., 4 (1987), pp. 1-15). The proof uses Ramsey-theoretic and combinatorial arguments. The result implies a separation between the powers of some variants of the PRAM model of parallel computation. |
---|---|
AbstractList | We consider the problem of element distinctness. Here $n$ synchronized processors, each given an integer input, must decide whether these integers are pairwise distinct, while communicating via an infinitely large shared memory. If simultaneous write access to a memory cell is forbidden, then a lower bound of $\Omega ( \log n )$ on the number of steps easily follows (from S. Cook, C. Dwork, and R. Reischuk, SIAM J. Comput., 15 (1986), pp. 87-97.) When several (different) values can be written simultaneously to any cell, then there is an simple algorithm requiring $O ( 1 )$ steps. We consider the intermediate model, in which simultaneous writes to a single cell are allowed only if all values written are equal. We prove a lower bound of $\Omega ( ( \log n )^{1 /2} )$ steps, improving the previous lower bound of $\Omega ( \log \log \log n )$ steps (F. E. Fich, F. Meyer auf der Heide, and A. Wigderson, Adv. in Comput., 4 (1987), pp. 1-15). The proof uses Ramsey-theoretic and combinatorial arguments. The result implies a separation between the powers of some variants of the PRAM model of parallel computation. |
Author | Wigderson, Avi Ragde, Prabhakar Steiger, William Szemerédi, Endre |
Author_xml | – sequence: 1 givenname: Prabhakar surname: Ragde fullname: Ragde, Prabhakar – sequence: 2 givenname: William surname: Steiger fullname: Steiger, William – sequence: 3 givenname: Endre surname: Szemerédi fullname: Szemerédi, Endre – sequence: 4 givenname: Avi surname: Wigderson fullname: Wigderson, Avi |
BookMark | eNotkE1LAzEYhINUsK3iXwgiqIfVvEn2I0ep9QMK9dBjYUmySd2STdpkCxbxv9tSD8PM4WEGZoQGPniD0DWQRwBWPhFO4KAzNAQi8qwEXgzQkFSHzCsCF2iU0poQ4BzyIZotvgz-lFE6ZxyehG7jzHfb73GweOpMZ3yPX9rUt1733qSE24Rvl_POrCS-x8u0jf3P0oUV9r_44RKdW-mSufr3MVq8TheT92w2f_uYPM8yLUqRgVLaVtA0DbXQ0EaAEopJSvLKkoKwppRKWBBaV6XQFJTluqgaIRkXRCnBxujmVLuJYbszqa_XYRf9YbEWNC8EZfQI3Z0gHUNK0dh6E9tOxn0NpD4eVf8fxf4Am7Bapg |
CitedBy_id | crossref_primary_10_1016_0022_0000_92_90006_5 crossref_primary_10_1016_j_jpdc_2003_12_001 crossref_primary_10_1016_0890_5401_89_90059_X crossref_primary_10_1007_BF01759055 crossref_primary_10_1016_S0020_0190_97_00032_X crossref_primary_10_1137_0217037 crossref_primary_10_1016_S0304_3975_96_00020_5 crossref_primary_10_1006_jagm_1997_0905 |
Cites_doi | 10.1137/0605009 10.1016/0097-3165(77)90083-8 10.1137/0215006 10.1007/BF01762109 10.1016/0020-0190(82)90093-X 10.1112/plms/s3-2.1.417 10.1112/jlms/s1-25.4.249 |
ContentType | Journal Article |
Copyright | [Copyright] © 1988 Society for Industrial and Applied Mathematics |
Copyright_xml | – notice: [Copyright] © 1988 Society for Industrial and Applied Mathematics |
DBID | AAYXX CITATION 3V. 7WY 7WZ 7X2 7XB 87Z 88A 88F 88I 88K 8AL 8FE 8FG 8FH 8FK 8FL 8G5 ABJCF ABUWG AFKRA ARAPS ATCPS AZQEC BBNVY BENPR BEZIV BGLVJ BHPHI CCPQU D1I DWQXO FRNLG F~G GNUQQ GUQSH HCIFZ JQ2 K60 K6~ K7- KB. L.- L6V LK8 M0C M0K M0N M1Q M2O M2P M2T M7P M7S MBDVC P5Z P62 PATMY PDBOC PQBIZ PQBZA PQEST PQQKQ PQUKI PRINS PTHSS PYCSY Q9U |
DOI | 10.1137/0401040 |
DatabaseName | CrossRef ProQuest Central (Corporate) ProQuest_ABI/INFORM Collection ABI/INFORM Global (PDF only) Agricultural Science Collection ProQuest Central (purchase pre-March 2016) ABI/INFORM Collection Biology Database (Alumni Edition) Military Database (Alumni Edition) Science Database (Alumni Edition) Telecommunications (Alumni Edition) Computing Database (Alumni Edition) ProQuest SciTech Collection ProQuest Technology Collection ProQuest Natural Science Collection ProQuest Central (Alumni) (purchase pre-March 2016) ABI/INFORM Collection (Alumni Edition) Research Library (Alumni Edition) Materials Science & Engineering Collection ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Aerospace Collection Agricultural & Environmental Science Collection ProQuest Central Essentials Biological Science Collection ProQuest Central Business Premium Collection Technology Collection ProQuest Natural Science Collection ProQuest One Community College ProQuest Materials Science Collection ProQuest Central Business Premium Collection (Alumni) ABI/INFORM Global (Corporate) ProQuest Central Student Research Library Prep SciTech Premium Collection ProQuest Computer Science Collection ProQuest Business Collection (Alumni Edition) ProQuest Business Collection Computer Science Database Materials Science Database ABI/INFORM Professional Advanced ProQuest Engineering Collection Biological Sciences ABI/INFORM Global Agricultural Science Database Computing Database Military Database ProQuest research library ProQuest Science Journals Telecommunications Database Biological Science Database Engineering Database Research Library (Corporate) Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection Environmental Science Database Materials Science Collection ProQuest One Business ProQuest One Business (Alumni) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Academic ProQuest One Academic UKI Edition ProQuest Central China Engineering collection Environmental Science Collection ProQuest Central Basic |
DatabaseTitle | CrossRef Agricultural Science Database ProQuest Business Collection (Alumni Edition) Research Library Prep Computer Science Database ProQuest Central Student ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection SciTech Premium Collection ProQuest Military Collection ProQuest Central China ABI/INFORM Complete ProQuest Telecommunications Natural Science Collection Biological Science Collection Engineering Collection Advanced Technologies & Aerospace Collection Business Premium Collection ABI/INFORM Global Engineering Database ProQuest Science Journals (Alumni Edition) ProQuest Biological Science Collection ProQuest One Academic Eastern Edition Agricultural Science Collection ProQuest Technology Collection ProQuest Telecommunications (Alumni Edition) Biological Science Database ProQuest Business Collection Environmental Science Collection ProQuest One Academic UKI Edition Environmental Science Database ProQuest One Academic ABI/INFORM Global (Corporate) ProQuest One Business Technology Collection Materials Science Collection ProQuest Central (Alumni Edition) ProQuest One Community College Research Library (Alumni Edition) ProQuest Natural Science Collection ProQuest Biology Journals (Alumni Edition) ProQuest Central ABI/INFORM Professional Advanced ProQuest Engineering Collection ProQuest Central Korea Agricultural & Environmental Science Collection Materials Science Database ProQuest Research Library ABI/INFORM Complete (Alumni Edition) ProQuest Materials Science Collection ProQuest Computing ABI/INFORM Global (Alumni Edition) ProQuest Central Basic ProQuest Science Journals ProQuest Computing (Alumni Edition) ProQuest Military Collection (Alumni Edition) ProQuest SciTech Collection Advanced Technologies & Aerospace Database Materials Science & Engineering Collection ProQuest One Business (Alumni) ProQuest Central (Alumni) Business Premium Collection (Alumni) |
DatabaseTitleList | Agricultural Science Database |
Database_xml | – sequence: 1 dbid: 8FG name: ProQuest Technology Collection url: https://search.proquest.com/technologycollection1 sourceTypes: Aggregation Database |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Computer Science |
EISSN | 1095-7146 |
EndPage | 410 |
ExternalDocumentID | 2599825001 10_1137_0401040 |
GroupedDBID | .4S .DC 123 3V. 4.4 6TJ 7WY 7X2 7XC 88A 88I 8CJ 8FE 8FG 8FH 8FL 8G5 AALVN AASXH AAYXX ABDBF ABJCF ABKAD ABMZU ABUWG ACGFO ACGOD ACIWK ACPRK ADBBV ADNWM AENEX AFFNX AFKRA AFRAH ALMA_UNASSIGNED_HOLDINGS ANXRF ARAPS ARCSS ATCPS AZQEC BBNVY BENPR BEZIV BGLVJ BHPHI BPHCQ CCPQU CITATION CS3 CZ9 D1I D1J D1K DQ2 DU5 DWQXO EAP EBS EDO EJD EMK EST ESX FRNLG G8K GNUQQ GROUPED_ABI_INFORM_COMPLETE GUQSH H13 HCIFZ H~9 I-F K6- K60 K6V K6~ K7- KB. KC. L6V LK5 LK8 M0C M0K M0L M0N M1Q M2O M2P M7P M7R M7S P1Q P2P P62 PATMY PDBOC PQBIZ PQBZA PQQKQ PROAC PTHSS PYCSY RJG RNS RSI TN5 TUS UQL YNT YYP 7XB 88K 8AL 8FK JQ2 L.- M2T MBDVC PQEST PQUKI PRINS Q9U |
ID | FETCH-LOGICAL-c979-1bbcf81ddd2f1d2d91b9b3a2058f0603d7ab9f19cc879c21bf4c68d9a3490bb93 |
IEDL.DBID | 8FG |
ISSN | 0895-4801 |
IngestDate | Thu Oct 10 22:20:40 EDT 2024 Fri Aug 23 00:40:22 EDT 2024 |
IsPeerReviewed | true |
IsScholarly | true |
Issue | 3 |
Language | English |
LinkModel | DirectLink |
MergedId | FETCHMERGED-LOGICAL-c979-1bbcf81ddd2f1d2d91b9b3a2058f0603d7ab9f19cc879c21bf4c68d9a3490bb93 |
PQID | 925692329 |
PQPubID | 666311 |
PageCount | 12 |
ParticipantIDs | proquest_journals_925692329 crossref_primary_10_1137_0401040 |
PublicationCentury | 1900 |
PublicationDate | 1988-08-00 19880801 |
PublicationDateYYYYMMDD | 1988-08-01 |
PublicationDate_xml | – month: 08 year: 1988 text: 1988-08-00 |
PublicationDecade | 1980 |
PublicationPlace | Philadelphia |
PublicationPlace_xml | – name: Philadelphia |
PublicationTitle | SIAM journal on discrete mathematics |
PublicationYear | 1988 |
Publisher | Society for Industrial and Applied Mathematics |
Publisher_xml | – name: Society for Industrial and Applied Mathematics |
References | Hansel Georges (RH) 1964; 258 Berge Claude (RB) 1973 RER2 Hajnal A. (RHS) 1970 RFK RCDR RK Fich Faith E. (RFMW) 1987 RER RP RFRW |
References_xml | – ident: RFK doi: 10.1137/0605009 – start-page: 601 volume-title: Combinatorial theory and its applications, II (Proc. Colloq., Balatonfüred, 1969) year: 1970 ident: RHS contributor: fullname: Hajnal A. – ident: RP doi: 10.1016/0097-3165(77)90083-8 – ident: RCDR doi: 10.1137/0215006 – ident: RFRW doi: 10.1007/BF01762109 – ident: RK doi: 10.1016/0020-0190(82)90093-X – volume-title: Graphs and hypergraphs year: 1973 ident: RB contributor: fullname: Berge Claude – ident: RER2 doi: 10.1112/plms/s3-2.1.417 – start-page: 1 volume-title: Advances in computing research, Vol. 4 year: 1987 ident: RFMW contributor: fullname: Fich Faith E. – ident: RER doi: 10.1112/jlms/s1-25.4.249 – volume: 258 start-page: 6037 year: 1964 ident: RH publication-title: C. R. Acad. Sci. Paris contributor: fullname: Hansel Georges |
SSID | ssj0014415 |
Score | 1.33142 |
Snippet | We consider the problem of element distinctness. Here $n$ synchronized processors, each given an integer input, must decide whether these integers are pairwise... |
SourceID | proquest crossref |
SourceType | Aggregation Database |
StartPage | 399 |
SubjectTerms | Algorithms |
Title | The Parallel Complexity of Element Distinctness is $\Omega ( \sqrt{\log n} ) |
URI | https://www.proquest.com/docview/925692329 |
Volume | 1 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV05T8MwFLagXVi4EaVQeegAg0WcOIk9IY6WCqFSoSIxVIp8xAgJ0iNhQIj_ju24lbowO_Lwnv2OvM_fB0A3ZjqhaYot0S1BREuOaMgFciMdFUchlw4gO0wGL-ThNX712JzSwyqXMdEFajWV9h_5JTO52RQjIbuazZEVjbLDVa-gsQma2BLh2Yfi_fvVEMG2Cq6IZDGyLCn1m1mMLaUPsX1IsJ6M1mOxSzD9XbDtK0N4XbtyD2zkxT7YWaouQH8JD8Cj8Swc8YUVQfmAdt1yWlbfcKphrwaDwzt7cwtZ2TgG30vYnTx95m8cnsNJOV9UPxMT8WDxCy8OwbjfG98OkNdEQJKlDGEhpDYlplKhxipUDAsmIh4GMdVBEkQq5YJpzKSkKZMhFprIhCrGI8ICIVh0BBrFtMiPAZSYKpOgOY51SpTWZqtEUZljmXMS8LxlPvG2yWY180XmOoYozbz5WqC9tFnmj36ZrRx18u9qG2xhRmmNpTsFjWrxlZ-Z_F6JjvNiBzRvesPR8x86GKWe |
link.rule.ids | 315,786,790,12792,21416,27955,27956,33406,33777,43633,43838 |
linkProvider | ProQuest |
linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV07T8MwELagDLDwRpTy8NABBos4dhJ7QghaCpTCUKQOlSI_YoQE6SsMCPHfsRO3UhdmRx7u7O_ucp-_A6AZcROzJMFO6JYiapRALBQSlS0dHZFQqJIg24s7r_RhEA08N2fmaZVzTCyBWo-U-0d-yW1stslIyK_GE-SGRrnmqp-gsQrWKImJO-asfbdoIrhSoUwieYScSkr1ZhZjJ-lDXR0SLAejZSwuA0x7G2z6zBBeV67cAStZvgu25lMXoL-Ee6BrPQtfxNQNQfmAbt1pWhbfcGRgqyKDw1t3c3NVOByD7zPYHD5_Zm8CnsPhbDItfoYW8WD-Cy_2Qb_d6t90kJ-JgBRPOMJSKmNTTK1Dg3WoOZZcEhEGETNBHBCdCMkN5kqxhKsQS0NVzDQXhPJASk4OQC0f5dkhgAozbQO0wJFJqDbGbhVrpjKsMkEDkdXtJ9426bhSvkjLioEkqTdfHTTmNkv90Z-lC0cd_bt6BtY7_adu2r3vPTbABuaMVby6Y1Arpl_ZiY31hTwtPfoH4lWm7A |
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=The+Parallel+Complexity+of+Element+Distinctness+is+%24%5COmega+%28+%5Csqrt%7B%5Clog+n%7D+%29&rft.jtitle=SIAM+journal+on+discrete+mathematics&rft.au=Ragde%2C+Prabhakar&rft.au=Steiger%2C+William&rft.au=Szemer%C3%A9di%2C+Endre&rft.au=Wigderson%2C+Avi&rft.date=1988-08-01&rft.issn=0895-4801&rft.eissn=1095-7146&rft.volume=1&rft.issue=3&rft.spage=399&rft.epage=410&rft_id=info:doi/10.1137%2F0401040&rft.externalDBID=n%2Fa&rft.externalDocID=10_1137_0401040 |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0895-4801&client=summon |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0895-4801&client=summon |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0895-4801&client=summon |