Analysis in distribution of two randomized algorithms for finding the maximum in a broadcast communication model

Journal of Algorithms

Volumn 46, Issue 2, 2003, Pages 140-177

  Chen, Wei Mei ^a   Hwang, Hsien Kuei ^b  

^a TATUNG UNIVERSITY   (Taiwan)

^b INSTITUTE OF STATISTICAL SCIENCE   (Taiwan)

Author keywords

Analysis in distribution; Asymptotic normality; Binomial recurrence; Broadcast communication model; Dickman distribution; Method of moment

Indexed keywords

ASYMPTOTIC STABILITY; BROADCASTING; COMMUNICATION; METHOD OF MOMENTS; RECURSIVE FUNCTIONS;

BROADCAST COMMUNICATION MODELS; RECURSIVE ALGORITHMS;

ALGORITHMS;

EID: 0037666046     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0196-6774(02)00293-6     Document Type: Article

References (35)

1. D. Aldous, Probability Approximations via the Poisson Clumping Heuristic, Springer-Verlag, New York, 1989.
2. Z.-D. Bai, H.-K. Hwang, W.-Q. Liang, T.-H. Tsai, Limit theorems for the number of maxima in random samples from planar regions, Electron. J. Probab. 6 (2001), paper no. 3, 41 p.
3. P. Billingsley, Probability and Measure, 3rd Edition, Wiley, New York, 1995.
4. J.I. Capetanakis, Tree algorithms for packet broadcast channels, IEEE Trans. Inform. Theory IT-25 (1979) 505-515.
5. H.-H. Chern, H.-K. Hwang, Phase changes in random m-ary search trees and generalized quicksort, Random Structures Algorithms 19 (2001) 316-358.
6. R. Dechter, L. Kleinrock, Broadcast communications and distributed algorithms, IEEE Trans. Comput. C-35 (1986) 210-219.
7. P. Diaconis, Application of the method of moments in probability and statistics, in: Moments in Mathematics, San Antonio, Texas, 1987, AMS, Providence, RI, 1987, pp. 125-142.
8. J. A. Fill, H. Mahmoud, W. Szpankowski, On the distribution for the duration of a randomized leader election algorithm, Ann. Appl. Probab. 6 (1996) 1260-1283.
9. P. Flajolet, Singularity analysis and asymptotics of Bernoulli sums, Theoret. Comput. Sci. 215 (1999) 371-381.
10. P. Flajolet, X. Gourdon, P. Dumas, Mellin transforms and asymptotics: harmonic sums, Theoret. Comput. Sci. 144 (1995) 3-58.
11. P. Flajolet, A. Odlyzko, Singularity analysis of generating functions, SIAM J. Discrete Math. 3 (1990) 216-240.
12. P. Flajolet, I. Vardi, Zeta function expansions of classical constants, unpublished manuscript; available via the link http://algo.inria.fr/flajoletyPublications/publist.html.
13. G.H. Gonnet, R. Baeza-Yates, Handbook of Algorithms and Data Structures, 2nd Edition, Addison-Wesley, 1991.
14. P.J. Grabner, H. Prodinger, An asymptotic study of a recursion occurring in the analysis of an algorithm on broadcast communication, Inform. Process. Lett. 65 (1998) 89-93.
15. P.J. Grabner, H. Prodinger, Sorting algorithms for broadcast communications: Mathematical analysis, Theoret. Comput. Sci. 289 (2002) 51-67.
16. F. Hubalek, H.-K. Hwang, W. Lew, H.M. Mahmoud, H. Prodinger, A multivariate view of random bucket digital search trees, J. Algorithms 44 (2002) 121-158.
17. H.-K. Hwang, Asymptotic estimates of elementary probability distributions, Stud. Appl. Math. 99 (1997) 393-417.
18. H.-K. Hwang, R. Neininger, Phase change of limit laws in the quicksort recurrence under varying toll functions, SIAM J. Comput. 31 (2002) 1687-1722.
19. H.-K. Hwang, T.-H. Tsai, Quickselect and Dickman function, Combin. Probab. Comput. 11 (2002) 353-371.
20. P. Jacquet, W. Szpankowski, Analytical depoissonization and its applications, Theoret. Comput. Sci. 201 (1998) 1-62.
21. D.E. Knuth, The Art of Computer Programming, Vol. 1: Fundamental Algorithms, 3rd Edition, Addison-Wesley, Reading, MA, 1997.
22. S.P. Levitan, C.C. Foster, Finding an extremum in a network, in: Proceedings of the Ninth International Symposium on Computer Architecture, SIGARCH Newsletter, 1982, pp. 321-325.
23. H.M. Mahmoud, Sorting. A Distribution Theory, Wiley-Interscience. New York, 2000.
24. C.U. Martel, Maximum finding on a multiple access broadcast network. Inform. Process. Lett. 52 (1994) 7-13.
25. C.U. Martel, W. Moh, Optimal prioritized conflict resolution on a multiple access channel, IEEE Trans. Comput. 40 (1991) 1102-1108.
26. N.A. Lynch, Distributed Algorithms, Morgan Kaufmann, San Francisco, CA, 1996.
27. K. Nakano, S. Olariu, J.L. Schwing, Broadcast-efficient sorting in the presence of few channels, in: Proceedings of the International Conference on Parallel Processing, August, 1997, pp. 12-15.
28. A.M. Odlyzko, Search for the maximum of a random walk, Random Structures Algorithms 6 (1995) 275-295.
29. V.V. Petrov, Sums of Independent Random Variables, Springer-Verlag, New York, 1975.
30. F.P. Preparata, M.I. Shamos, Computational Geometry. An Introduction, Springer-Verlag, New York, 1985.
31. H. Prodinger, How to select a loser, Discrete Math. 120 (1993) 149-159.
32. S.-H. Shiau, C.-B. Yang. A fast maximum finding algorithm on broadcast communication, Inform. Process. Lett. 60 (1996) 81-89.
33. W. Szpankowski, Average Case Analysis of Algorithms on Sequences, Wiley, New York, 2001.
34. G. Tenenbaum, Introduction to Analytic and Probabilistic Number Theory, Cambridge Univ. Press, Cambridge, 1995, translated from the original French version.
35. C.-B. Yang, Computational geometry on the broadcast communication model, J. Inform. Sci. Eng. 15 (1999) 383-395.