A lower bound on wait-free counting:
Gespeichert in:
| Beteiligte Personen: | , |
|---|---|
| Format: | Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
Amsterdam
1993
|
| Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
93,7 |
| Schlagwörter: | |
| Abstract: | Abstract: "A couting protocol (mod m) consists of shared memory bits -- referred to as the counter -- and of a procedure for incrementing the counter value by 1 (mod m). The procedure may be executed by many processes concurrently. It is required to satisfy a very weak correctness requirement, namely: the counter is required to show a correct value only in quiescent states -- states in which no process is incrementing the counter. Special cases of counting protocols are 'counting networks' [AHS91] and 'concurrent counters' [MTY92]. We consider the problem of implementing a wait-free counting protocol, assuming that the basic atomic operation of a process is a read-modify-write on a single bit. Let flip(Pr) be the maximum number of times a single increment operation changes the counter bits in a couting protocol Pr. Our main result is: In any wait-free counting protocol Pr which counts modulo m, m divides 2[superscript flip(Pr)]. Thus, flip(Pr) [> or =] log m and m is a power of 2. This result provides interesting generalizations of lower bounds and impossibility results for counting and smoothing networks." |
| Umfang: | 9 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009033860 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t| | ||
| 008 | 940227s1993 xx |||| 00||| eng d | ||
| 035 | |a (OCoLC)31911777 | ||
| 035 | |a (DE-599)BVBBV009033860 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Moran, Shlomo |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a A lower bound on wait-free counting |c Shlomo Moran and Gadi Taubenfeld |
| 264 | 1 | |a Amsterdam |c 1993 | |
| 300 | |a 9 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |v 93,7 | |
| 520 | 3 | |a Abstract: "A couting protocol (mod m) consists of shared memory bits -- referred to as the counter -- and of a procedure for incrementing the counter value by 1 (mod m). The procedure may be executed by many processes concurrently. It is required to satisfy a very weak correctness requirement, namely: the counter is required to show a correct value only in quiescent states -- states in which no process is incrementing the counter. Special cases of counting protocols are 'counting networks' [AHS91] and 'concurrent counters' [MTY92]. We consider the problem of implementing a wait-free counting protocol, assuming that the basic atomic operation of a process is a read-modify-write on a single bit. Let flip(Pr) be the maximum number of times a single increment operation changes the counter bits in a couting protocol Pr. Our main result is: In any wait-free counting protocol Pr which counts modulo m, m divides 2[superscript flip(Pr)]. Thus, flip(Pr) [> or =] log m and m is a power of 2. This result provides interesting generalizations of lower bounds and impossibility results for counting and smoothing networks." | |
| 650 | 4 | |a Computer network protocols | |
| 700 | 1 | |a Taubenfeld, Gadi |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 93,7 |w (DE-604)BV008928356 |9 93,7 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-005976648 | |
Datensatz im Suchindex
| _version_ | 1818951210323935232 |
|---|---|
| any_adam_object | |
| author | Moran, Shlomo Taubenfeld, Gadi |
| author_facet | Moran, Shlomo Taubenfeld, Gadi |
| author_role | aut aut |
| author_sort | Moran, Shlomo |
| author_variant | s m sm g t gt |
| building | Verbundindex |
| bvnumber | BV009033860 |
| ctrlnum | (OCoLC)31911777 (DE-599)BVBBV009033860 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02138nam a2200301 cb4500</leader><controlfield tag="001">BV009033860</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">940227s1993 xx |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)31911777</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009033860</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-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Moran, Shlomo</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A lower bound on wait-free counting</subfield><subfield code="c">Shlomo Moran and Gadi Taubenfeld</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">9 S.</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">Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS</subfield><subfield code="v">93,7</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "A couting protocol (mod m) consists of shared memory bits -- referred to as the counter -- and of a procedure for incrementing the counter value by 1 (mod m). The procedure may be executed by many processes concurrently. It is required to satisfy a very weak correctness requirement, namely: the counter is required to show a correct value only in quiescent states -- states in which no process is incrementing the counter. Special cases of counting protocols are 'counting networks' [AHS91] and 'concurrent counters' [MTY92]. We consider the problem of implementing a wait-free counting protocol, assuming that the basic atomic operation of a process is a read-modify-write on a single bit. Let flip(Pr) be the maximum number of times a single increment operation changes the counter bits in a couting protocol Pr. Our main result is: In any wait-free counting protocol Pr which counts modulo m, m divides 2[superscript flip(Pr)]. Thus, flip(Pr) [> or =] log m and m is a power of 2. This result provides interesting generalizations of lower bounds and impossibility results for counting and smoothing networks."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer network protocols</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Taubenfeld, Gadi</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Report CS</subfield><subfield code="t">Centrum voor Wiskunde en Informatica <Amsterdam></subfield><subfield code="v">93,7</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">93,7</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005976648</subfield></datafield></record></collection> |
| id | DE-604.BV009033860 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T09:30:52Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005976648 |
| oclc_num | 31911777 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 9 S. |
| publishDate | 1993 |
| publishDateSearch | 1993 |
| publishDateSort | 1993 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Moran, Shlomo Verfasser aut A lower bound on wait-free counting Shlomo Moran and Gadi Taubenfeld Amsterdam 1993 9 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 93,7 Abstract: "A couting protocol (mod m) consists of shared memory bits -- referred to as the counter -- and of a procedure for incrementing the counter value by 1 (mod m). The procedure may be executed by many processes concurrently. It is required to satisfy a very weak correctness requirement, namely: the counter is required to show a correct value only in quiescent states -- states in which no process is incrementing the counter. Special cases of counting protocols are 'counting networks' [AHS91] and 'concurrent counters' [MTY92]. We consider the problem of implementing a wait-free counting protocol, assuming that the basic atomic operation of a process is a read-modify-write on a single bit. Let flip(Pr) be the maximum number of times a single increment operation changes the counter bits in a couting protocol Pr. Our main result is: In any wait-free counting protocol Pr which counts modulo m, m divides 2[superscript flip(Pr)]. Thus, flip(Pr) [> or =] log m and m is a power of 2. This result provides interesting generalizations of lower bounds and impossibility results for counting and smoothing networks." Computer network protocols Taubenfeld, Gadi Verfasser aut Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 93,7 (DE-604)BV008928356 93,7 |
| spellingShingle | Moran, Shlomo Taubenfeld, Gadi A lower bound on wait-free counting Computer network protocols |
| title | A lower bound on wait-free counting |
| title_auth | A lower bound on wait-free counting |
| title_exact_search | A lower bound on wait-free counting |
| title_full | A lower bound on wait-free counting Shlomo Moran and Gadi Taubenfeld |
| title_fullStr | A lower bound on wait-free counting Shlomo Moran and Gadi Taubenfeld |
| title_full_unstemmed | A lower bound on wait-free counting Shlomo Moran and Gadi Taubenfeld |
| title_short | A lower bound on wait-free counting |
| title_sort | a lower bound on wait free counting |
| topic | Computer network protocols |
| topic_facet | Computer network protocols |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT moranshlomo alowerboundonwaitfreecounting AT taubenfeldgadi alowerboundonwaitfreecounting |