Linear-time snapshot protocols for unbalanced systems:
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Amsterdam
1992
|
| Series: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
92,36 |
| Subjects: | |
| Abstract: | Abstract: "The snapshot problem for shared memory systems is to enable a set of processors called scanners to obtain a consistent picture of the shared memory while other processors called updaters keep updating memory locations concurrently. One of the most intriguing open-problems in wait-free distributed computing is the existence of a linear-time solution to this problem. In this paper we show that if the number of either scanners of updaters is smaller than the square root of the total number of processors then such a linear solution exists." |
| Physical Description: | 10 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009015244 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t| | ||
| 008 | 940206s1992 xx |||| 00||| eng d | ||
| 035 | |a (OCoLC)27824592 | ||
| 035 | |a (DE-599)BVBBV009015244 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Israeli, Amos |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Linear-time snapshot protocols for unbalanced systems |c A. Israeli ; A. Shaham ; A. Shirazi |
| 264 | 1 | |a Amsterdam |c 1992 | |
| 300 | |a 10 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 92,36 | |
| 520 | 3 | |a Abstract: "The snapshot problem for shared memory systems is to enable a set of processors called scanners to obtain a consistent picture of the shared memory while other processors called updaters keep updating memory locations concurrently. One of the most intriguing open-problems in wait-free distributed computing is the existence of a linear-time solution to this problem. In this paper we show that if the number of either scanners of updaters is smaller than the square root of the total number of processors then such a linear solution exists." | |
| 650 | 4 | |a Computer network protocols | |
| 700 | 1 | |a Shaham, Amnon |e Verfasser |4 aut | |
| 700 | 1 | |a Shirazi, Asaf |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 92,36 |w (DE-604)BV008928356 |9 92,36 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-005960899 | |
Record in the Search Index
| _version_ | 1818951188737949696 |
|---|---|
| any_adam_object | |
| author | Israeli, Amos Shaham, Amnon Shirazi, Asaf |
| author_facet | Israeli, Amos Shaham, Amnon Shirazi, Asaf |
| author_role | aut aut aut |
| author_sort | Israeli, Amos |
| author_variant | a i ai a s as a s as |
| building | Verbundindex |
| bvnumber | BV009015244 |
| ctrlnum | (OCoLC)27824592 (DE-599)BVBBV009015244 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01631nam a2200313 cb4500</leader><controlfield tag="001">BV009015244</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">940206s1992 xx |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)27824592</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009015244</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">Israeli, Amos</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Linear-time snapshot protocols for unbalanced systems</subfield><subfield code="c">A. Israeli ; A. Shaham ; A. Shirazi</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">10 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">92,36</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "The snapshot problem for shared memory systems is to enable a set of processors called scanners to obtain a consistent picture of the shared memory while other processors called updaters keep updating memory locations concurrently. One of the most intriguing open-problems in wait-free distributed computing is the existence of a linear-time solution to this problem. In this paper we show that if the number of either scanners of updaters is smaller than the square root of the total number of processors then such a linear solution exists."</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">Shaham, Amnon</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Shirazi, Asaf</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">92,36</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">92,36</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005960899</subfield></datafield></record></collection> |
| id | DE-604.BV009015244 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T09:30:31Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005960899 |
| oclc_num | 27824592 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 10 S. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Israeli, Amos Verfasser aut Linear-time snapshot protocols for unbalanced systems A. Israeli ; A. Shaham ; A. Shirazi Amsterdam 1992 10 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 92,36 Abstract: "The snapshot problem for shared memory systems is to enable a set of processors called scanners to obtain a consistent picture of the shared memory while other processors called updaters keep updating memory locations concurrently. One of the most intriguing open-problems in wait-free distributed computing is the existence of a linear-time solution to this problem. In this paper we show that if the number of either scanners of updaters is smaller than the square root of the total number of processors then such a linear solution exists." Computer network protocols Shaham, Amnon Verfasser aut Shirazi, Asaf Verfasser aut Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 92,36 (DE-604)BV008928356 92,36 |
| spellingShingle | Israeli, Amos Shaham, Amnon Shirazi, Asaf Linear-time snapshot protocols for unbalanced systems Computer network protocols |
| title | Linear-time snapshot protocols for unbalanced systems |
| title_auth | Linear-time snapshot protocols for unbalanced systems |
| title_exact_search | Linear-time snapshot protocols for unbalanced systems |
| title_full | Linear-time snapshot protocols for unbalanced systems A. Israeli ; A. Shaham ; A. Shirazi |
| title_fullStr | Linear-time snapshot protocols for unbalanced systems A. Israeli ; A. Shaham ; A. Shirazi |
| title_full_unstemmed | Linear-time snapshot protocols for unbalanced systems A. Israeli ; A. Shaham ; A. Shirazi |
| title_short | Linear-time snapshot protocols for unbalanced systems |
| title_sort | linear time snapshot protocols for unbalanced systems |
| topic | Computer network protocols |
| topic_facet | Computer network protocols |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT israeliamos lineartimesnapshotprotocolsforunbalancedsystems AT shahamamnon lineartimesnapshotprotocolsforunbalancedsystems AT shiraziasaf lineartimesnapshotprotocolsforunbalancedsystems |