Self-Stabilizing Wavelets and r-Hops Coordination

Self-Stabilizing Wavelets and r-Hops Coordination

Rapport Interne (01/04/2007) We introduce a simple tool called the wavelet (or, r-wavelet) scheme. Wavelets deals with coordination among processes which are at most r hops away of each other. We present a selfstabilizing solution for this scheme. Our solution requires no underlying structure and wo...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Boulinier, Christian, Petit, Franck
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science - Distributed, Parallel, and Cluster Computing
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Boulinier, Christian
Petit, Franck
description Rapport Interne (01/04/2007) We introduce a simple tool called the wavelet (or, r-wavelet) scheme. Wavelets deals with coordination among processes which are at most r hops away of each other. We present a selfstabilizing solution for this scheme. Our solution requires no underlying structure and works in arbritrary anonymous networks, i.e., no process identifier is required. Moreover, our solution works under any (even unfair) daemon. Next, we use the wavelet scheme to design self-stabilizing layer clocks. We show that they provide an efficient device in the design of local coordination problems at distance r, i.e., r-barrier synchronization and r-local resource allocation (LRA) such as r-local mutual exclusion (LME), r-group mutual exclusion (GME), and r-Reader/Writers. Some solutions to the r-LRA problem (e.g., r-LME) also provide transformers to transform algorithms written assuming any r-central daemon into algorithms working with any distributed daemon.
doi_str_mv 10.48550/arxiv.0706.4015
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_0706_4015</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>0706_4015</sourcerecordid><originalsourceid>FETCH-LOGICAL-a655-25b0a57e4686c8562bebfd8155fff5e9c8a15af4d52dd971f70a08db6d96ccca3</originalsourceid><addsrcrecordid>eNotzrsKwjAUgOEsDqLuTtIXSE1qT5qOUryB4KDgWE5uEqhtSUtRn168TP_28xEy5yxOJQBbYnj4IWYZE3HKOIwJP9vK0XOPylf-5etbdMXBVrbvIqxNFOi-abuoaJpgfI29b-opGTmsOjv7d0Iu282l2NPjaXco1keKAoAmoBhCZlMhhZYgEmWVM5IDOOfA5loiB3SpgcSYPOMuY8ikUcLkQmuNqwlZ_LZfctkGf8fwLD_08kNfvQEkfz6e</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Self-Stabilizing Wavelets and r-Hops Coordination</title><source>arXiv.org</source><creator>Boulinier, Christian ; Petit, Franck</creator><creatorcontrib>Boulinier, Christian ; Petit, Franck</creatorcontrib><description>Rapport Interne (01/04/2007) We introduce a simple tool called the wavelet (or, r-wavelet) scheme. Wavelets deals with coordination among processes which are at most r hops away of each other. We present a selfstabilizing solution for this scheme. Our solution requires no underlying structure and works in arbritrary anonymous networks, i.e., no process identifier is required. Moreover, our solution works under any (even unfair) daemon. Next, we use the wavelet scheme to design self-stabilizing layer clocks. We show that they provide an efficient device in the design of local coordination problems at distance r, i.e., r-barrier synchronization and r-local resource allocation (LRA) such as r-local mutual exclusion (LME), r-group mutual exclusion (GME), and r-Reader/Writers. Some solutions to the r-LRA problem (e.g., r-LME) also provide transformers to transform algorithms written assuming any r-central daemon into algorithms working with any distributed daemon.</description><identifier>DOI: 10.48550/arxiv.0706.4015</identifier><language>eng</language><subject>Computer Science - Distributed, Parallel, and Cluster Computing</subject><creationdate>2007-06</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/0706.4015$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.0706.4015$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Boulinier, Christian</creatorcontrib><creatorcontrib>Petit, Franck</creatorcontrib><title>Self-Stabilizing Wavelets and r-Hops Coordination</title><description>Rapport Interne (01/04/2007) We introduce a simple tool called the wavelet (or, r-wavelet) scheme. Wavelets deals with coordination among processes which are at most r hops away of each other. We present a selfstabilizing solution for this scheme. Our solution requires no underlying structure and works in arbritrary anonymous networks, i.e., no process identifier is required. Moreover, our solution works under any (even unfair) daemon. Next, we use the wavelet scheme to design self-stabilizing layer clocks. We show that they provide an efficient device in the design of local coordination problems at distance r, i.e., r-barrier synchronization and r-local resource allocation (LRA) such as r-local mutual exclusion (LME), r-group mutual exclusion (GME), and r-Reader/Writers. Some solutions to the r-LRA problem (e.g., r-LME) also provide transformers to transform algorithms written assuming any r-central daemon into algorithms working with any distributed daemon.</description><subject>Computer Science - Distributed, Parallel, and Cluster Computing</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2007</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotzrsKwjAUgOEsDqLuTtIXSE1qT5qOUryB4KDgWE5uEqhtSUtRn168TP_28xEy5yxOJQBbYnj4IWYZE3HKOIwJP9vK0XOPylf-5etbdMXBVrbvIqxNFOi-abuoaJpgfI29b-opGTmsOjv7d0Iu282l2NPjaXco1keKAoAmoBhCZlMhhZYgEmWVM5IDOOfA5loiB3SpgcSYPOMuY8ikUcLkQmuNqwlZ_LZfctkGf8fwLD_08kNfvQEkfz6e</recordid><startdate>20070627</startdate><enddate>20070627</enddate><creator>Boulinier, Christian</creator><creator>Petit, Franck</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20070627</creationdate><title>Self-Stabilizing Wavelets and r-Hops Coordination</title><author>Boulinier, Christian ; Petit, Franck</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a655-25b0a57e4686c8562bebfd8155fff5e9c8a15af4d52dd971f70a08db6d96ccca3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2007</creationdate><topic>Computer Science - Distributed, Parallel, and Cluster Computing</topic><toplevel>online_resources</toplevel><creatorcontrib>Boulinier, Christian</creatorcontrib><creatorcontrib>Petit, Franck</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Boulinier, Christian</au><au>Petit, Franck</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Self-Stabilizing Wavelets and r-Hops Coordination</atitle><date>2007-06-27</date><risdate>2007</risdate><abstract>Rapport Interne (01/04/2007) We introduce a simple tool called the wavelet (or, r-wavelet) scheme. Wavelets deals with coordination among processes which are at most r hops away of each other. We present a selfstabilizing solution for this scheme. Our solution requires no underlying structure and works in arbritrary anonymous networks, i.e., no process identifier is required. Moreover, our solution works under any (even unfair) daemon. Next, we use the wavelet scheme to design self-stabilizing layer clocks. We show that they provide an efficient device in the design of local coordination problems at distance r, i.e., r-barrier synchronization and r-local resource allocation (LRA) such as r-local mutual exclusion (LME), r-group mutual exclusion (GME), and r-Reader/Writers. Some solutions to the r-LRA problem (e.g., r-LME) also provide transformers to transform algorithms written assuming any r-central daemon into algorithms working with any distributed daemon.</abstract><doi>10.48550/arxiv.0706.4015</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.0706.4015
ispartof
issn
language eng
recordid cdi_arxiv_primary_0706_4015
source arXiv.org
subjects Computer Science - Distributed, Parallel, and Cluster Computing
title Self-Stabilizing Wavelets and r-Hops Coordination
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-10T16%3A30%3A20IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Self-Stabilizing%20Wavelets%20and%20r-Hops%20Coordination&rft.au=Boulinier,%20Christian&rft.date=2007-06-27&rft_id=info:doi/10.48550/arxiv.0706.4015&rft_dat=%3Carxiv_GOX%3E0706_4015%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true