Distributed computing through combinatorial topology:
Distributed Computing Through Combinatorial Topology describes techniques for analyzing distributed algorithms based on award winning combinatorial topology research. The authors present a solid theoretical foundation relevant to many real systems reliant on parallelism with unpredictable delays, su...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam
Elsevier/Morgan Kaufmann
[2014]
|
| Schlagworte: | |
| Online-Zugang: | FLA01 Volltext |
| Zusammenfassung: | Distributed Computing Through Combinatorial Topology describes techniques for analyzing distributed algorithms based on award winning combinatorial topology research. The authors present a solid theoretical foundation relevant to many real systems reliant on parallelism with unpredictable delays, such as multicore microprocessors, wireless networks, distributed systems, and Internet protocols. Today, a new student or researcher must assemble a collection of scattered conference publications, which are typically terse and commonly use different notations and terminologies. This book provides a self-contained explanation of the mathematics to readers with computer science backgrounds, as well as explaining computer science concepts to readers with backgrounds in applied mathematics. The first section presents mathematical notions and models, including message passing and shared-memory systems, failures, and timing models. The next section presents core concepts in two chapters each: first, proving a simple result that lends itself to examples and pictures that will build up readers' intuition; then generalizing the concept to prove a more sophisticated result. The overall result weaves together and develops the basic concepts of the field, presenting them in a gradual and intuitively appealing way. The book's final section discusses advanced topics typically found in a graduate-level course for those who wish to explore further. Gathers knowledge otherwise spread across research and conference papers using consistent notations and a standard approach to facilitate understandingPresents unique insights applicable to multiple computing fields, including multicore microprocessors, wireless networks, distributed systems, and Internet protocols Synthesizes and distills material into a simple, unified presentation with examples, illustrations, and exercises |
| Beschreibung: | Includes bibliographical references and index |
| Beschreibung: | 1 online resource (xiv, 319 pages) illustrations (some color) |
| ISBN: | 9780124047280 0124047289 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV046126304 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 190827s2014 |||| o||u| ||||||eng d | ||
| 020 | |a 9780124047280 |9 978-0-12-404728-0 | ||
| 020 | |a 0124047289 |9 0-12-404728-9 | ||
| 035 | |a (ZDB-33-ESD)ocn864899516 | ||
| 035 | |a (OCoLC)864899516 | ||
| 035 | |a (DE-599)BVBBV046126304 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 082 | 0 | |a 004/.36 |2 23 | |
| 100 | 1 | |a Herlihy, Maurice |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Distributed computing through combinatorial topology |c Maurice Herlihy, Dmitry Kozlov, Sergio Rajsbaum |
| 264 | 1 | |a Amsterdam |b Elsevier/Morgan Kaufmann |c [2014] | |
| 264 | 4 | |c © 2014 | |
| 300 | |a 1 online resource (xiv, 319 pages) |b illustrations (some color) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 500 | |a Includes bibliographical references and index | ||
| 520 | |a Distributed Computing Through Combinatorial Topology describes techniques for analyzing distributed algorithms based on award winning combinatorial topology research. The authors present a solid theoretical foundation relevant to many real systems reliant on parallelism with unpredictable delays, such as multicore microprocessors, wireless networks, distributed systems, and Internet protocols. Today, a new student or researcher must assemble a collection of scattered conference publications, which are typically terse and commonly use different notations and terminologies. This book provides a self-contained explanation of the mathematics to readers with computer science backgrounds, as well as explaining computer science concepts to readers with backgrounds in applied mathematics. The first section presents mathematical notions and models, including message passing and shared-memory systems, failures, and timing models. The next section presents core concepts in two chapters each: first, proving a simple result that lends itself to examples and pictures that will build up readers' intuition; then generalizing the concept to prove a more sophisticated result. The overall result weaves together and develops the basic concepts of the field, presenting them in a gradual and intuitively appealing way. The book's final section discusses advanced topics typically found in a graduate-level course for those who wish to explore further. Gathers knowledge otherwise spread across research and conference papers using consistent notations and a standard approach to facilitate understandingPresents unique insights applicable to multiple computing fields, including multicore microprocessors, wireless networks, distributed systems, and Internet protocols Synthesizes and distills material into a simple, unified presentation with examples, illustrations, and exercises | ||
| 650 | 7 | |a COMPUTERS / Computer Literacy |2 bisacsh | |
| 650 | 7 | |a COMPUTERS / Computer Science |2 bisacsh | |
| 650 | 7 | |a COMPUTERS / Data Processing |2 bisacsh | |
| 650 | 7 | |a COMPUTERS / Hardware / General |2 bisacsh | |
| 650 | 7 | |a COMPUTERS / Information Technology |2 bisacsh | |
| 650 | 7 | |a COMPUTERS / Machine Theory |2 bisacsh | |
| 650 | 7 | |a COMPUTERS / Reference |2 bisacsh | |
| 650 | 7 | |a Combinatorial topology |2 fast | |
| 650 | 4 | |a Electronic data processing |x Distributed processing |x Mathematics | |
| 650 | 4 | |a Combinatorial topology | |
| 650 | 0 | 7 | |a Kombinatorische Topologie |0 (DE-588)4137530-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Verteiltes System |0 (DE-588)4238872-7 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Verteiltes System |0 (DE-588)4238872-7 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 689 | 1 | 0 | |a Kombinatorische Topologie |0 (DE-588)4137530-0 |D s |
| 689 | 1 | |8 2\p |5 DE-604 | |
| 700 | 1 | |a Kozlov, D. N. |4 aut | |
| 700 | 1 | |a Rajsbaum, Sergio |4 aut | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 0124045782 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9780124045781 |
| 856 | 4 | 0 | |u http://www.sciencedirect.com/science/book/9780124045781 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-33-ESD | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-031506757 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 966 | e | |u http://www.sciencedirect.com/science/book/9780124045781 |l FLA01 |p ZDB-33-ESD |q FLA_PDA_ESD |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804180446259445760 |
|---|---|
| any_adam_object | |
| author | Herlihy, Maurice Kozlov, D. N. Rajsbaum, Sergio |
| author_facet | Herlihy, Maurice Kozlov, D. N. Rajsbaum, Sergio |
| author_role | aut aut aut |
| author_sort | Herlihy, Maurice |
| author_variant | m h mh d n k dn dnk s r sr |
| building | Verbundindex |
| bvnumber | BV046126304 |
| collection | ZDB-33-ESD |
| ctrlnum | (ZDB-33-ESD)ocn864899516 (OCoLC)864899516 (DE-599)BVBBV046126304 |
| dewey-full | 004/.36 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004/.36 |
| dewey-search | 004/.36 |
| dewey-sort | 14 236 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04400nmm a2200613zc 4500</leader><controlfield tag="001">BV046126304</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">190827s2014 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780124047280</subfield><subfield code="9">978-0-12-404728-0</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0124047289</subfield><subfield code="9">0-12-404728-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-33-ESD)ocn864899516</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)864899516</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV046126304</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="082" ind1="0" ind2=" "><subfield code="a">004/.36</subfield><subfield code="2">23</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Herlihy, Maurice</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Distributed computing through combinatorial topology</subfield><subfield code="c">Maurice Herlihy, Dmitry Kozlov, Sergio Rajsbaum</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="b">Elsevier/Morgan Kaufmann</subfield><subfield code="c">[2014]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">© 2014</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xiv, 319 pages)</subfield><subfield code="b">illustrations (some color)</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="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Distributed Computing Through Combinatorial Topology describes techniques for analyzing distributed algorithms based on award winning combinatorial topology research. The authors present a solid theoretical foundation relevant to many real systems reliant on parallelism with unpredictable delays, such as multicore microprocessors, wireless networks, distributed systems, and Internet protocols. Today, a new student or researcher must assemble a collection of scattered conference publications, which are typically terse and commonly use different notations and terminologies. This book provides a self-contained explanation of the mathematics to readers with computer science backgrounds, as well as explaining computer science concepts to readers with backgrounds in applied mathematics. The first section presents mathematical notions and models, including message passing and shared-memory systems, failures, and timing models. The next section presents core concepts in two chapters each: first, proving a simple result that lends itself to examples and pictures that will build up readers' intuition; then generalizing the concept to prove a more sophisticated result. The overall result weaves together and develops the basic concepts of the field, presenting them in a gradual and intuitively appealing way. The book's final section discusses advanced topics typically found in a graduate-level course for those who wish to explore further. Gathers knowledge otherwise spread across research and conference papers using consistent notations and a standard approach to facilitate understandingPresents unique insights applicable to multiple computing fields, including multicore microprocessors, wireless networks, distributed systems, and Internet protocols Synthesizes and distills material into a simple, unified presentation with examples, illustrations, and exercises</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS / Computer Literacy</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS / Computer Science</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS / Data Processing</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS / Hardware / General</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS / Information Technology</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS / Machine Theory</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS / Reference</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Combinatorial topology</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Electronic data processing</subfield><subfield code="x">Distributed processing</subfield><subfield code="x">Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorial topology</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kombinatorische Topologie</subfield><subfield code="0">(DE-588)4137530-0</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="689" ind1="0" 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="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Kombinatorische Topologie</subfield><subfield code="0">(DE-588)4137530-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kozlov, D. N.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Rajsbaum, Sergio</subfield><subfield code="4">aut</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">0124045782</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9780124045781</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://www.sciencedirect.com/science/book/9780124045781</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-33-ESD</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-031506757</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="883" ind1="1" ind2=" "><subfield code="8">2\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">http://www.sciencedirect.com/science/book/9780124045781</subfield><subfield code="l">FLA01</subfield><subfield code="p">ZDB-33-ESD</subfield><subfield code="q">FLA_PDA_ESD</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV046126304 |
| illustrated | Illustrated |
| indexdate | 2024-07-10T08:35:53Z |
| institution | BVB |
| isbn | 9780124047280 0124047289 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-031506757 |
| oclc_num | 864899516 |
| open_access_boolean | |
| physical | 1 online resource (xiv, 319 pages) illustrations (some color) |
| psigel | ZDB-33-ESD ZDB-33-ESD FLA_PDA_ESD |
| publishDate | 2014 |
| publishDateSearch | 2014 |
| publishDateSort | 2014 |
| publisher | Elsevier/Morgan Kaufmann |
| record_format | marc |
| spelling | Herlihy, Maurice Verfasser aut Distributed computing through combinatorial topology Maurice Herlihy, Dmitry Kozlov, Sergio Rajsbaum Amsterdam Elsevier/Morgan Kaufmann [2014] © 2014 1 online resource (xiv, 319 pages) illustrations (some color) txt rdacontent c rdamedia cr rdacarrier Includes bibliographical references and index Distributed Computing Through Combinatorial Topology describes techniques for analyzing distributed algorithms based on award winning combinatorial topology research. The authors present a solid theoretical foundation relevant to many real systems reliant on parallelism with unpredictable delays, such as multicore microprocessors, wireless networks, distributed systems, and Internet protocols. Today, a new student or researcher must assemble a collection of scattered conference publications, which are typically terse and commonly use different notations and terminologies. This book provides a self-contained explanation of the mathematics to readers with computer science backgrounds, as well as explaining computer science concepts to readers with backgrounds in applied mathematics. The first section presents mathematical notions and models, including message passing and shared-memory systems, failures, and timing models. The next section presents core concepts in two chapters each: first, proving a simple result that lends itself to examples and pictures that will build up readers' intuition; then generalizing the concept to prove a more sophisticated result. The overall result weaves together and develops the basic concepts of the field, presenting them in a gradual and intuitively appealing way. The book's final section discusses advanced topics typically found in a graduate-level course for those who wish to explore further. Gathers knowledge otherwise spread across research and conference papers using consistent notations and a standard approach to facilitate understandingPresents unique insights applicable to multiple computing fields, including multicore microprocessors, wireless networks, distributed systems, and Internet protocols Synthesizes and distills material into a simple, unified presentation with examples, illustrations, and exercises COMPUTERS / Computer Literacy bisacsh COMPUTERS / Computer Science bisacsh COMPUTERS / Data Processing bisacsh COMPUTERS / Hardware / General bisacsh COMPUTERS / Information Technology bisacsh COMPUTERS / Machine Theory bisacsh COMPUTERS / Reference bisacsh Combinatorial topology fast Electronic data processing Distributed processing Mathematics Combinatorial topology Kombinatorische Topologie (DE-588)4137530-0 gnd rswk-swf Verteiltes System (DE-588)4238872-7 gnd rswk-swf Verteiltes System (DE-588)4238872-7 s 1\p DE-604 Kombinatorische Topologie (DE-588)4137530-0 s 2\p DE-604 Kozlov, D. N. aut Rajsbaum, Sergio aut Erscheint auch als Druck-Ausgabe 0124045782 Erscheint auch als Druck-Ausgabe 9780124045781 http://www.sciencedirect.com/science/book/9780124045781 Verlag URL des Erstveröffentlichers Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Herlihy, Maurice Kozlov, D. N. Rajsbaum, Sergio Distributed computing through combinatorial topology COMPUTERS / Computer Literacy bisacsh COMPUTERS / Computer Science bisacsh COMPUTERS / Data Processing bisacsh COMPUTERS / Hardware / General bisacsh COMPUTERS / Information Technology bisacsh COMPUTERS / Machine Theory bisacsh COMPUTERS / Reference bisacsh Combinatorial topology fast Electronic data processing Distributed processing Mathematics Combinatorial topology Kombinatorische Topologie (DE-588)4137530-0 gnd Verteiltes System (DE-588)4238872-7 gnd |
| subject_GND | (DE-588)4137530-0 (DE-588)4238872-7 |
| title | Distributed computing through combinatorial topology |
| title_auth | Distributed computing through combinatorial topology |
| title_exact_search | Distributed computing through combinatorial topology |
| title_full | Distributed computing through combinatorial topology Maurice Herlihy, Dmitry Kozlov, Sergio Rajsbaum |
| title_fullStr | Distributed computing through combinatorial topology Maurice Herlihy, Dmitry Kozlov, Sergio Rajsbaum |
| title_full_unstemmed | Distributed computing through combinatorial topology Maurice Herlihy, Dmitry Kozlov, Sergio Rajsbaum |
| title_short | Distributed computing through combinatorial topology |
| title_sort | distributed computing through combinatorial topology |
| topic | COMPUTERS / Computer Literacy bisacsh COMPUTERS / Computer Science bisacsh COMPUTERS / Data Processing bisacsh COMPUTERS / Hardware / General bisacsh COMPUTERS / Information Technology bisacsh COMPUTERS / Machine Theory bisacsh COMPUTERS / Reference bisacsh Combinatorial topology fast Electronic data processing Distributed processing Mathematics Combinatorial topology Kombinatorische Topologie (DE-588)4137530-0 gnd Verteiltes System (DE-588)4238872-7 gnd |
| topic_facet | COMPUTERS / Computer Literacy COMPUTERS / Computer Science COMPUTERS / Data Processing COMPUTERS / Hardware / General COMPUTERS / Information Technology COMPUTERS / Machine Theory COMPUTERS / Reference Combinatorial topology Electronic data processing Distributed processing Mathematics Kombinatorische Topologie Verteiltes System |
| url | http://www.sciencedirect.com/science/book/9780124045781 |
| work_keys_str_mv | AT herlihymaurice distributedcomputingthroughcombinatorialtopology AT kozlovdn distributedcomputingthroughcombinatorialtopology AT rajsbaumsergio distributedcomputingthroughcombinatorialtopology |