Distributed computing: a locality-sensitive approach
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Philadelphia, Pa.
Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104)
2000
|
| Schriftenreihe: | SIAM monographs on discrete mathematics and applications
5 |
| Schlagworte: | |
| Online-Zugang: | TUM01 UBW01 UBY01 UER01 Volltext |
| Beschreibung: | Mode of access: World Wide Web. - System requirements: Adobe Acrobat Reader Includes bibliographical references (p. 319-337) and index Preface -- 1. Introduction -- Part I. Basics of distributed network algorithms -- 2. The distributed network model -- 3. Broadcast and convergecast -- 4. Downcasts and upcasts -- 5. Tree constructions -- 6. Synchronizers -- 7. Vertex coloring -- 8. Maximal independent sets (MIS) -- 9. Message routing -- 10. Local queries and local resource finding -- Part II. Locality-preserving representations -- 11. Clustered representations, clusters, covers and partitions -- 12. Sparse covers -- 13. Sparse partitions -- 14. Related graph representations -- 15. Skeletal representations, spanning trees, tree covers and spanners -- 16. Sparse spanners for unweighted graphs -- 17. Light-weight spanners -- 18. Spanners with low average stretch -- 19. Proximity-preserving labeling systems -- Part III. Distributed constructions and applications of LP-representations -- 20. A basic algorithm for constructing network partitions -- 21. Efficient algorithms for constructing covers -- 22. Efficient algorithms for constructing network decompositions -- 23. Exploiting topological knowledge, broadcast revisited -- 24. How local are global tasks? MST revisited -- 25. Local coordination, synchronizers and MIS revisited -- 26. Hierarchical cluster-based routing -- 27. Regional directories, resource finding revisited -- 28. Additional applications in other settings -- Bibliography -- Index Presents the locality-sensitive approach to distributed network algorithms-the utilization of locality to simplify control structures and algorithms and reduce their costs. The author begins with an introductory exposition of distributed network algorithms focusing on topics that illustrate the role of locality in distributed algorithmic techniques. He then introduces locality-preserving network representations and describes sequential and distributed techniques for their construction. Finally, the applicability of the locality-sensitive approach is demonstrated through several applications. Gives a thorough exposition of network spanners and other locality-preserving network representations such as sparse covers and partitions. The book is useful for computer scientists interested in distributed computing, electrical engineers interested in network architectures and protocols, and for discrete mathematicians and graph theorists |
| Beschreibung: | 1 Online-Resesource (xvi, 343 Seiten) |
| ISBN: | 9780898714647 0898714648 |
| DOI: | 10.1137/1.9780898719772 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV039747132 | ||
| 003 | DE-604 | ||
| 005 | 20230607 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 111207s2000 sz |||| o||u| ||||||eng d | ||
| 010 | |a 00033836 | ||
| 020 | |a 9780898714647 |c print |9 978-0-89871-464-7 | ||
| 020 | |a 0898714648 |c print |9 0-89871-464-8 | ||
| 020 | |z 9780898719772 |c electronic bk. |9 978-0-8987-1977-2 | ||
| 024 | 7 | |a 10.1137/1.9780898719772 |2 doi | |
| 035 | |a (OCoLC)775728629 | ||
| 035 | |a (DE-599)BVBBV039747132 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 044 | |a sz |c XA-CH | ||
| 049 | |a DE-91 |a DE-29 |a DE-706 |a DE-83 |a DE-20 | ||
| 084 | |a ST 200 |0 (DE-625)143611: |2 rvk | ||
| 100 | 1 | |a Peleg, David |4 aut | |
| 245 | 1 | 0 | |a Distributed computing |b a locality-sensitive approach |c David Peleg |
| 264 | 1 | |a Philadelphia, Pa. |b Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104) |c 2000 | |
| 300 | |a 1 Online-Resesource (xvi, 343 Seiten) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 1 | |a SIAM monograps on discrete mathematics and applications |v 5 | |
| 500 | |a Mode of access: World Wide Web. - System requirements: Adobe Acrobat Reader | ||
| 500 | |a Includes bibliographical references (p. 319-337) and index | ||
| 500 | |a Preface -- 1. Introduction -- Part I. Basics of distributed network algorithms -- 2. The distributed network model -- 3. Broadcast and convergecast -- 4. Downcasts and upcasts -- 5. Tree constructions -- 6. Synchronizers -- 7. Vertex coloring -- 8. Maximal independent sets (MIS) -- 9. Message routing -- 10. Local queries and local resource finding -- Part II. Locality-preserving representations -- 11. Clustered representations, clusters, covers and partitions -- 12. Sparse covers -- 13. Sparse partitions -- 14. Related graph representations -- 15. Skeletal representations, spanning trees, tree covers and spanners -- 16. Sparse spanners for unweighted graphs -- 17. Light-weight spanners -- 18. Spanners with low average stretch -- 19. Proximity-preserving labeling systems -- Part III. Distributed constructions and applications of LP-representations -- 20. A basic algorithm for constructing network partitions -- 21. Efficient algorithms for constructing covers -- 22. Efficient algorithms for constructing network decompositions -- 23. Exploiting topological knowledge, broadcast revisited -- 24. How local are global tasks? MST revisited -- 25. Local coordination, synchronizers and MIS revisited -- 26. Hierarchical cluster-based routing -- 27. Regional directories, resource finding revisited -- 28. Additional applications in other settings -- Bibliography -- Index | ||
| 500 | |a Presents the locality-sensitive approach to distributed network algorithms-the utilization of locality to simplify control structures and algorithms and reduce their costs. The author begins with an introductory exposition of distributed network algorithms focusing on topics that illustrate the role of locality in distributed algorithmic techniques. He then introduces locality-preserving network representations and describes sequential and distributed techniques for their construction. Finally, the applicability of the locality-sensitive approach is demonstrated through several applications. Gives a thorough exposition of network spanners and other locality-preserving network representations such as sparse covers and partitions. The book is useful for computer scientists interested in distributed computing, electrical engineers interested in network architectures and protocols, and for discrete mathematicians and graph theorists | ||
| 650 | 4 | |a Datenverarbeitung | |
| 650 | 4 | |a Electronic data processing / Distributed processing | |
| 650 | 0 | 7 | |a Datenverarbeitung |0 (DE-588)4011152-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Datenverarbeitungssystem |0 (DE-588)4125229-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Dezentrale Datenverarbeitung |0 (DE-588)7545389-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Verteiltes System |0 (DE-588)4238872-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 4 | |a Verteiltes Datenverarbeitungssystem |9 rswk-swf |
| 689 | 0 | 0 | |a Datenverarbeitung |0 (DE-588)4011152-0 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Verteiltes System |0 (DE-588)4238872-7 |D s |
| 689 | 1 | 1 | |a Dezentrale Datenverarbeitung |0 (DE-588)7545389-7 |D s |
| 689 | 1 | 2 | |a Datenverarbeitungssystem |0 (DE-588)4125229-9 |D s |
| 689 | 1 | |8 1\p |5 DE-604 | |
| 689 | 2 | 0 | |a Verteiltes Datenverarbeitungssystem |A s |
| 689 | 2 | |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druckausgabe |z 0-89871-464-8 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druckausgabe |z 978-0-89871-464-7 |
| 830 | 0 | |a SIAM monographs on discrete mathematics and applications |v 5 |w (DE-604)BV047230149 |9 5 | |
| 856 | 4 | 0 | |u https://doi.org/10.1137/1.9780898719772 |x Verlag |3 Volltext |
| 912 | |a ZDB-72-SIA | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-024594662 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 966 | e | |u https://doi.org/10.1137/1.9780898719772 |l TUM01 |p ZDB-72-SIA |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1137/1.9780898719772 |l UBW01 |p ZDB-72-SIA |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1137/1.9780898719772 |l UBY01 |p ZDB-72-SIA |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1137/1.9780898719772 |l UER01 |p ZDB-72-SIA |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804148637222043648 |
|---|---|
| any_adam_object | |
| author | Peleg, David |
| author_facet | Peleg, David |
| author_role | aut |
| author_sort | Peleg, David |
| author_variant | d p dp |
| building | Verbundindex |
| bvnumber | BV039747132 |
| classification_rvk | ST 200 |
| collection | ZDB-72-SIA |
| ctrlnum | (OCoLC)775728629 (DE-599)BVBBV039747132 |
| discipline | Informatik |
| doi_str_mv | 10.1137/1.9780898719772 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>05341nmm a2200685zcb4500</leader><controlfield tag="001">BV039747132</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20230607 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">111207s2000 sz |||| o||u| ||||||eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="a">00033836</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780898714647</subfield><subfield code="c">print</subfield><subfield code="9">978-0-89871-464-7</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0898714648</subfield><subfield code="c">print</subfield><subfield code="9">0-89871-464-8</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9780898719772</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">978-0-8987-1977-2</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1137/1.9780898719772</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)775728629</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV039747132</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">sz</subfield><subfield code="c">XA-CH</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield><subfield code="a">DE-29</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-20</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 200</subfield><subfield code="0">(DE-625)143611:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Peleg, David</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Distributed computing</subfield><subfield code="b">a locality-sensitive approach</subfield><subfield code="c">David Peleg</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Philadelphia, Pa.</subfield><subfield code="b">Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104)</subfield><subfield code="c">2000</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Resesource (xvi, 343 Seiten)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">SIAM monograps on discrete mathematics and applications</subfield><subfield code="v">5</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Mode of access: World Wide Web. - System requirements: Adobe Acrobat Reader</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references (p. 319-337) and index</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Preface -- 1. Introduction -- Part I. Basics of distributed network algorithms -- 2. The distributed network model -- 3. Broadcast and convergecast -- 4. Downcasts and upcasts -- 5. Tree constructions -- 6. Synchronizers -- 7. Vertex coloring -- 8. Maximal independent sets (MIS) -- 9. Message routing -- 10. Local queries and local resource finding -- Part II. Locality-preserving representations -- 11. Clustered representations, clusters, covers and partitions -- 12. Sparse covers -- 13. Sparse partitions -- 14. Related graph representations -- 15. Skeletal representations, spanning trees, tree covers and spanners -- 16. Sparse spanners for unweighted graphs -- 17. Light-weight spanners -- 18. Spanners with low average stretch -- 19. Proximity-preserving labeling systems -- Part III. Distributed constructions and applications of LP-representations -- 20. A basic algorithm for constructing network partitions -- 21. Efficient algorithms for constructing covers -- 22. Efficient algorithms for constructing network decompositions -- 23. Exploiting topological knowledge, broadcast revisited -- 24. How local are global tasks? MST revisited -- 25. Local coordination, synchronizers and MIS revisited -- 26. Hierarchical cluster-based routing -- 27. Regional directories, resource finding revisited -- 28. Additional applications in other settings -- Bibliography -- Index</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Presents the locality-sensitive approach to distributed network algorithms-the utilization of locality to simplify control structures and algorithms and reduce their costs. The author begins with an introductory exposition of distributed network algorithms focusing on topics that illustrate the role of locality in distributed algorithmic techniques. He then introduces locality-preserving network representations and describes sequential and distributed techniques for their construction. Finally, the applicability of the locality-sensitive approach is demonstrated through several applications. Gives a thorough exposition of network spanners and other locality-preserving network representations such as sparse covers and partitions. The book is useful for computer scientists interested in distributed computing, electrical engineers interested in network architectures and protocols, and for discrete mathematicians and graph theorists</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Datenverarbeitung</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Electronic data processing / Distributed processing</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Datenverarbeitung</subfield><subfield code="0">(DE-588)4011152-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Datenverarbeitungssystem</subfield><subfield code="0">(DE-588)4125229-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Dezentrale Datenverarbeitung</subfield><subfield code="0">(DE-588)7545389-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Verteiltes System</subfield><subfield code="0">(DE-588)4238872-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="4"><subfield code="a">Verteiltes Datenverarbeitungssystem</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Datenverarbeitung</subfield><subfield code="0">(DE-588)4011152-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Verteiltes System</subfield><subfield code="0">(DE-588)4238872-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Dezentrale Datenverarbeitung</subfield><subfield code="0">(DE-588)7545389-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="2"><subfield code="a">Datenverarbeitungssystem</subfield><subfield code="0">(DE-588)4125229-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Verteiltes Datenverarbeitungssystem</subfield><subfield code="A">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druckausgabe</subfield><subfield code="z">0-89871-464-8</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druckausgabe</subfield><subfield code="z">978-0-89871-464-7</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">SIAM monographs on discrete mathematics and applications</subfield><subfield code="v">5</subfield><subfield code="w">(DE-604)BV047230149</subfield><subfield code="9">5</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1137/1.9780898719772</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-72-SIA</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-024594662</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1137/1.9780898719772</subfield><subfield code="l">TUM01</subfield><subfield code="p">ZDB-72-SIA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1137/1.9780898719772</subfield><subfield code="l">UBW01</subfield><subfield code="p">ZDB-72-SIA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1137/1.9780898719772</subfield><subfield code="l">UBY01</subfield><subfield code="p">ZDB-72-SIA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1137/1.9780898719772</subfield><subfield code="l">UER01</subfield><subfield code="p">ZDB-72-SIA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV039747132 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T00:10:18Z |
| institution | BVB |
| isbn | 9780898714647 0898714648 |
| language | English |
| lccn | 00033836 |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-024594662 |
| oclc_num | 775728629 |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM DE-29 DE-706 DE-83 DE-20 |
| owner_facet | DE-91 DE-BY-TUM DE-29 DE-706 DE-83 DE-20 |
| physical | 1 Online-Resesource (xvi, 343 Seiten) |
| psigel | ZDB-72-SIA |
| publishDate | 2000 |
| publishDateSearch | 2000 |
| publishDateSort | 2000 |
| publisher | Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104) |
| record_format | marc |
| series | SIAM monographs on discrete mathematics and applications |
| series2 | SIAM monograps on discrete mathematics and applications |
| spelling | Peleg, David aut Distributed computing a locality-sensitive approach David Peleg Philadelphia, Pa. Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104) 2000 1 Online-Resesource (xvi, 343 Seiten) txt rdacontent c rdamedia cr rdacarrier SIAM monograps on discrete mathematics and applications 5 Mode of access: World Wide Web. - System requirements: Adobe Acrobat Reader Includes bibliographical references (p. 319-337) and index Preface -- 1. Introduction -- Part I. Basics of distributed network algorithms -- 2. The distributed network model -- 3. Broadcast and convergecast -- 4. Downcasts and upcasts -- 5. Tree constructions -- 6. Synchronizers -- 7. Vertex coloring -- 8. Maximal independent sets (MIS) -- 9. Message routing -- 10. Local queries and local resource finding -- Part II. Locality-preserving representations -- 11. Clustered representations, clusters, covers and partitions -- 12. Sparse covers -- 13. Sparse partitions -- 14. Related graph representations -- 15. Skeletal representations, spanning trees, tree covers and spanners -- 16. Sparse spanners for unweighted graphs -- 17. Light-weight spanners -- 18. Spanners with low average stretch -- 19. Proximity-preserving labeling systems -- Part III. Distributed constructions and applications of LP-representations -- 20. A basic algorithm for constructing network partitions -- 21. Efficient algorithms for constructing covers -- 22. Efficient algorithms for constructing network decompositions -- 23. Exploiting topological knowledge, broadcast revisited -- 24. How local are global tasks? MST revisited -- 25. Local coordination, synchronizers and MIS revisited -- 26. Hierarchical cluster-based routing -- 27. Regional directories, resource finding revisited -- 28. Additional applications in other settings -- Bibliography -- Index Presents the locality-sensitive approach to distributed network algorithms-the utilization of locality to simplify control structures and algorithms and reduce their costs. The author begins with an introductory exposition of distributed network algorithms focusing on topics that illustrate the role of locality in distributed algorithmic techniques. He then introduces locality-preserving network representations and describes sequential and distributed techniques for their construction. Finally, the applicability of the locality-sensitive approach is demonstrated through several applications. Gives a thorough exposition of network spanners and other locality-preserving network representations such as sparse covers and partitions. The book is useful for computer scientists interested in distributed computing, electrical engineers interested in network architectures and protocols, and for discrete mathematicians and graph theorists Datenverarbeitung Electronic data processing / Distributed processing Datenverarbeitung (DE-588)4011152-0 gnd rswk-swf Datenverarbeitungssystem (DE-588)4125229-9 gnd rswk-swf Dezentrale Datenverarbeitung (DE-588)7545389-7 gnd rswk-swf Verteiltes System (DE-588)4238872-7 gnd rswk-swf Verteiltes Datenverarbeitungssystem rswk-swf Datenverarbeitung (DE-588)4011152-0 s DE-604 Verteiltes System (DE-588)4238872-7 s Dezentrale Datenverarbeitung (DE-588)7545389-7 s Datenverarbeitungssystem (DE-588)4125229-9 s 1\p DE-604 Verteiltes Datenverarbeitungssystem s Erscheint auch als Druckausgabe 0-89871-464-8 Erscheint auch als Druckausgabe 978-0-89871-464-7 SIAM monographs on discrete mathematics and applications 5 (DE-604)BV047230149 5 https://doi.org/10.1137/1.9780898719772 Verlag Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Peleg, David Distributed computing a locality-sensitive approach SIAM monographs on discrete mathematics and applications Datenverarbeitung Electronic data processing / Distributed processing Datenverarbeitung (DE-588)4011152-0 gnd Datenverarbeitungssystem (DE-588)4125229-9 gnd Dezentrale Datenverarbeitung (DE-588)7545389-7 gnd Verteiltes System (DE-588)4238872-7 gnd Verteiltes Datenverarbeitungssystem |
| subject_GND | (DE-588)4011152-0 (DE-588)4125229-9 (DE-588)7545389-7 (DE-588)4238872-7 |
| title | Distributed computing a locality-sensitive approach |
| title_auth | Distributed computing a locality-sensitive approach |
| title_exact_search | Distributed computing a locality-sensitive approach |
| title_full | Distributed computing a locality-sensitive approach David Peleg |
| title_fullStr | Distributed computing a locality-sensitive approach David Peleg |
| title_full_unstemmed | Distributed computing a locality-sensitive approach David Peleg |
| title_short | Distributed computing |
| title_sort | distributed computing a locality sensitive approach |
| title_sub | a locality-sensitive approach |
| topic | Datenverarbeitung Electronic data processing / Distributed processing Datenverarbeitung (DE-588)4011152-0 gnd Datenverarbeitungssystem (DE-588)4125229-9 gnd Dezentrale Datenverarbeitung (DE-588)7545389-7 gnd Verteiltes System (DE-588)4238872-7 gnd Verteiltes Datenverarbeitungssystem |
| topic_facet | Datenverarbeitung Electronic data processing / Distributed processing Datenverarbeitungssystem Dezentrale Datenverarbeitung Verteiltes System Verteiltes Datenverarbeitungssystem |
| url | https://doi.org/10.1137/1.9780898719772 |
| volume_link | (DE-604)BV047230149 |
| work_keys_str_mv | AT pelegdavid distributedcomputingalocalitysensitiveapproach |