Self-stabilizing wait-free clock synchronization:
Abstract: "Clock synchronization algorithms which can tolarate [sic] any number of processors that can fail by ceasing operation for an unbounded number of steps and then resuming operation (with or) without knowing that they were faulty are called Wait-Free. Furthermore, if they are also able...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam
1994
|
| Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
94,21 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Clock synchronization algorithms which can tolarate [sic] any number of processors that can fail by ceasing operation for an unbounded number of steps and then resuming operation (with or) without knowing that they were faulty are called Wait-Free. Furthermore, if they are also able to work correctly even when the starting state of the system is arbitrary, they are called Wait-Fre, Self-Stabilizing. This work deals with the problem of Wait-Free, Self-Stabilizing Clock Synchronization of n processes in an 'in-phase' multiprocessor system and presents a solution with synchronization time O(n p2 s). The best previous solution has O(n p3 s) synchronization time The idea of the algorithm is based on a simple analysis of the difficulties of the problem which helped us to see how to 'reparametrize' the O(n p3 s) previously mentioned algorithm in order to get the O(n p2 s) synchronization time solution. Both the protocol presented here and its analysis are very simple. |
| Beschreibung: | 10 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010157187 | ||
| 003 | DE-604 | ||
| 005 | 20040916 | ||
| 007 | t | ||
| 008 | 950427s1994 |||| 00||| engod | ||
| 035 | |a (OCoLC)31483922 | ||
| 035 | |a (DE-599)BVBBV010157187 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Papatriantafilu, Marina |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Self-stabilizing wait-free clock synchronization |c M. Papatriantafilou ; P. Tsigas |
| 264 | 1 | |a Amsterdam |c 1994 | |
| 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 94,21 | |
| 520 | 3 | |a Abstract: "Clock synchronization algorithms which can tolarate [sic] any number of processors that can fail by ceasing operation for an unbounded number of steps and then resuming operation (with or) without knowing that they were faulty are called Wait-Free. Furthermore, if they are also able to work correctly even when the starting state of the system is arbitrary, they are called Wait-Fre, Self-Stabilizing. This work deals with the problem of Wait-Free, Self-Stabilizing Clock Synchronization of n processes in an 'in-phase' multiprocessor system and presents a solution with synchronization time O(n p2 s). The best previous solution has O(n p3 s) synchronization time | |
| 520 | 3 | |a The idea of the algorithm is based on a simple analysis of the difficulties of the problem which helped us to see how to 'reparametrize' the O(n p3 s) previously mentioned algorithm in order to get the O(n p2 s) synchronization time solution. Both the protocol presented here and its analysis are very simple. | |
| 650 | 4 | |a Fault-tolerant computing | |
| 700 | 1 | |a Tsigas, Philippas |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 94,21 |w (DE-604)BV008928356 |9 94,21 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006747206 | ||
Datensatz im Suchindex
| _version_ | 1804124554228924416 |
|---|---|
| any_adam_object | |
| author | Papatriantafilu, Marina Tsigas, Philippas |
| author_facet | Papatriantafilu, Marina Tsigas, Philippas |
| author_role | aut aut |
| author_sort | Papatriantafilu, Marina |
| author_variant | m p mp p t pt |
| building | Verbundindex |
| bvnumber | BV010157187 |
| ctrlnum | (OCoLC)31483922 (DE-599)BVBBV010157187 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02036nam a2200313 cb4500</leader><controlfield tag="001">BV010157187</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040916 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">950427s1994 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)31483922</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010157187</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="100" ind1="1" ind2=" "><subfield code="a">Papatriantafilu, Marina</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Self-stabilizing wait-free clock synchronization</subfield><subfield code="c">M. Papatriantafilou ; P. Tsigas</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1994</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">94,21</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Clock synchronization algorithms which can tolarate [sic] any number of processors that can fail by ceasing operation for an unbounded number of steps and then resuming operation (with or) without knowing that they were faulty are called Wait-Free. Furthermore, if they are also able to work correctly even when the starting state of the system is arbitrary, they are called Wait-Fre, Self-Stabilizing. This work deals with the problem of Wait-Free, Self-Stabilizing Clock Synchronization of n processes in an 'in-phase' multiprocessor system and presents a solution with synchronization time O(n p2 s). The best previous solution has O(n p3 s) synchronization time</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">The idea of the algorithm is based on a simple analysis of the difficulties of the problem which helped us to see how to 'reparametrize' the O(n p3 s) previously mentioned algorithm in order to get the O(n p2 s) synchronization time solution. Both the protocol presented here and its analysis are very simple.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Fault-tolerant computing</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Tsigas, Philippas</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">94,21</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">94,21</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006747206</subfield></datafield></record></collection> |
| id | DE-604.BV010157187 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:47:30Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006747206 |
| oclc_num | 31483922 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 10 S. |
| publishDate | 1994 |
| publishDateSearch | 1994 |
| publishDateSort | 1994 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Papatriantafilu, Marina Verfasser aut Self-stabilizing wait-free clock synchronization M. Papatriantafilou ; P. Tsigas Amsterdam 1994 10 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 94,21 Abstract: "Clock synchronization algorithms which can tolarate [sic] any number of processors that can fail by ceasing operation for an unbounded number of steps and then resuming operation (with or) without knowing that they were faulty are called Wait-Free. Furthermore, if they are also able to work correctly even when the starting state of the system is arbitrary, they are called Wait-Fre, Self-Stabilizing. This work deals with the problem of Wait-Free, Self-Stabilizing Clock Synchronization of n processes in an 'in-phase' multiprocessor system and presents a solution with synchronization time O(n p2 s). The best previous solution has O(n p3 s) synchronization time The idea of the algorithm is based on a simple analysis of the difficulties of the problem which helped us to see how to 'reparametrize' the O(n p3 s) previously mentioned algorithm in order to get the O(n p2 s) synchronization time solution. Both the protocol presented here and its analysis are very simple. Fault-tolerant computing Tsigas, Philippas Verfasser aut Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 94,21 (DE-604)BV008928356 94,21 |
| spellingShingle | Papatriantafilu, Marina Tsigas, Philippas Self-stabilizing wait-free clock synchronization Fault-tolerant computing |
| title | Self-stabilizing wait-free clock synchronization |
| title_auth | Self-stabilizing wait-free clock synchronization |
| title_exact_search | Self-stabilizing wait-free clock synchronization |
| title_full | Self-stabilizing wait-free clock synchronization M. Papatriantafilou ; P. Tsigas |
| title_fullStr | Self-stabilizing wait-free clock synchronization M. Papatriantafilou ; P. Tsigas |
| title_full_unstemmed | Self-stabilizing wait-free clock synchronization M. Papatriantafilou ; P. Tsigas |
| title_short | Self-stabilizing wait-free clock synchronization |
| title_sort | self stabilizing wait free clock synchronization |
| topic | Fault-tolerant computing |
| topic_facet | Fault-tolerant computing |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT papatriantafilumarina selfstabilizingwaitfreeclocksynchronization AT tsigasphilippas selfstabilizingwaitfreeclocksynchronization |