Filters








47,215 Hits in 3.7 sec

Memory requirements for silent stabilization

Shlomi Dolev, Mohamed G. Gouda, Marco Schneider
1999 Acta Informatica  
In this paper we show that there cannot exist constant memory silent stabilizing algorithms for finding the centers of a graph, electing a leader, and constructing a spanning tree.  ...  Many silent stabilizing algorithms have appeared in the literature.  ...  Proving the memory requirements for silent stabilization In each of the theorems in this paper we utilize a common proof method to obtain our results.  ... 
doi:10.1007/s002360050180 fatcat:elaxgwkqgbh7hgn7v57debrf54

Memory requirements for silent stabilization

Shlomi Dolev, Mohamed G. Gouda, Marco Schneider
1996 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing - PODC '96  
In this paper we show that there cannot exist constant memory silent stabilizing algorithms for finding the centers of a graph, electing a leader, and constructing a spanning tree.  ...  Many silent stabilizing algorithms have appeared in the literature.  ...  Proving the memory requirements for silent stabilization In each of the theorems in this paper we utilize a common proof method to obtain our results.  ... 
doi:10.1145/248052.248055 dblp:conf/podc/DolevGS96 fatcat:whniupuznfb6rbjjj5yyuljrde

Brief Announcement: Memory Lower Bounds for Self-Stabilization

