Optimality of wait-free atomic multiwriter variables:
Abstract: "Known implementations of concurrent wait-free atomic shared multiwriter variables use [Theta](n) control bits per subvariable. It has been shown that implementations of sequential time-stamp systems require [Omega](n) control bits per subvariable. We exhibit a sequential wait-free at...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Amsterdam
1991
|
| Series: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
91,28 |
| Subjects: | |
| Summary: | Abstract: "Known implementations of concurrent wait-free atomic shared multiwriter variables use [Theta](n) control bits per subvariable. It has been shown that implementations of sequential time-stamp systems require [Omega](n) control bits per subvariable. We exhibit a sequential wait-free atomic shared multiwriter variable construction using log n control bits per subvariable. There arises the question of the optimality of concurrent implementations of the same, and of weak time-stamp systems. We also show that our solutions are self-stabilizing." |
| Physical Description: | 8 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009225179 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940313s1991 |||| 00||| eng d | ||
| 035 | |a (OCoLC)27320690 | ||
| 035 | |a (DE-599)BVBBV009225179 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Li, Ming |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Optimality of wait-free atomic multiwriter variables |c M. Li ; P. M. B. Vitányi |
| 264 | 1 | |a Amsterdam |c 1991 | |
| 300 | |a 8 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 91,28 | |
| 520 | 3 | |a Abstract: "Known implementations of concurrent wait-free atomic shared multiwriter variables use [Theta](n) control bits per subvariable. It has been shown that implementations of sequential time-stamp systems require [Omega](n) control bits per subvariable. We exhibit a sequential wait-free atomic shared multiwriter variable construction using log n control bits per subvariable. There arises the question of the optimality of concurrent implementations of the same, and of weak time-stamp systems. We also show that our solutions are self-stabilizing." | |
| 650 | 4 | |a Distributed parameter systems | |
| 700 | 1 | |a Vitányi, Paul M. |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 91,28 |w (DE-604)BV008928356 |9 91,28 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006134287 | ||
Record in the Search Index
| _version_ | 1804123668314324992 |
|---|---|
| any_adam_object | |
| author | Li, Ming Vitányi, Paul M. |
| author_facet | Li, Ming Vitányi, Paul M. |
| author_role | aut aut |
| author_sort | Li, Ming |
| author_variant | m l ml p m v pm pmv |
| building | Verbundindex |
| bvnumber | BV009225179 |
| ctrlnum | (OCoLC)27320690 (DE-599)BVBBV009225179 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01577nam a2200301 cb4500</leader><controlfield tag="001">BV009225179</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940313s1991 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)27320690</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009225179</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">Li, Ming</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Optimality of wait-free atomic multiwriter variables</subfield><subfield code="c">M. Li ; P. M. B. Vitányi</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">8 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">91,28</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Known implementations of concurrent wait-free atomic shared multiwriter variables use [Theta](n) control bits per subvariable. It has been shown that implementations of sequential time-stamp systems require [Omega](n) control bits per subvariable. We exhibit a sequential wait-free atomic shared multiwriter variable construction using log n control bits per subvariable. There arises the question of the optimality of concurrent implementations of the same, and of weak time-stamp systems. We also show that our solutions are self-stabilizing."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Distributed parameter systems</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Vitányi, Paul M.</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">91,28</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">91,28</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006134287</subfield></datafield></record></collection> |
| id | DE-604.BV009225179 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:33:26Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006134287 |
| oclc_num | 27320690 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 8 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Li, Ming Verfasser aut Optimality of wait-free atomic multiwriter variables M. Li ; P. M. B. Vitányi Amsterdam 1991 8 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 91,28 Abstract: "Known implementations of concurrent wait-free atomic shared multiwriter variables use [Theta](n) control bits per subvariable. It has been shown that implementations of sequential time-stamp systems require [Omega](n) control bits per subvariable. We exhibit a sequential wait-free atomic shared multiwriter variable construction using log n control bits per subvariable. There arises the question of the optimality of concurrent implementations of the same, and of weak time-stamp systems. We also show that our solutions are self-stabilizing." Distributed parameter systems Vitányi, Paul M. Verfasser aut Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 91,28 (DE-604)BV008928356 91,28 |
| spellingShingle | Li, Ming Vitányi, Paul M. Optimality of wait-free atomic multiwriter variables Distributed parameter systems |
| title | Optimality of wait-free atomic multiwriter variables |
| title_auth | Optimality of wait-free atomic multiwriter variables |
| title_exact_search | Optimality of wait-free atomic multiwriter variables |
| title_full | Optimality of wait-free atomic multiwriter variables M. Li ; P. M. B. Vitányi |
| title_fullStr | Optimality of wait-free atomic multiwriter variables M. Li ; P. M. B. Vitányi |
| title_full_unstemmed | Optimality of wait-free atomic multiwriter variables M. Li ; P. M. B. Vitányi |
| title_short | Optimality of wait-free atomic multiwriter variables |
| title_sort | optimality of wait free atomic multiwriter variables |
| topic | Distributed parameter systems |
| topic_facet | Distributed parameter systems |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT liming optimalityofwaitfreeatomicmultiwritervariables AT vitanyipaulm optimalityofwaitfreeatomicmultiwritervariables |