Filters








2,219 Hits in 4.9 sec

Uniform deterministic self-stabilizing ring-orientation on odd-length rings [chapter]

Jaap-Henk Hoepman
1994 Lecture Notes in Computer Science  
doi:10.1007/bfb0020439 fatcat:v5suffasyvdrnbdmrko6nvast4

Self-Stabilizing Ring Orientation Using Constant Space

Jaap-Henk Hoepman
1998 Information and Computation  
In this paper we present two uniform deterministic self-stabilizing ring-orientation protocols for rings with an odd number of processors using only a constant number of states per processor.  ...  As an application of our techniques we are able to prove that under the central daemon on an odd-length ring, the link-register model and the state-reading model are equivalent in the sense that any self-stabilizing  ...  We present two uniform deterministic self-stabilizing ring-orientation protocols for odd-length rings, both using only a constant number of states per processor.  ... 
doi:10.1006/inco.1998.2707 fatcat:dxlggoscabdztfjxcmzw46j3j4

Self-Stabilizing Master-Slave Token Circulation Algorithm in Undirected Rings and Unicyclic Graphs of Arbitrary Size and Their Orientations

Yihua Ding, James Wang, Pradip K Srimani
2014 International Journal of Networking and Computing  
In this paper, we propose a constant space randomized self-stabilizing master-slave token circulation algorithm that works for undirected rings and undirected unicyclic graphs of arbitrary size.  ...  Disregarding the time for stabilization, the orientation can be done in at most O(n) steps with 1 bit extra storage at each node for the ring and the unicyclic graph.  ...  For rings of odd size, there exist several deterministic self-stabilizing algorithms [15, 22, 16] for ring orientation.  ... 
doi:10.15803/ijnc.4.1_42 fatcat:vwrvvxdolnbmxgwxq2pjcosvey

Deterministic, constant space, self-stabilizing leader election on uniform rings [chapter]

Gene Itkis, Chengdian Lin, Janos Simon
1995 Lecture Notes in Computer Science  
We consider the problem of electing a leader on a ring of nameless processors by deterministic and self-stabilizing protocols.  ...  In this paper, we present a protocol for bidirectional rings of prime size. Our protocol is deterministic, uses constant space and is self-stabilizing, in O(n 2 ) steps.  ...  Although there can be no deterministic protocol for leader election for arbitrary rings, Burns and Pachl 2] showed that, there is a deterministic protocol for uniform rings of prime length.  ... 
doi:10.1007/bfb0022154 fatcat:pzccaqxph5bjzduvdmjbneyr44

Compact Deterministic Self-stabilizing Leader Election [chapter]

Lélia Blin, Sébastien Tixeuil
2013 Lecture Notes in Computer Science  
This paper focuses on compact deterministic self-stabilizing solutions for the leader election problem.  ...  We present a new deterministic (non-silent) self-stabilizing protocol for n-node rings that uses only O(log log n) memory bits per node, and stabilizes in O(n log 2 n) time.  ...  Similarly, self-stabilizing ring-orientation protocols exist, but those which preserve sub-logarithmic memory space either works only in rings of odd size for deterministic guarantees [22] , or just provide  ... 
doi:10.1007/978-3-642-41527-2_6 fatcat:uelkodsrjzd2fmclrnl2lspd5m

Self-stabilizing population protocols

Dana Angluin, James Aspnes, Michael J. Fischer, Hong Jiang
2008 ACM Transactions on Autonomous and Adaptive Systems  
Self-stabilization in a model of anonymous, asynchronous interacting agents deployed in a network of unknown size is considered.  ...  A general method for eliminating nondeterministic transitions from the self-stabilizing implementation of a large family of behaviors is used to simplify the constructions, and general conditions under  ...  There are impossibility results and space bounds on self-stabilizing leader election in general rings in various other models [3, 8] .  ... 
doi:10.1145/1452001.1452003 fatcat:7inf6oo7vvhn7kyvbe6yw66m2u

Self-stabilizing Population Protocols [chapter]

Dana Angluin, James Aspnes, Michael J. Fischer, Hong Jiang
2006 Lecture Notes in Computer Science  
Self-stabilization in a model of anonymous, asynchronous interacting agents deployed in a network of unknown size is considered.  ...  A general method for eliminating nondeterministic transitions from the self-stabilizing implementation of a large family of behaviors is used to simplify the constructions, and general conditions under  ...  There are impossibility results and space bounds on self-stabilizing leader election in general rings in various other models [3, 8] .  ... 
doi:10.1007/11795490_10 fatcat:ojvtg73gzvcmfggr2wnqwc6mhm

Power Grid Vulnerability to Geographically Correlated Failures - Analysis and Control Implications [article]

Andrey Bernstein, Daniel Bienstock, David Hay, Meric Uzunoglu, Gil Zussman
2012 arXiv   pre-print
The analysis and results presented in this paper will have implications both on the design of new power grids and on identifying the locations for shielding, strengthening, and monitoring efforts in grid  ...  In the transmission system, an outage of a line may lead to overload on other lines, thereby eventually leading to their outage.  ...  Clearly, one can view the M -ring as a collection of M self sustained areas: each generator i supplies the demands of M + 2i and M + 2i + 1.  ... 
arXiv:1206.1099v1 fatcat:bsubjwxygvf2vnmrne25fm7mly

Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election Algorithms [article]

