Impact of communication networks on fault tolerant distributed computing:
When the desired reliability of a computing system exceeds that of its individual hardware components the need for fault-tolerant systems arise. While distributed systems have the potential to achieve highly reliable computing, programming them is a challenging task. Several paradigms have been iden...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Ithaca, New York
1986
|
| Series: | Cornell University <Ithaca, NY> / Department of Computer Science: Technical report
748 |
| Subjects: | |
| Summary: | When the desired reliability of a computing system exceeds that of its individual hardware components the need for fault-tolerant systems arise. While distributed systems have the potential to achieve highly reliable computing, programming them is a challenging task. Several paradigms have been identified that can simplify the conceptual design of fault-tolerant distributed systems Properties of a distributed system have profound implications on the solvability and efficiency of implementations of these paradigms. In this thesis we study the effect that different communication models have on the efficiency of fault-tolerant computing. As an instance of a fundamental operation we examine protocols for reliable broadcast in distributed systems. Our main contribution is the characterization of the time complexity of reliable broadcast with respect to communication models. A practical consequence of our results is the development of efficient reliable broadcast protocols with respect to communication models. A variety of common networks are shown to support this style of communication. In fact, by parameterizing the minimum multicast size and diameter of these networks, we are able to characterize all known network architectures Distributed systems where processors perceive the same approximate time makes programming them much easier. Clock synchronization protocols implement this abstraction given only clocks that have bounded drift rates with respect to real time. We show how a primitive which is normally used only for communication in a distributed system can also be used for synchronizing clocks. If this primitive occurs naturally with a sufficient frequency, clock synchronization can be achieved at no additional message cost |
| Item Description: | Zugl.: Ithaca, NY, Cornell Univ., Diss., 1986 |
| Physical Description: | VIII, 83 Sp. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010586633 | ||
| 003 | DE-604 | ||
| 005 | 19970310 | ||
| 007 | t | ||
| 008 | 960126s1986 m||| 00||| engod | ||
| 035 | |a (OCoLC)15729196 | ||
| 035 | |a (DE-599)BVBBV010586633 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 084 | |a DAT 516f |2 stub | ||
| 100 | 1 | |a Drummond, Rogério |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Impact of communication networks on fault tolerant distributed computing |
| 264 | 1 | |a Ithaca, New York |c 1986 | |
| 300 | |a VIII, 83 Sp. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Cornell University <Ithaca, NY> / Department of Computer Science: Technical report |v 748 | |
| 500 | |a Zugl.: Ithaca, NY, Cornell Univ., Diss., 1986 | ||
| 520 | 3 | |a When the desired reliability of a computing system exceeds that of its individual hardware components the need for fault-tolerant systems arise. While distributed systems have the potential to achieve highly reliable computing, programming them is a challenging task. Several paradigms have been identified that can simplify the conceptual design of fault-tolerant distributed systems | |
| 520 | 3 | |a Properties of a distributed system have profound implications on the solvability and efficiency of implementations of these paradigms. In this thesis we study the effect that different communication models have on the efficiency of fault-tolerant computing. As an instance of a fundamental operation we examine protocols for reliable broadcast in distributed systems. Our main contribution is the characterization of the time complexity of reliable broadcast with respect to communication models. A practical consequence of our results is the development of efficient reliable broadcast protocols with respect to communication models. A variety of common networks are shown to support this style of communication. In fact, by parameterizing the minimum multicast size and diameter of these networks, we are able to characterize all known network architectures | |
| 520 | 3 | |a Distributed systems where processors perceive the same approximate time makes programming them much easier. Clock synchronization protocols implement this abstraction given only clocks that have bounded drift rates with respect to real time. We show how a primitive which is normally used only for communication in a distributed system can also be used for synchronizing clocks. If this primitive occurs naturally with a sufficient frequency, clock synchronization can be achieved at no additional message cost | |
| 650 | 4 | |a Computer networks | |
| 650 | 4 | |a Fault-tolerant computing | |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 810 | 2 | |a Department of Computer Science: Technical report |t Cornell University <Ithaca, NY> |v 748 |w (DE-604)BV006185504 |9 748 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007058902 | ||
Record in the Search Index
| _version_ | 1804125056683474944 |
|---|---|
| any_adam_object | |
| author | Drummond, Rogério |
| author_facet | Drummond, Rogério |
| author_role | aut |
| author_sort | Drummond, Rogério |
| author_variant | r d rd |
| building | Verbundindex |
| bvnumber | BV010586633 |
| classification_tum | DAT 516f |
| ctrlnum | (OCoLC)15729196 (DE-599)BVBBV010586633 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02937nam a2200361 cb4500</leader><controlfield tag="001">BV010586633</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19970310 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960126s1986 m||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)15729196</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010586633</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 516f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Drummond, Rogério</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Impact of communication networks on fault tolerant distributed computing</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Ithaca, New York</subfield><subfield code="c">1986</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">VIII, 83 Sp.</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">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Cornell University <Ithaca, NY> / Department of Computer Science: Technical report</subfield><subfield code="v">748</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Zugl.: Ithaca, NY, Cornell Univ., Diss., 1986</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">When the desired reliability of a computing system exceeds that of its individual hardware components the need for fault-tolerant systems arise. While distributed systems have the potential to achieve highly reliable computing, programming them is a challenging task. Several paradigms have been identified that can simplify the conceptual design of fault-tolerant distributed systems</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Properties of a distributed system have profound implications on the solvability and efficiency of implementations of these paradigms. In this thesis we study the effect that different communication models have on the efficiency of fault-tolerant computing. As an instance of a fundamental operation we examine protocols for reliable broadcast in distributed systems. Our main contribution is the characterization of the time complexity of reliable broadcast with respect to communication models. A practical consequence of our results is the development of efficient reliable broadcast protocols with respect to communication models. A variety of common networks are shown to support this style of communication. In fact, by parameterizing the minimum multicast size and diameter of these networks, we are able to characterize all known network architectures</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Distributed systems where processors perceive the same approximate time makes programming them much easier. Clock synchronization protocols implement this abstraction given only clocks that have bounded drift rates with respect to real time. We show how a primitive which is normally used only for communication in a distributed system can also be used for synchronizing clocks. If this primitive occurs naturally with a sufficient frequency, clock synchronization can be achieved at no additional message cost</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer networks</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Fault-tolerant computing</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Technical report</subfield><subfield code="t">Cornell University <Ithaca, NY></subfield><subfield code="v">748</subfield><subfield code="w">(DE-604)BV006185504</subfield><subfield code="9">748</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007058902</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV010586633 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:55:30Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007058902 |
| oclc_num | 15729196 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | VIII, 83 Sp. |
| publishDate | 1986 |
| publishDateSearch | 1986 |
| publishDateSort | 1986 |
| record_format | marc |
| series2 | Cornell University <Ithaca, NY> / Department of Computer Science: Technical report |
| spelling | Drummond, Rogério Verfasser aut Impact of communication networks on fault tolerant distributed computing Ithaca, New York 1986 VIII, 83 Sp. txt rdacontent n rdamedia nc rdacarrier Cornell University <Ithaca, NY> / Department of Computer Science: Technical report 748 Zugl.: Ithaca, NY, Cornell Univ., Diss., 1986 When the desired reliability of a computing system exceeds that of its individual hardware components the need for fault-tolerant systems arise. While distributed systems have the potential to achieve highly reliable computing, programming them is a challenging task. Several paradigms have been identified that can simplify the conceptual design of fault-tolerant distributed systems Properties of a distributed system have profound implications on the solvability and efficiency of implementations of these paradigms. In this thesis we study the effect that different communication models have on the efficiency of fault-tolerant computing. As an instance of a fundamental operation we examine protocols for reliable broadcast in distributed systems. Our main contribution is the characterization of the time complexity of reliable broadcast with respect to communication models. A practical consequence of our results is the development of efficient reliable broadcast protocols with respect to communication models. A variety of common networks are shown to support this style of communication. In fact, by parameterizing the minimum multicast size and diameter of these networks, we are able to characterize all known network architectures Distributed systems where processors perceive the same approximate time makes programming them much easier. Clock synchronization protocols implement this abstraction given only clocks that have bounded drift rates with respect to real time. We show how a primitive which is normally used only for communication in a distributed system can also be used for synchronizing clocks. If this primitive occurs naturally with a sufficient frequency, clock synchronization can be achieved at no additional message cost Computer networks Fault-tolerant computing (DE-588)4113937-9 Hochschulschrift gnd-content Department of Computer Science: Technical report Cornell University <Ithaca, NY> 748 (DE-604)BV006185504 748 |
| spellingShingle | Drummond, Rogério Impact of communication networks on fault tolerant distributed computing Computer networks Fault-tolerant computing |
| subject_GND | (DE-588)4113937-9 |
| title | Impact of communication networks on fault tolerant distributed computing |
| title_auth | Impact of communication networks on fault tolerant distributed computing |
| title_exact_search | Impact of communication networks on fault tolerant distributed computing |
| title_full | Impact of communication networks on fault tolerant distributed computing |
| title_fullStr | Impact of communication networks on fault tolerant distributed computing |
| title_full_unstemmed | Impact of communication networks on fault tolerant distributed computing |
| title_short | Impact of communication networks on fault tolerant distributed computing |
| title_sort | impact of communication networks on fault tolerant distributed computing |
| topic | Computer networks Fault-tolerant computing |
| topic_facet | Computer networks Fault-tolerant computing Hochschulschrift |
| volume_link | (DE-604)BV006185504 |
| work_keys_str_mv | AT drummondrogerio impactofcommunicationnetworksonfaulttolerantdistributedcomputing |