Survey of Local Algorithms
A local algorithm is a distributed algorithm that runs in constant time, independently of the size of the network. Being highly scalable and fault tolerant, such algorithms are ideal in the operation of large-scale distributed systems. Furthermore, even though the model of local algorithms is very l...
Gespeichert in:
| Veröffentlicht in: | ACM computing surveys 2013-02, Vol.45 (2), p.1-40 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 40 |
|---|---|
| container_issue | 2 |
| container_start_page | 1 |
| container_title | ACM computing surveys |
| container_volume | 45 |
| creator | SUOMELA, Jukka |
| description | A local algorithm is a distributed algorithm that runs in constant time, independently of the size of the network. Being highly scalable and fault tolerant, such algorithms are ideal in the operation of large-scale distributed systems. Furthermore, even though the model of local algorithms is very limited, in recent years we have seen many positive results for nontrivial problems. This work surveys the state-of-the-art in the field, covering impossibility results, deterministic local algorithms, randomized local algorithms, and local algorithms for geometric graphs. |
| doi_str_mv | 10.1145/2431211.2431223 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1506346461</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2916266181</sourcerecordid><originalsourceid>FETCH-LOGICAL-c439t-793a78284a73248cd90288aab12ee80488361ec60469c9bf72a0192329a107e43</originalsourceid><addsrcrecordid>eNpdkEtLAzEUhYMoWKtrwVVBBDfT3pubyWNZSn1AwYW6DmnM6JRpU5OO0H_vaAcXrs7mO4fDx9glwhhRlBMuCDni-Dc5HbEBlqUqFAk8ZgMgCQUQwCk7y3kFAFygHLCr5zZ9hf0oVqNF9K4ZTZv3mOrdxzqfs5PKNTlc9Dlkr3fzl9lDsXi6f5xNF4UXZHaFMuSU5lo4RVxo_2aAa-3cEnkIGoTWJDF4CUIab5aV4g7QcOLGIaggaMhuD7vbFD_bkHd2XWcfmsZtQmyzxRIkCSkkduj1P3QV27Tp3lkklFKjorKjJgfKp5hzCpXdpnrt0t4i2B9Xtndle1dd46bfdbmTUCW38XX-q3ElZElC0TdM82Ob</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1316681735</pqid></control><display><type>article</type><title>Survey of Local Algorithms</title><source>ACM Digital Library Complete</source><creator>SUOMELA, Jukka</creator><creatorcontrib>SUOMELA, Jukka</creatorcontrib><description>A local algorithm is a distributed algorithm that runs in constant time, independently of the size of the network. Being highly scalable and fault tolerant, such algorithms are ideal in the operation of large-scale distributed systems. Furthermore, even though the model of local algorithms is very limited, in recent years we have seen many positive results for nontrivial problems. This work surveys the state-of-the-art in the field, covering impossibility results, deterministic local algorithms, randomized local algorithms, and local algorithms for geometric graphs.</description><identifier>ISSN: 0360-0300</identifier><identifier>EISSN: 1557-7341</identifier><identifier>DOI: 10.1145/2431211.2431223</identifier><identifier>CODEN: CMSVAN</identifier><language>eng</language><publisher>New York, NY: Association for Computing Machinery</publisher><subject>Algorithmics. Computability. Computer arithmetics ; Algorithms ; Applied sciences ; Computer science; control theory; systems ; Computer systems and distributed systems. User interface ; Distributed processing ; Exact sciences and technology ; Geometry ; Graphs ; Information retrieval. Graph ; Software ; Studies ; Theoretical computing</subject><ispartof>ACM computing surveys, 2013-02, Vol.45 (2), p.1-40</ispartof><rights>2014 INIST-CNRS</rights><rights>Copyright Association for Computing Machinery Feb 2013</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c439t-793a78284a73248cd90288aab12ee80488361ec60469c9bf72a0192329a107e43</citedby><cites>FETCH-LOGICAL-c439t-793a78284a73248cd90288aab12ee80488361ec60469c9bf72a0192329a107e43</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=27465347$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>SUOMELA, Jukka</creatorcontrib><title>Survey of Local Algorithms</title><title>ACM computing surveys</title><description>A local algorithm is a distributed algorithm that runs in constant time, independently of the size of the network. Being highly scalable and fault tolerant, such algorithms are ideal in the operation of large-scale distributed systems. Furthermore, even though the model of local algorithms is very limited, in recent years we have seen many positive results for nontrivial problems. This work surveys the state-of-the-art in the field, covering impossibility results, deterministic local algorithms, randomized local algorithms, and local algorithms for geometric graphs.</description><subject>Algorithmics. Computability. Computer arithmetics</subject><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Computer systems and distributed systems. User interface</subject><subject>Distributed processing</subject><subject>Exact sciences and technology</subject><subject>Geometry</subject><subject>Graphs</subject><subject>Information retrieval. Graph</subject><subject>Software</subject><subject>Studies</subject><subject>Theoretical computing</subject><issn>0360-0300</issn><issn>1557-7341</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><recordid>eNpdkEtLAzEUhYMoWKtrwVVBBDfT3pubyWNZSn1AwYW6DmnM6JRpU5OO0H_vaAcXrs7mO4fDx9glwhhRlBMuCDni-Dc5HbEBlqUqFAk8ZgMgCQUQwCk7y3kFAFygHLCr5zZ9hf0oVqNF9K4ZTZv3mOrdxzqfs5PKNTlc9Dlkr3fzl9lDsXi6f5xNF4UXZHaFMuSU5lo4RVxo_2aAa-3cEnkIGoTWJDF4CUIab5aV4g7QcOLGIaggaMhuD7vbFD_bkHd2XWcfmsZtQmyzxRIkCSkkduj1P3QV27Tp3lkklFKjorKjJgfKp5hzCpXdpnrt0t4i2B9Xtndle1dd46bfdbmTUCW38XX-q3ElZElC0TdM82Ob</recordid><startdate>20130201</startdate><enddate>20130201</enddate><creator>SUOMELA, Jukka</creator><general>Association for Computing Machinery</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20130201</creationdate><title>Survey of Local Algorithms</title><author>SUOMELA, Jukka</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c439t-793a78284a73248cd90288aab12ee80488361ec60469c9bf72a0192329a107e43</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Algorithmics. Computability. Computer arithmetics</topic><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Computer systems and distributed systems. User interface</topic><topic>Distributed processing</topic><topic>Exact sciences and technology</topic><topic>Geometry</topic><topic>Graphs</topic><topic>Information retrieval. Graph</topic><topic>Software</topic><topic>Studies</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>SUOMELA, Jukka</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>ACM computing surveys</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>SUOMELA, Jukka</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Survey of Local Algorithms</atitle><jtitle>ACM computing surveys</jtitle><date>2013-02-01</date><risdate>2013</risdate><volume>45</volume><issue>2</issue><spage>1</spage><epage>40</epage><pages>1-40</pages><issn>0360-0300</issn><eissn>1557-7341</eissn><coden>CMSVAN</coden><abstract>A local algorithm is a distributed algorithm that runs in constant time, independently of the size of the network. Being highly scalable and fault tolerant, such algorithms are ideal in the operation of large-scale distributed systems. Furthermore, even though the model of local algorithms is very limited, in recent years we have seen many positive results for nontrivial problems. This work surveys the state-of-the-art in the field, covering impossibility results, deterministic local algorithms, randomized local algorithms, and local algorithms for geometric graphs.</abstract><cop>New York, NY</cop><pub>Association for Computing Machinery</pub><doi>10.1145/2431211.2431223</doi><tpages>40</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0360-0300 |
| ispartof | ACM computing surveys, 2013-02, Vol.45 (2), p.1-40 |
| issn | 0360-0300 1557-7341 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_1506346461 |
| source | ACM Digital Library Complete |
| subjects | Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Computer science control theory systems Computer systems and distributed systems. User interface Distributed processing Exact sciences and technology Geometry Graphs Information retrieval. Graph Software Studies Theoretical computing |
| title | Survey of Local Algorithms |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-27T19%3A24%3A21IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Survey%20of%20Local%20Algorithms&rft.jtitle=ACM%20computing%20surveys&rft.au=SUOMELA,%20Jukka&rft.date=2013-02-01&rft.volume=45&rft.issue=2&rft.spage=1&rft.epage=40&rft.pages=1-40&rft.issn=0360-0300&rft.eissn=1557-7341&rft.coden=CMSVAN&rft_id=info:doi/10.1145/2431211.2431223&rft_dat=%3Cproquest_cross%3E2916266181%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1316681735&rft_id=info:pmid/&rfr_iscdi=true |