Leszek Gąsieniec
ABSTRACT
This paper studies the differences between two levels of synchronization in a distributed broadcast system (or a multiple access channel). In the globally synchronous model, all processors have access to a global clock. In the locally synchronous model, processors have local clocks ticking at the same rate, but each clock starts individually, when the processor wakes up.
We consider the fundamental problem of waking up all of n processors of a completely connected broadcast system. Some processors wake up spontaneously, while others have to be woken up. Only wake processors can send messages; a sleeping processor is woken up upon hearing a message. The processors hear a message in a given round if and only if exactly one processor sends a message in that round. Our goal is to wake up all processors as fast as possible in the worst case, assuming an adversary controls which processors wake up and when. We analyze the problem in both the globally synchronous and locally synchronous models, with or without the assumption that n is known to the processors. We propose randomized and deterministic algorithms for the problem, as well as lower bounds in some of the cases. These bounds establish a gap between the globally synchronous and locally synchronous models.
- 1.N. Alon, A. Bar-Noy, N. Linial and D. Peleg, A lower Bound for Radio Broadcast, J. of Computer and System Sciences 43, (1991), 290-298. Google Scholar
Digital Library
- 2.D. Bertsekas and R. Gallager, Data Networks, Prantice Hall, Englewood Cliffs, New Jersey 07632, 1987. Google ScholarDigital Library
- 3.R. Bar-Yehuda, O. Goldreich, and A. Itai, On the time complexity of broadcast in radio networks: An exponential gap between determinism and randomization, Proc. 6th A CM Symposium on Principles of Distributed Computing (1987), 98- 108. Google ScholarDigital Library
- 4.I. Chlamtac and S. Kutten, On Broadcasting in Radio Networks- Problem Analysis and Protocol Design, IEEE Trans. on Comm un. 33, (1985).Google Scholar
- 5.I. Chlamtac and S. Kutten, Tree Based Broadcasting in Multihop Radio Networks, IEEE Trans. on Computers 36, (1987), pp. 1209-1223. Google ScholarDigital Library
- 6.I. Chlamtac and S. Kutten, A Spatial Reuse TDMA/FDMA for Mobile Multi-hop Radio Networks, Proc. IEEE INFOCOM, 1985, Washington DC, pp. 389-394.Google Scholar
- 7.I. Chlamtac and O. Weinstein, The Wave Expansion Approach to Broadcasting in Multihop Radio Networks, Proc. INFOCOM, 1987.Google Scholar
- 8.B.S. Chlebus, L. Gasieniec, A. Gibbons, A. Pelc and W. Rytter, Deterministic broadcasting in unknown radio networks, Proc. l lth Ann. ACM-SIAM Symposium on Discrete Algorithms (SODA'2000), 861-870. Google ScholarDigital Library
- 9.K. Diks, E. Kranakis, D. Krizanc, A. Pelc, The impact of knowledge on broadcasting time in radio networks, Proc. 7th Annual European Symposium on Algorithms, ESA'99, Prague, Czech Republic, July 1999, LNCS 1643, 41-52. Google ScholarDigital Library
- 10.S. Even and S. Rajsbaum, Unison, canon, and sluggish clocks in networks controlled by a synchronizer, Mathematical Systems Theory 28, (1995), 421-435.Google ScholarCross Ref
- 11.F. Fich, R. Impagliazzo, B. Kapron, V. King and M. Kutylowski, Limits on the Power of Parallel Random Access Machines with Weak Forms of Write Conflict Resolution, JCSS 53, (1996), 104-111. Google ScholarDigital Library
- 12.M.J. Fischer, S. Moran, S. Rudich and G. Taubenfeld, The Wakeup Problem, SIAM Journal on Computing 2~, (1996), 1332-1357. Google ScholarDigital Library
- 13.J. Hastad, T. Leighton and B. Rogoff, Analysis of Backoff Protocols for Multiple Access Channels, 19th ACM Syrup. on Theory of Computing, (1987), pp. 241-253. Google ScholarDigital Library
- 14.A. G. Greenberg, P. Flajolet and R. E. Ladner, Estimating the Multiplicities of Conflicts to Speed their Resolutions in Multiple Access Channels, J. ACM 34, (1987), pp. 289-325. Google ScholarDigital Library
- 15.J. Goodman, A. G. Greenberg, N. Madras and P. March, On the Stability of Ethernet, Proc. 17th Syrup. on Theory of Computing, (1985), pp. 379-387. Google ScholarDigital Library
- 16.I. Gitman, R. M. Van Slyke and H. Frank, Routing in Packet-Switching Broadcast Radio Networks, IEEE Trans. on Commun., (1976), 926-930.Google Scholar
- 17.R. E. Kahn, S. A. Gronemeyer, J. Burchfiel and R. C. Kunzelman, Advances in Packet Radio Technology, Proc. IEEE 66, (1978).Google Scholar
- 18.R. C. Kunzelman, Overview of the ARPA Packet Radio Experimental Network, Proc. COMPCON, 1978, pp. 157-160.Google Scholar
- 19.E. Kushilevitz and Y. Mansour, Computation in Noisy Radio Networks, Proc. 9th Ann. ACM-SIAM Syrup. on Discrete Algorithms, SODA'98, 236-243. Google ScholarDigital Library
- 20.Jacques Mazoyer, On optimal solutions to the firing squad synchronization problem, Theoretical Computer Science 168, (1996), 367-404. Google ScholarDigital Library
- 21.N. Shacham and E. J. Craighill, Dynamic Routing for Real-Time Transport in Packet Radio Networks, Proc. INFOCOM, 1982.Google Scholar
- 22.A. Tannenbaum, Computer Networks, Prentice-Hall Inc., 1981. Google ScholarDigital Library
Index Terms
- The wakeup problem in synchronous broadcast systems (extended abstract)
Recommendations
The Wakeup Problem in Synchronous Broadcast Systems
This paper studies the differences between two levels of synchronization in a distributed broadcast system (or a multiple-access channel). In the globally synchronous model, all processors have access to a global clock. In the locally synchronous ...
Power-Efficient Wakeup Tag Broadcast
ICCD '05: Proceedings of the 2005 International Conference on Computer DesignThe dynamic instruction scheduling logic is one of the most critical components of modern superscalar microprocessors, both from the delay and power dissipation standpoints. The delay and energy requirement of driving the wakeup tags across the ...
Comments