Lélia Blin, Laurent Feuilloley, Gabriel Le Bouder, Michael Wagner
2019 International Symposium on Distributed Computing  
It follows that requiring the algorithm to be silent has a cost in terms of memory space, while, in the context of self-stabilization, where every node constantly checks the states of its neighbors, the  ...  [Acta Inf. '99] showed that, for finding the centers of a graph, for electing a leader, or for constructing a spanning tree, every silent deterministic algorithm must use a memory of Ω(log n) bits per  ...  Memory Lower Bounds for Self-Stabilization In the state model, the processes have two types of memory.  ... 
doi:10.4230/lipics.disc.2019.37 dblp:conf/wdag/BlinFB19 fatcat:ucwvrbj4xfflhje6sk65f7ksde

Brief announcement

Lélia Blin, Sébastien Tixeuil
2013 Proceedings of the 2013 ACM symposium on Principles of distributed computing - PODC '13  
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.  ...  When the protocol is required to be silent (i.e., when communication content remains fixed from some point in time during any execution), there exists a lower bound of Ω(log n) bits of memory per node  ...  It states that, n-node networks, Ω(log n) bits of memory are required for solving global tasks such as leader election. Importantly, this bound holds even for the ring.  ... 
doi:10.1145/2484239.2484289 dblp:conf/podc/BlinT13 fatcat:b3ehjxpzs5gbtooym6m5xugkam

Brief Announcement: Compact Self-Stabilizing Leader Election in Arbitrary Graphs

Lélia Blin, Sébastien Tixeuil, Marc Herbstritt
2017 International Symposium on Distributed Computing  
We present the first self-stabilizing algorithm for leader election in arbitrary topologies whose space complexity is O(max{log ∆, log log n}) bits per node, where n is the network size and ∆ its degree  ...  [6] , stating that in n-node networks, Ω(log n) bits of memory per node are required for solving tasks such as leader election.  ...  It is designed for the standard state model (a.k.a. shared memory model) for self-stabilizing algorithms in networks.  ... 
doi:10.4230/lipics.disc.2017.43 dblp:conf/wdag/BlinT17 fatcat:vg5imk2tnvcqpaq7pl6f2v4xce

Fast and Compact Distributed Verification and Self-Stabilization of a DFS Tree [article]

Shay Kutten, Chhaya Trehan
2014 arXiv   pre-print
on our silent-stabilizing DFS tree.  ...  We present algorithms for distributed verification and silent-stabilization of a DFS(Depth First Search) spanning tree of a connected network.  ...  [12] established a lower bound of O(log n) bits per node on the memory requirement of silent-stabilizing spanning tree algorithms.  ... 
arXiv:1408.0384v2 fatcat:4mr7c6yekjclbc4bivcnxrf54u

Silent MST approximation for tiny memory [article]

Lélia Blin, Swan Dubois, Laurent Feuilloley
2020 arXiv   pre-print
In this model, a classic requirement is that the algorithm has to be silent, that is, after stabilization the states should not change anymore.  ...  We design a silent self-stabilizing algorithm for the problem of minimum spanning tree, that has a trade-off between the quality of the solution and the space needed to compute it.  ...  On the one hand, it is known that the space needed for the proof is a lower bound on the space required for silent stabilization.  ... 
arXiv:1905.08565v4 fatcat:xsxnz56fybcrfpxfk7oiwfagg4

Learning and Memory

2011 Cell  
for long-term facilitation, a physiological read-out for Aplysia learning and memory storage.  ...  Choi and colleagues gain new insight into the molecular control of synaptic remodeling required for learning and memory by studying the sensory-motor circuit underlying the gill withdrawal reflex.  ...  Although this study does not provide definitive proof for either model, both forms of memory could exist, suggesting that bees and mammals share some of the basic cognitive components for memory.  ... 
doi:10.1016/j.cell.2011.04.020 fatcat:as4bgfbvonf4xdnvo552hagqim

Computerized Silent Reading Rate and Strategy Instruction for Fourth Graders at Risk in Silent Reading Rate

Jasmin Niedo, Yen-Ling Lee, Zvia Breznitz, Virginia W. Berninger
2013 Learning Disability Quarterly  
time on timed tests requiring silent reading, and (c) combining computerized instruction with strategies for self-regulation during silent reading.  ...  Attention ratings and working memory for written words predicted post-treatment accuracy, which correlated significantly with the silent sentence reading rate score.  ...  The stability coefficient is .97 for ages 10-12.  ... 
doi:10.1177/0731948713507263 pmid:24914248 pmcid:PMC4047714 fatcat:pi3u4eu7qfcqlatw2se7qtqsya

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

Lélia Blin, Laurent Feuilloley, Gabriel Le Bouder
2021 arXiv   pre-print
.), a self-stabilizing algorithm for Π is a distributed algorithm that can start from any initial configuration of the network (i.e., every node has an arbitrary value assigned to each of its variables  ...  It is known that leader election does not have a deterministic self-stabilizing algorithm using a constant-size register at each node, i.e., for some networks, some of their nodes must have registers whose  ...  Intuition of the proofs Challenge of lower bounds for non-silent algorithms Almost all lower bounds for self-stabilization are for silent algorithms, that are required to stay in the same configuration  ... 
arXiv:1905.08563v3 fatcat:wctfkduvevgi5j4zwdfpwq77km

Space-Optimal Time-Efficient Silent Self-Stabilizing Constructions of Constrained Spanning Trees

Lelia Blin, Pierre Fraigniaud
2015 2015 IEEE 35th International Conference on Distributed Computing Systems  
We present a general roadmap for the design of silent space-optimal self-stabilizing algorithms solving such tasks, converging in polynomially many rounds under the unfair scheduler.  ...  It is however not known whether for every task there exists a self-stabilizing algorithm that is simultaneously space-efficient and time-efficient.  ...  Lemma 8.1: There is a proof-labeling scheme for FR-trees with O(log n)-bit labels. Any silent self-stabilizing FR-tree construction algorithm requires Ω(log n)-bit memory.  ... 
doi:10.1109/icdcs.2015.66 dblp:conf/icdcs/BlinF15 fatcat:r4od2ao7gbdhpbub7tjoksvhfq

Compact Deterministic Self-stabilizing Leader Election [chapter]

Lélia Blin, Sébastien Tixeuil
2013 Lecture Notes in Computer Science  
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.  ...  When the protocol is required to be silent (i.e., when communication content remains fixed from some point in time during any execution), there exists a lower bound of Ω(log n) bits of memory per node  ...  Our algorithm is non-silent to circumvent the lower bound Ω(log n) bits of memory per node in [15] . It uses only O(log log n) bits of memory per node, and stabilizes in O(n log 2 n) time.  ... 
doi:10.1007/978-3-642-41527-2_6 fatcat:uelkodsrjzd2fmclrnl2lspd5m

The influence of concurrent load on mouthed and vocalized modality effects

Judy Cantor, Randall W. Engle
1989 Memory & Cognition  
A visual search task was coupled with the serial recall of words to assess the extent to which modality effects mediated by vocalizing and silent mouthing reflect an automatically activated preattentive  ...  concurrent task demands increased, but the magnitude of the modality effect associated with both mouthing and vocalizing was not altered, regardless of whether or not subjects simultaneously searched for  ...  However, other explanations remain for the stability of the modality.  ... 
doi:10.3758/bf03202631 pmid:2811667 fatcat:kybk7rz6cbe67fkrttdpynoep4

Stabilizing Maximal Independent Set in Unidirectional Networks is Hard [article]

Toshimitsu Masuzawa, Sébastien Tixeuil
2009 arXiv   pre-print
We complement the study with probabilistic protocols for the uniform case: the first probabilistic protocol requires infinite memory but copes with asynchronous scheduling, while the second probabilistic  ...  On the negative side, we present evidence that in uniform networks, deterministic self-stabilization of this problem is impossible.  ...  networks inherently requires unbounded memory.  ... 
arXiv:0903.3106v1 fatcat:qvnamg6rlbalxe3vg4pkye22yi

A SILENT SELF-STABILIZING ALGORITHM FOR FINDING CUT-NODES AND BRIDGES

STÉPHANE DEVISMES
2005 Parallel Processing Letters  
Until now, this is the protocol with the lowest memory requirement solving this problem.  ...  In this paper, we present a silent algorithm for finding cut-nodes and bridges in arbitrary rooted networks. This algorithm must be composed with an algorithm from Collin and Dolev.  ...  Until now, this is the protocol with the lowest memory requirement solving this problem.  ... 
doi:10.1142/s0129626405002143 fatcat:yynmy55k2vbk5fqdgmd2zk2bhm
« Previous Showing results 1 — 15 out of 47,215 results