Optimally selecting the parameters of adaptive backoff algorithms for computer networks and multiprocessors:
Abstract: "This dissertation examines the solutions, based on software, adaptive backoff algorithms, to two computer network problems and a shared-memory multiprocessor problem. For each problem we define a cost metric against which we adjust the adaptive backoff algorithm. This dissertation�...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Berkeley, Calif.
1989
|
| Schlagworte: | |
| Zusammenfassung: | Abstract: "This dissertation examines the solutions, based on software, adaptive backoff algorithms, to two computer network problems and a shared-memory multiprocessor problem. For each problem we define a cost metric against which we adjust the adaptive backoff algorithm. This dissertation's unifying theme is that, when possible, backoff algorithms should tune themselves to their environment. The algorithms that we propose are software remedies to hardware shortcomings; they do not require that we periodically measure certain expected values or probability distributions. We devote the majority of this dissertation to studying buffer overflow as it occurs during reliable, local area network, multicast We develop a multiple round, soft real-time algorithm that trades latency for computational overhead: an n-round multicast is slower but suffers less computational overhead than an (n+1)-round multicast. Our prototype system measures the buffer service time distribution and employs it to calculate the algorithm's retransmission timeouts. We develop a preemptive, limited buffer queueing model that accurately models an operating system's communication protocol processes. We study a memory contention problem that occurs during synchronization of bus-oriented, shared-memory multiprocessors with snoopy, invalidation-based caches The contention occurs when such multiprocessors cache lock variables, lack advanced synchronization instructions, and synchronize with a test-and-set instruction embedded in a busy waiting loop. This type of synchronization structure has been dubbed a spin-lock. When a spin-lock is released, the cache invalidation signal can cause a burst of memory activity that we call an invalidation storm. Remedies for invalidation storms can waste memory cycles. Our spin-lock backoff algorithm wastes twenty to fifty percent fewer cycles than a recently proposed algorithm. We consider how to calculate remote procedure call retransmission timeouts on lossy networks and on tariff-bearing networks with selectable grades of service |
| Beschreibung: | Berkeley, Calif., Univ., Diss. |
| Beschreibung: | 78 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV004160043 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 901119s1989 d||| m||| 00||| eng d | ||
| 035 | |a (OCoLC)21991724 | ||
| 035 | |a (DE-599)BVBBV004160043 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 050 | 0 | |a TK7885.A1 | |
| 084 | |a DAT 250d |2 stub | ||
| 084 | |a DAT 212d |2 stub | ||
| 088 | |a UCB CSD 89 542 | ||
| 100 | 1 | |a Danzig, Peter B. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Optimally selecting the parameters of adaptive backoff algorithms for computer networks and multiprocessors |
| 246 | 1 | 3 | |a UCB CSD 89 542 |
| 264 | 1 | |a Berkeley, Calif. |c 1989 | |
| 300 | |a 78 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a Berkeley, Calif., Univ., Diss. | ||
| 520 | 3 | |a Abstract: "This dissertation examines the solutions, based on software, adaptive backoff algorithms, to two computer network problems and a shared-memory multiprocessor problem. For each problem we define a cost metric against which we adjust the adaptive backoff algorithm. This dissertation's unifying theme is that, when possible, backoff algorithms should tune themselves to their environment. The algorithms that we propose are software remedies to hardware shortcomings; they do not require that we periodically measure certain expected values or probability distributions. We devote the majority of this dissertation to studying buffer overflow as it occurs during reliable, local area network, multicast | |
| 520 | 3 | |a We develop a multiple round, soft real-time algorithm that trades latency for computational overhead: an n-round multicast is slower but suffers less computational overhead than an (n+1)-round multicast. Our prototype system measures the buffer service time distribution and employs it to calculate the algorithm's retransmission timeouts. We develop a preemptive, limited buffer queueing model that accurately models an operating system's communication protocol processes. We study a memory contention problem that occurs during synchronization of bus-oriented, shared-memory multiprocessors with snoopy, invalidation-based caches | |
| 520 | 3 | |a The contention occurs when such multiprocessors cache lock variables, lack advanced synchronization instructions, and synchronize with a test-and-set instruction embedded in a busy waiting loop. This type of synchronization structure has been dubbed a spin-lock. When a spin-lock is released, the cache invalidation signal can cause a burst of memory activity that we call an invalidation storm. Remedies for invalidation storms can waste memory cycles. Our spin-lock backoff algorithm wastes twenty to fifty percent fewer cycles than a recently proposed algorithm. We consider how to calculate remote procedure call retransmission timeouts on lossy networks and on tariff-bearing networks with selectable grades of service | |
| 650 | 4 | |a Computer networks | |
| 650 | 4 | |a Multiprocessors | |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-002594269 | ||
Datensatz im Suchindex
| _version_ | 1804118371641327616 |
|---|---|
| any_adam_object | |
| author | Danzig, Peter B. |
| author_facet | Danzig, Peter B. |
| author_role | aut |
| author_sort | Danzig, Peter B. |
| author_variant | p b d pb pbd |
| building | Verbundindex |
| bvnumber | BV004160043 |
| callnumber-first | T - Technology |
| callnumber-label | TK7885 |
| callnumber-raw | TK7885.A1 |
| callnumber-search | TK7885.A1 |
| callnumber-sort | TK 47885 A1 |
| callnumber-subject | TK - Electrical and Nuclear Engineering |
| classification_tum | DAT 250d DAT 212d |
| ctrlnum | (OCoLC)21991724 (DE-599)BVBBV004160043 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03129nam a2200373 c 4500</leader><controlfield tag="001">BV004160043</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">901119s1989 d||| m||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)21991724</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV004160043</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="050" ind1=" " ind2="0"><subfield code="a">TK7885.A1</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 250d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 212d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">UCB CSD 89 542</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Danzig, Peter B.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Optimally selecting the parameters of adaptive backoff algorithms for computer networks and multiprocessors</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">UCB CSD 89 542</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berkeley, Calif.</subfield><subfield code="c">1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">78 S.</subfield><subfield code="b">graph. Darst.</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="500" ind1=" " ind2=" "><subfield code="a">Berkeley, Calif., Univ., Diss.</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "This dissertation examines the solutions, based on software, adaptive backoff algorithms, to two computer network problems and a shared-memory multiprocessor problem. For each problem we define a cost metric against which we adjust the adaptive backoff algorithm. This dissertation's unifying theme is that, when possible, backoff algorithms should tune themselves to their environment. The algorithms that we propose are software remedies to hardware shortcomings; they do not require that we periodically measure certain expected values or probability distributions. We devote the majority of this dissertation to studying buffer overflow as it occurs during reliable, local area network, multicast</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">We develop a multiple round, soft real-time algorithm that trades latency for computational overhead: an n-round multicast is slower but suffers less computational overhead than an (n+1)-round multicast. Our prototype system measures the buffer service time distribution and employs it to calculate the algorithm's retransmission timeouts. We develop a preemptive, limited buffer queueing model that accurately models an operating system's communication protocol processes. We study a memory contention problem that occurs during synchronization of bus-oriented, shared-memory multiprocessors with snoopy, invalidation-based caches</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">The contention occurs when such multiprocessors cache lock variables, lack advanced synchronization instructions, and synchronize with a test-and-set instruction embedded in a busy waiting loop. This type of synchronization structure has been dubbed a spin-lock. When a spin-lock is released, the cache invalidation signal can cause a burst of memory activity that we call an invalidation storm. Remedies for invalidation storms can waste memory cycles. Our spin-lock backoff algorithm wastes twenty to fifty percent fewer cycles than a recently proposed algorithm. We consider how to calculate remote procedure call retransmission timeouts on lossy networks and on tariff-bearing networks with selectable grades of service</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer networks</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Multiprocessors</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="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-002594269</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV004160043 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T16:09:14Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-002594269 |
| oclc_num | 21991724 |
| open_access_boolean | |
| physical | 78 S. graph. Darst. |
| publishDate | 1989 |
| publishDateSearch | 1989 |
| publishDateSort | 1989 |
| record_format | marc |
| spelling | Danzig, Peter B. Verfasser aut Optimally selecting the parameters of adaptive backoff algorithms for computer networks and multiprocessors UCB CSD 89 542 Berkeley, Calif. 1989 78 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Berkeley, Calif., Univ., Diss. Abstract: "This dissertation examines the solutions, based on software, adaptive backoff algorithms, to two computer network problems and a shared-memory multiprocessor problem. For each problem we define a cost metric against which we adjust the adaptive backoff algorithm. This dissertation's unifying theme is that, when possible, backoff algorithms should tune themselves to their environment. The algorithms that we propose are software remedies to hardware shortcomings; they do not require that we periodically measure certain expected values or probability distributions. We devote the majority of this dissertation to studying buffer overflow as it occurs during reliable, local area network, multicast We develop a multiple round, soft real-time algorithm that trades latency for computational overhead: an n-round multicast is slower but suffers less computational overhead than an (n+1)-round multicast. Our prototype system measures the buffer service time distribution and employs it to calculate the algorithm's retransmission timeouts. We develop a preemptive, limited buffer queueing model that accurately models an operating system's communication protocol processes. We study a memory contention problem that occurs during synchronization of bus-oriented, shared-memory multiprocessors with snoopy, invalidation-based caches The contention occurs when such multiprocessors cache lock variables, lack advanced synchronization instructions, and synchronize with a test-and-set instruction embedded in a busy waiting loop. This type of synchronization structure has been dubbed a spin-lock. When a spin-lock is released, the cache invalidation signal can cause a burst of memory activity that we call an invalidation storm. Remedies for invalidation storms can waste memory cycles. Our spin-lock backoff algorithm wastes twenty to fifty percent fewer cycles than a recently proposed algorithm. We consider how to calculate remote procedure call retransmission timeouts on lossy networks and on tariff-bearing networks with selectable grades of service Computer networks Multiprocessors (DE-588)4113937-9 Hochschulschrift gnd-content |
| spellingShingle | Danzig, Peter B. Optimally selecting the parameters of adaptive backoff algorithms for computer networks and multiprocessors Computer networks Multiprocessors |
| subject_GND | (DE-588)4113937-9 |
| title | Optimally selecting the parameters of adaptive backoff algorithms for computer networks and multiprocessors |
| title_alt | UCB CSD 89 542 |
| title_auth | Optimally selecting the parameters of adaptive backoff algorithms for computer networks and multiprocessors |
| title_exact_search | Optimally selecting the parameters of adaptive backoff algorithms for computer networks and multiprocessors |
| title_full | Optimally selecting the parameters of adaptive backoff algorithms for computer networks and multiprocessors |
| title_fullStr | Optimally selecting the parameters of adaptive backoff algorithms for computer networks and multiprocessors |
| title_full_unstemmed | Optimally selecting the parameters of adaptive backoff algorithms for computer networks and multiprocessors |
| title_short | Optimally selecting the parameters of adaptive backoff algorithms for computer networks and multiprocessors |
| title_sort | optimally selecting the parameters of adaptive backoff algorithms for computer networks and multiprocessors |
| topic | Computer networks Multiprocessors |
| topic_facet | Computer networks Multiprocessors Hochschulschrift |
| work_keys_str_mv | AT danzigpeterb optimallyselectingtheparametersofadaptivebackoffalgorithmsforcomputernetworksandmultiprocessors AT danzigpeterb ucbcsd89542 |