{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:37:53Z","timestamp":1759639073684},"reference-count":8,"publisher":"World Scientific Pub Co Pte Lt","issue":"03n04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2002,9]]},"abstract":"<jats:p> We propose a snap-stabilizing synchronization technique, called the Neighborhood Synchronizer[Formula: see text] that synchronizes nodes with their neighbors in a tree network. The [Formula: see text] scheme has optimal memory requirement \u2014 only one bit per processor. [Formula: see text] is snap-stabilizing [11], meaning that it always behaves according to its specification. The proposed synchronizer being snap-stabilizing is optimal in terms of stabilization time. We show an application of the synchronizer by designing an efficient broadcast algorithm [Formula: see text] in tree networks. [Formula: see text] is also snap-stabilizing and needs only 2h + 2m - 1 rounds to broadcast m messages, where h is the height of the tree. <\/jats:p>","DOI":"10.1142\/s0129626402001026","type":"journal-article","created":{"date-parts":[[2002,12,11]],"date-time":"2002-12-11T11:18:01Z","timestamp":1039605481000},"page":"327-340","source":"Crossref","is-referenced-by-count":13,"title":["OPTIMAL SNAP-STABILIZING NEIGHBORHOOD SYNCHRONIZER IN TREE NETWORKS"],"prefix":"10.1142","volume":"12","author":[{"given":"COLETTE","family":"JOHNEN","sequence":"first","affiliation":[{"name":"LRI - CNRS UMR 8623, Universit\u00e9 Paris-Sud, France"}]},{"given":"LUC O.","family":"ALIMA","sequence":"additional","affiliation":[{"name":"Unit\u00e9 d'Informatique, Universit\u00e9 Catholique de Louvain, Belgium"}]},{"given":"AJOY K.","family":"DATTA","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Nevada Las Vegas, USA"}]},{"given":"S\u00c9BASTIEN","family":"TIXEUIL","sequence":"additional","affiliation":[{"name":"LRI - CNRS UMR 8623, Universit\u00e9 Paris-Sud, France"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"p_3","doi-asserted-by":"publisher","DOI":"10.1080\/10637199808947375"},{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.1109\/12.312126"},{"key":"p_5","doi-asserted-by":"publisher","DOI":"10.1145\/4221.4227"},{"key":"p_14","doi-asserted-by":"publisher","DOI":"10.1145\/361179.361202"},{"key":"p_16","doi-asserted-by":"publisher","DOI":"10.1109\/71.588622"},{"key":"p_20","first-page":"1800","author":"Huang S. T.","year":"2000","journal-title":"LNCS"},{"key":"p_22","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(79)90151-0"},{"key":"p_24","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(98)00069-6"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626402001026","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T16:18:49Z","timestamp":1565108329000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626402001026"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,9]]},"references-count":8,"journal-issue":{"issue":"03n04","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2002,9]]}},"alternative-id":["10.1142\/S0129626402001026"],"URL":"https:\/\/doi.org\/10.1142\/s0129626402001026","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,9]]}}}