Filters








3,860 Hits in 5.0 sec

Page 1328 of Mathematical Reviews Vol. , Issue 2003B [page]

2003 Mathematical Reviews  
Comput. 8 (1995), no. 3, 133- 142] have proposed a self-stabilizing multi-token protocol for the ring networks.  ...  Self-stabilizing single token circulation or the standard mutual exclusion problem has been in- vestigated by a number of authors; recently M. Flatebo, A. K. Datta and A. A. Schoone [Distrib.  ... 

Self-Stabilization in Dynamic Networks

Toshimitsu MASUZAWA
2009 IEICE transactions on information and systems  
This advantage makes self-stabilizing protocols extremely attractive for designing highly dependable distributed systems on dynamic networks.  ...  While conventional self-stabilizing protocols require that the networks remain static during convergence to the intended behaviors, some recent works undertook the challenge of realizing self-stabilization  ...  We show, as an example, a self-stabilizing protocol for the mutual exclusion. Figure 1 shows a mutual exclusion protocol on static rings proposed by Dijkstra [4] .  ... 
doi:10.1587/transinf.e92.d.108 fatcat:aon2azp2kzcipas64piezqp6ui

Daemon Conversions in Distributed Self-stabilizing Algorithms [chapter]

Wayne Goddard, Pradip K. Srimani
2013 Lecture Notes in Computer Science  
We consider protocols to transform a self-stabilizing algorithm for one daemon to one that can run under a different daemon.  ...  We give the first (full) proof that, provided there are IDs, any algorithm that self-stabilizes only under a fair central daemon can be converted to one that self-stabilizes under an unfair read/write  ...  Most of the papers on self-stabilizing mutual exclusion (see for example [9] or [6] ) are essentially token-passing algorithms.  ... 
doi:10.1007/978-3-642-36065-7_15 fatcat:7xr7xp4g65gshcz7hzhfmhbmoi

Self-stabilizing group communication in directed networks

Shlomi Dolev, Elad Schiller
2004 Acta Informatica  
A randomized self-stabilizing mutual exclusion algorithm in a uniform (directed) networks is presented in [4] .  ...  Self-stabilizing algorithms for directed networks have been addressed in [2, 1, 5, 4, 14] . Self-stabilizing mutual exclusion on directed graphs was considered in [2] .  ...  Self-stabilizing Multicast in a Ring Algorithm, code for p i Tree Algorithm: The second approach we present is based on a distributed tree structure defined by the update algorithm, and then the self-stabilizing  ... 
doi:10.1007/s00236-004-0143-1 fatcat:kdv66wyh6jhyfp5v6sszrh5prq

Separation of circulating tokens

K. GhoshDastidar, T. Herman
2011 Theoretical Computer Science  
Self-stabilizing distributed control is often modeled by token abstractions.  ...  A system with a single token may implement mutual exclusion; a system with multiple tokens may ensure that immediate neighbors do not simultaneously enjoy a privilege.  ...  The literature on self-stabilizing mutual exclusion includes token abstractions [10] , generalizations of mutual exclusion to k-exclusion or k-out-of-ℓ exclusion [11] , multitoken protocols for a ring  ... 
doi:10.1016/j.tcs.2010.09.013 fatcat:x7pdciq5graf3byy4notco52pi

Separation of Circulating Tokens [chapter]

Kajari Ghosh Dastidar, Ted Herman
2009 Lecture Notes in Computer Science  
Self-stabilizing distributed control is often modeled by token abstractions.  ...  A system with a single token may implement mutual exclusion; a system with multiple tokens may ensure that immediate neighbors do not simultaneously enjoy a privilege.  ...  The literature on self-stabilizing mutual exclusion includes token abstractions [10] , generalizations of mutual exclusion to k-exclusion or k-out-of-ℓ exclusion [11] , multitoken protocols for a ring  ... 
doi:10.1007/978-3-642-05118-0_25 fatcat:7jab746m5zb7lgohvmpekcmcmi

The Challenges of Merging Two Similar Structured Overlays: A Tale of Two Networks [chapter]

Anwitaman Datta, Karl Aberer
2006 Lecture Notes in Computer Science  
Particularly, we show that ring based networks can not operate until the merger operation completes.  ...  We elaborate how two networks using the same protocols can be merged, looking specifically into two different overlay design principles: (i) maintaining the ring invariant and (ii) structural replications  ...  Ring self-stabilization highlights The ring invariant is typically violated when new peers join the network, or existing ones leave it.  ... 
doi:10.1007/11822035_3 fatcat:jc44zpggsffndgfz3o4ggovg3q

Self-Stabilizing Periodic Mutual-exclusive Propagation in Sparse Networks [article]

Shaolin Yu, Jihong Zhu, Jiali Yang
2022 arXiv   pre-print
For providing easy message propagation primitives, the mutual-exclusive propagation (MEP) of one-bit messages is investigated with a simplified discrete system model.  ...  Featured by its very simple mechanism, the proposed MEP primitive can be employed as a practical building block of upper-layer self-stabilizing synchronous systems.  ...  Also, with the self-stabilization property, higherlayer self-stabilizing protocols can be directly built upon this basic mutual-exclusive propagation (MEP) primitive.  ... 
arXiv:2203.03297v1 fatcat:njoznubnj5ainh66gmao2232oa

Observations on non-silent self-stabilizing algorithms in sensor networks with probabilistically intermittent link failures

Hirotsugu Kakugawa, Yukiko Yamauchi, Sayaka Kamei, Toshimitsu Masuzawa
2011 Theoretical Computer Science  
Self-stabilization is one of the self- * properties, and it is one of the most promising theoretical backgrounds for self-organizing wireless sensor network protocols. Herman [T.  ...  In [8], Kakugawa and Masuzawa present upper bounds on the expected convergence time of several self-stabilizing algorithms transformed by CST under the same setting as [14] .  ...  Fig. 6 . 6 SSMutexURing: A self-stabilizing mutual exclusion algorithm on a unidirectional ring of prime size n [2] .  ... 
doi:10.1016/j.tcs.2010.11.013 fatcat:ldx7rooofnexvikfqqgwe5e5tq

On Self-Timed Circuits in Real-Time Systems

Markus Ferringer
2011 International Journal of Reconfigurable Computing  
To demonstrate the robustness of our solution, we perform different tests and investigate their impact on jitter and frequency stability.  ...  Having no high-precision oscillator, a self-timed circuit's execution speed is heavily dependent on temperature and supply voltage.  ...  Notice that they are not mutually exclusive -even worse, measurements mostly indicate a combination of several if not all of these types. • Data Dependent Jitter (DDJ) is added to a signal according to  ... 
doi:10.1155/2011/972375 fatcat:4fc7zx7dhfgdnozlgoisekop5i

Improving Connectionist Energy Minimization

G. Pinkas, R. Dechter
1995 The Journal of Artificial Intelligence Research  
For acyclic networks, the algorithm is guaranteed to converge to a global minimum from any initial state of the system (self-stabilization) and remains correct under various types of schedulers.  ...  An asynchronous scheduler can activate only one unit at a time while a synchronous scheduler can activate any number of units in a single time step.  ...  In addition, we can easily show that the algorithm is not self-stabilizing when cycles are introduced. For example, consider the con guration of the pointers in the ring of Figure 9.  ... 
doi:10.1613/jair.130 fatcat:wtw24an2rzg35o7miirszz3uti

Improving Connectionist Energy Minimization [article]

G. Pinkas, R. Dechter
1995 arXiv   pre-print
For acyclic networks, the algorithm is guaranteed to converge to a global minimum from any initial state of the system (self-stabilization) and remains correct under various types of schedulers.  ...  An asynchronous scheduler can activate only one unit at a time while a synchronous scheduler can activate any number of units in a single time step.  ...  We would also like to thank Kalev Kask for commenting on the latest version of this manuscript, Kaoru Mulvihill for drawing the gures, for Lynn Haris for editing and the anonymous reviewers who helped  ... 
arXiv:cs/9510102v1 fatcat:thpucrw5pzdmbj4q7gaqhjmwtm

Randomized Self-stabilizing Algorithms for Wireless Sensor Networks [chapter]

Volker Turau, Christoph Weyer
2006 Lecture Notes in Computer Science  
The transformed algorithms use randomization and are probabilistically self-stabilizing. This work allows to utilize many known self-stabilizing algorithms in WSNs.  ...  The majority of self-stabilizing algorithms found in the literature is based on models not suitable for WSNs: shared memory model, central daemon scheduler, unique processor identifiers, and atomicity.  ...  In most cases the core of the transformations is a self-stabilizing local mutual exclusion algorithm based on unique node identifiers [19] .  ... 
doi:10.1007/11822035_8 fatcat:lo3ytmuiwbeilekztm23mcdcua

Transformations for write-all-with-collision model

Sandeep S. Kulkarni, Mahesh Arumugam
2006 Computer Communications  
One way to achieve these properties is to utilize the vast literature on distributed systems where such self-stabilizing algorithms have been designed.  ...  Dependable properties such as self-stabilization are crucial requirements in sensor networks.  ...  We thank Ted Herman for introducing the WAC model to us at the Seminar on Self-Stabilization, Luminy, France in October 2002.  ... 
doi:10.1016/j.comcom.2005.05.016 fatcat:yozptviaw5gpjkncmcnz4knara

Transformations for Write-All-with-Collision Model [chapter]

Sandeep S. Kulkarni, Mahesh (Umamaheswaran) Arumugam
2004 Lecture Notes in Computer Science  
One way to achieve these properties is to utilize the vast literature on distributed systems where such self-stabilizing algorithms have been designed.  ...  Dependable properties such as self-stabilization are crucial requirements in sensor networks.  ...  We thank Ted Herman for introducing the WAC model to us at the Seminar on Self-Stabilization, Luminy, France in October 2002.  ... 
doi:10.1007/978-3-540-27860-3_18 fatcat:mwjnjs4wfjhkdfmm75scicgla4
« Previous Showing results 1 — 15 out of 3,860 results