Distributed algorithms:
In Distributed Algorithms, Nancy Lynch provides a blueprint for designing, implementing, and analyzing distributed algorithms. She directs her book at a wide audience, including students, programmers, system designers and researchers
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
San Francisco, Calif.
Morgan Kaufmann
1996
|
| Schriftenreihe: | Morgan Kaufmann series in data management systems
|
| Schlagworte: | |
| Online-Zugang: | DE-739 |
| Zusammenfassung: | In Distributed Algorithms, Nancy Lynch provides a blueprint for designing, implementing, and analyzing distributed algorithms. She directs her book at a wide audience, including students, programmers, system designers and researchers Distributed Algorithms contains the most significant algorithms and impossibility results in the area, all in a simple automata-theoretic setting. The algorithms are proved correct, and their complexity is analyzed according to precisely defined complexity measures. The problems covered include resource allocation, communication, consensus among distributed processes, data consistency, deadlock detection, leader election, global snapshots, and many others The material is organized according to the system model - first by the timing model and then by the interprocess communication mechanism. The material on system models is isolated in separate chapters for easy reference |
| Beschreibung: | 1 Online-Ressource (xxiii, 872 Seiten) |
| ISBN: | 9780080504704 |
Internformat
MARC
| LEADER | 00000nmm a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV047252341 | ||
| 003 | DE-604 | ||
| 005 | 20241023 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 210423s1996 |||| o||u| ||||||engod | ||
| 020 | |a 9780080504704 |9 978-0-08050470-4 | ||
| 035 | |a (OCoLC)1249668999 | ||
| 035 | |a (DE-599)BVBBV047252341 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-739 |a DE-83 | ||
| 050 | 0 | |a QA76.9.A43 | |
| 082 | 0 | |a 004.36 |2 21 | |
| 082 | 0 | |a 005.2/76 |2 21 | |
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 084 | |a ST 200 |0 (DE-625)143611: |2 rvk | ||
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 084 | |a DAT 516d |2 stub | ||
| 100 | 1 | |a Lynch, Nancy A. |d 1948- |e Verfasser |0 (DE-588)121919625 |4 aut | |
| 245 | 1 | 0 | |a Distributed algorithms |c Nancy A. Lynch |
| 264 | 1 | |a San Francisco, Calif. |b Morgan Kaufmann |c 1996 | |
| 300 | |a 1 Online-Ressource (xxiii, 872 Seiten) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Morgan Kaufmann series in data management systems | |
| 520 | 3 | |a In Distributed Algorithms, Nancy Lynch provides a blueprint for designing, implementing, and analyzing distributed algorithms. She directs her book at a wide audience, including students, programmers, system designers and researchers | |
| 520 | |a Distributed Algorithms contains the most significant algorithms and impossibility results in the area, all in a simple automata-theoretic setting. The algorithms are proved correct, and their complexity is analyzed according to precisely defined complexity measures. The problems covered include resource allocation, communication, consensus among distributed processes, data consistency, deadlock detection, leader election, global snapshots, and many others | ||
| 520 | |a The material is organized according to the system model - first by the timing model and then by the interprocess communication mechanism. The material on system models is isolated in separate chapters for easy reference | ||
| 650 | 4 | |a Algorithmes | |
| 650 | 7 | |a Algoritmos e estruturas de dados |2 larpcal | |
| 650 | 4 | |a Réseaux d'ordinateurs | |
| 650 | 4 | |a Traitement réparti | |
| 650 | 4 | |a Datenverarbeitung | |
| 650 | 4 | |a Computer algorithms | |
| 650 | 4 | |a Electronic data processing |x Distributed processing | |
| 650 | 0 | 7 | |a Verteilter Algorithmus |0 (DE-588)4200453-6 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Verteilter Algorithmus |0 (DE-588)4200453-6 |D s |
| 689 | 0 | |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 978-1-55860-348-6 |
| 912 | |a ZDB-30-PQE |a ZDB-4-NLEBK | ||
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-032656402 | |
| 966 | e | |u https://ebookcentral.proquest.com/lib/uni-passau/detail.action?docID=313621 |l DE-739 |p ZDB-30-PQE |q UPA_Einzelkauf_Morgan Kaufmann |x Aggregator |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1813698563352297472 |
|---|---|
| adam_text | |
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Lynch, Nancy A. 1948- |
| author_GND | (DE-588)121919625 |
| author_facet | Lynch, Nancy A. 1948- |
| author_role | aut |
| author_sort | Lynch, Nancy A. 1948- |
| author_variant | n a l na nal |
| building | Verbundindex |
| bvnumber | BV047252341 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.9.A43 |
| callnumber-search | QA76.9.A43 |
| callnumber-sort | QA 276.9 A43 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 130 ST 200 ST 134 |
| classification_tum | DAT 516d |
| collection | ZDB-30-PQE ZDB-4-NLEBK |
| ctrlnum | (OCoLC)1249668999 (DE-599)BVBBV047252341 |
| dewey-full | 004.36 005.2/76 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science 005 - Computer programming, programs, data, security |
| dewey-raw | 004.36 005.2/76 |
| dewey-search | 004.36 005.2/76 |
| dewey-sort | 14.36 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| discipline_str_mv | Informatik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nmm a2200000 c 4500</leader><controlfield tag="001">BV047252341</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20241023</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">210423s1996 |||| o||u| ||||||engod</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780080504704</subfield><subfield code="9">978-0-08050470-4</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1249668999</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV047252341</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="049" ind1=" " ind2=" "><subfield code="a">DE-739</subfield><subfield code="a">DE-83</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.9.A43</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.36</subfield><subfield code="2">21</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.2/76</subfield><subfield code="2">21</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 130</subfield><subfield code="0">(DE-625)143588:</subfield><subfield code="2">rvk</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="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 516d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Lynch, Nancy A.</subfield><subfield code="d">1948-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)121919625</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Distributed algorithms</subfield><subfield code="c">Nancy A. Lynch</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">San Francisco, Calif.</subfield><subfield code="b">Morgan Kaufmann</subfield><subfield code="c">1996</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (xxiii, 872 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="0" ind2=" "><subfield code="a">Morgan Kaufmann series in data management systems</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">In Distributed Algorithms, Nancy Lynch provides a blueprint for designing, implementing, and analyzing distributed algorithms. She directs her book at a wide audience, including students, programmers, system designers and researchers</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Distributed Algorithms contains the most significant algorithms and impossibility results in the area, all in a simple automata-theoretic setting. The algorithms are proved correct, and their complexity is analyzed according to precisely defined complexity measures. The problems covered include resource allocation, communication, consensus among distributed processes, data consistency, deadlock detection, leader election, global snapshots, and many others</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The material is organized according to the system model - first by the timing model and then by the interprocess communication mechanism. The material on system models is isolated in separate chapters for easy reference</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithmes</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algoritmos e estruturas de dados</subfield><subfield code="2">larpcal</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Réseaux d'ordinateurs</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Traitement réparti</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Datenverarbeitung</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Electronic data processing</subfield><subfield code="x">Distributed processing</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Verteilter Algorithmus</subfield><subfield code="0">(DE-588)4200453-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Verteilter Algorithmus</subfield><subfield code="0">(DE-588)4200453-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" 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">Druck-Ausgabe</subfield><subfield code="z">978-1-55860-348-6</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-30-PQE</subfield><subfield code="a">ZDB-4-NLEBK</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-032656402</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://ebookcentral.proquest.com/lib/uni-passau/detail.action?docID=313621</subfield><subfield code="l">DE-739</subfield><subfield code="p">ZDB-30-PQE</subfield><subfield code="q">UPA_Einzelkauf_Morgan Kaufmann</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV047252341 |
| illustrated | Not Illustrated |
| index_date | 2024-07-03T17:08:14Z |
| indexdate | 2024-10-23T10:02:17Z |
| institution | BVB |
| isbn | 9780080504704 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032656402 |
| oclc_num | 1249668999 |
| open_access_boolean | |
| owner | DE-739 DE-83 |
| owner_facet | DE-739 DE-83 |
| physical | 1 Online-Ressource (xxiii, 872 Seiten) |
| psigel | ZDB-30-PQE ZDB-4-NLEBK ZDB-30-PQE UPA_Einzelkauf_Morgan Kaufmann |
| publishDate | 1996 |
| publishDateSearch | 1996 |
| publishDateSort | 1996 |
| publisher | Morgan Kaufmann |
| record_format | marc |
| series2 | Morgan Kaufmann series in data management systems |
| spelling | Lynch, Nancy A. 1948- Verfasser (DE-588)121919625 aut Distributed algorithms Nancy A. Lynch San Francisco, Calif. Morgan Kaufmann 1996 1 Online-Ressource (xxiii, 872 Seiten) txt rdacontent c rdamedia cr rdacarrier Morgan Kaufmann series in data management systems In Distributed Algorithms, Nancy Lynch provides a blueprint for designing, implementing, and analyzing distributed algorithms. She directs her book at a wide audience, including students, programmers, system designers and researchers Distributed Algorithms contains the most significant algorithms and impossibility results in the area, all in a simple automata-theoretic setting. The algorithms are proved correct, and their complexity is analyzed according to precisely defined complexity measures. The problems covered include resource allocation, communication, consensus among distributed processes, data consistency, deadlock detection, leader election, global snapshots, and many others The material is organized according to the system model - first by the timing model and then by the interprocess communication mechanism. The material on system models is isolated in separate chapters for easy reference Algorithmes Algoritmos e estruturas de dados larpcal Réseaux d'ordinateurs Traitement réparti Datenverarbeitung Computer algorithms Electronic data processing Distributed processing Verteilter Algorithmus (DE-588)4200453-6 gnd rswk-swf Verteilter Algorithmus (DE-588)4200453-6 s DE-604 Erscheint auch als Druck-Ausgabe 978-1-55860-348-6 |
| spellingShingle | Lynch, Nancy A. 1948- Distributed algorithms Algorithmes Algoritmos e estruturas de dados larpcal Réseaux d'ordinateurs Traitement réparti Datenverarbeitung Computer algorithms Electronic data processing Distributed processing Verteilter Algorithmus (DE-588)4200453-6 gnd |
| subject_GND | (DE-588)4200453-6 |
| title | Distributed algorithms |
| title_auth | Distributed algorithms |
| title_exact_search | Distributed algorithms |
| title_exact_search_txtP | Distributed algorithms |
| title_full | Distributed algorithms Nancy A. Lynch |
| title_fullStr | Distributed algorithms Nancy A. Lynch |
| title_full_unstemmed | Distributed algorithms Nancy A. Lynch |
| title_short | Distributed algorithms |
| title_sort | distributed algorithms |
| topic | Algorithmes Algoritmos e estruturas de dados larpcal Réseaux d'ordinateurs Traitement réparti Datenverarbeitung Computer algorithms Electronic data processing Distributed processing Verteilter Algorithmus (DE-588)4200453-6 gnd |
| topic_facet | Algorithmes Algoritmos e estruturas de dados Réseaux d'ordinateurs Traitement réparti Datenverarbeitung Computer algorithms Electronic data processing Distributed processing Verteilter Algorithmus |
| work_keys_str_mv | AT lynchnancya distributedalgorithms |