Lélia Blin, Laurent Feuilloley, Gabriel Le Bouder
2021 arXiv   pre-print
On the other hand, it is also known that leader election can be solved by a deterministic self-stabilizing algorithm using registers of O(loglog n) bits per node in any n-node bounded-degree network.  ...  Given a boolean predicate Π on labeled networks (e.g., proper coloring, leader election, etc.), a self-stabilizing algorithm for Π is a distributed algorithm that can start from any initial configuration  ...  Every deterministic self-stabilizing algorithm solving leader election in the state model under a strongly fair central scheduler requires registers on Ω(log log n) bits per node in n-node composite rings  ... 
arXiv:1905.08563v3 fatcat:wctfkduvevgi5j4zwdfpwq77km

Power grid vulnerability to geographically correlated failures — Analysis and control implications

Andrey Bernstein, Daniel Bienstock, David Hay, Meric Uzunoglu, Gil Zussman
2014 IEEE INFOCOM 2014 - IEEE Conference on Computer Communications  
The analysis and results presented in this paper will have implications both on the design of new power grids and on identifying the locations for shielding, strengthening, and monitoring efforts in grid  ...  In the transmission system, an outage of a line may lead to overload on other lines, thereby eventually leading to their outage.  ...  Clearly, one can view the M -ring as a collection of M self sustained areas: each generator i supplies the demands of M + 2i and M + 2i + 1.  ... 
doi:10.1109/infocom.2014.6848211 dblp:conf/infocom/BernsteinBHUZ14 fatcat:ko32osztg5gvpd4tv3fpyiv26i

Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity

Xavier Défago, Samia Souissi
2008 Theoretical Computer Science  
More specifically, the proposed algorithm ensures that robots deterministically form a non-uniform circle in a finite number of steps and converges to a situation in which all robots are located evenly  ...  on the boundary of the circle.  ...  We would like to thank Akihiko Konagaya for his comments on an earlier version of this paper. This work was supported by MEXT Grant-in-Aid for Young Scientists (A) (Nr. 18680007).  ... 
doi:10.1016/j.tcs.2008.01.050 fatcat:mj66mzhlona6nfpzt6k5ouw5bm

Computing by Mobile Robotic Sensors [chapter]

Paola Flocchini, Giuseppe Prencipe, Nicola Santoro
2010 Monographs in Theoretical Computer Science  
In this Chapter, we review the results of the investigations on the computability and complexity aspects of systems formed by these myopic and silent mobile sensors.  ...  In an oriented ring, if the desired final distance d is known or computable (e.g., both the number or sensors and the length of the ring are known), exact self-deployment is indeed possible.  ...  When the number of sensors is odd, the sensors achieve the uniform circle.  ... 
doi:10.1007/978-3-642-14849-1_21 dblp:series/eatcs/FlocchiniPS11 fatcat:moittdti4vh6viqtuzlppiyyk4

Compact Deterministic Self-Stabilizing Leader Election: The Exponential Advantage of Being Talkative [article]

Lélia Blin, Sébastien Tixeuil
2014 arXiv   pre-print
This paper focuses on compact deterministic self-stabilizing solutions for the leader election problem.  ...  We present a new deterministic (non-silent) self-stabilizing protocol for n-node rings that uses only O( n) memory bits per node, and stabilizes in O(n^2 n) rounds.  ...  Similarly, self-stabilizing ringorientation protocols exist, but those preserving sub-logarithmic memory space either works only in rings of odd size for deterministic guarantees [24] , or just provide  ... 
arXiv:1401.4972v1 fatcat:mrshf6hn3rfttmvuy2xrxl6xmm

Stochastic neural field model of stimulus-dependent variability in cortical neurons

Paul C. Bressloff, Bard G. Ermentrout
2019 PLoS Computational Biology  
We then explore the effects of inter-network coupling on stimulus-dependent variability in a pair of ring networks.  ...  After accounting for the qualitative statistical behavior of a single ring network, we then explore the effects of inter-network coupling on stimulus-dependent variability in a pair of ring networks, which  ...  shifts around the ring; the generator of such shifts is the odd function sinθ.  ... 
doi:10.1371/journal.pcbi.1006755 fatcat:uw7545dj5neuzoikf6uq3g4cee

The Dynamical Regime of Sensory Cortex: Stable Dynamics around a Single Stimulus-Tuned Attractor Account for Patterns of Noise Variability

Guillaume Hennequin, Yashar Ahmadian, Daniel B. Rubin, Máté Lengyel, Kenneth D. Miller
2018 Neuron  
Highlights d A simple network model explains stimulus-tuning of cortical variability suppression d Inhibition stabilizes recurrently interacting neurons with supralinear I/O functions d Stimuli strengthen  ...  inhibitory stabilization around a stable state, quenching variability d Single-trial V1 data are compatible with this model and rules out competing proposals SUMMARY Correlated variability in cortical  ...  Excitatory (red) and inhibitory neurons (blue) are arranged on a ring, their angular position indicating their preferred stimulus (expressed here as preferred stimulus orientation, PO).  ... 
doi:10.1016/j.neuron.2018.04.017 pmid:29772203 pmcid:PMC5971207 fatcat:jhdvo4cyobgvzpcnbzc7dttchy
« Previous Showing results 1 — 15 out of 2,219 results