Barrier penetrabilities and reduced widths for α-decay in the medium heavy region.pdfVIP

Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks Tomasz Jurdzi´nski1,2 and Grzegorz Stachowiak1 1 Institute of Computer Science, Wrocl aw University 2 Institute of Computer Science, Technical University of Chemnitz Abstract. We consider the problem of waking up n processors of a completely broadcast system. We analyze this problem in both globally and locally syn- chronous models, with or without n being known to processors and with or without labeling of processors. The main question we answer is: how fast we can wake all the processors up with probability 1 − ε in each of these eight models. In [10] a logarithmic waking algorithm for the strongest set of assumptions is described, while for weaker models only linear and quadratic algorithms were obtained. We prove that in the weakest model (local synchronization, no knowledge of n or labeling) the best waking time is O(n/ log n). We also show logarithmic or poly- logarithmic waking algorithms for all stronger models, which in some cases gives an exponential improvement over previous results. 1 Introduction We concentrate on the effects of synchronization level in broadcast systems such as the Ethernet or radio networks (RN). The system is assumed to be synchronous, i.e. processors send messages in rounds. It is assumed that the processors succeed in hearing a message in a given round if and only if exactly one processor sends a message in that round (the situations in which more than one processor or none of the processors send a message are indistinguishable). Hence the communication model is equivalent to the radio model [1,2,3,6,14,16], in a complete graph. This case in which every processor is directly accessible by the other ones is called a single-h