Randomized smoothing networks

Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM)

Volumn 18, Issue , 2004, Pages 919-925

  Herlihy, Maurice ^a   Tirthapura, Srikanta ^b  

^a Brown Univerity   (United States)

^b Iowa State University of Science and Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BITONIC NETWORKS; RANDOM PERMUTATIONS; RANDOM VARIABLES; SMOOTHING NETWORKS;

COMPUTER SCIENCE; COMPUTER SIMULATION; FAULT TOLERANT COMPUTER SYSTEMS; PROBABILITY; RANDOM PROCESSES; SERVERS; THEOREM PROVING;

DATA STRUCTURES;

EID: 12444302216     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (9)

1. W. Aiello, R. Venkatesan, and M. Yung. Coins, weights and contention in balancing networks. In Proceedings of the annual ACM symposium on Principles of Distributed Computing, pages 193-205, August 1994.
2. M. Ajtai, J. Komlós, and E. Szemerédi. Sorting in c log n parallel steps. Combinatorica, 3:1-19, 1983.
3. J. Aspnes, M. Herlihy, and N. Shavit. Counting networks. Journal of the ACM, 41(5): 1020-1048, 1994.
4. K. Batcher. Sorting networks and their applications. In Proceedings of the AFIPS Spring Joint Computer Conference, volume 32, pages 338-334, 1968.
5. A. Czumaj, P. Kanarek, M. Kutylowski, and K. Lorys. Switching networks for generating random permutations. In D.-Z. Du and H. Ngo, editors, Switching Networks: Recent Advances. Kluwer Academic Publishers, 2001.
6. M. Dowd, Y. Perl, L. Rudolph, and M. Saks. The periodic balanced sorting network. Journal of the ACM, 36(4):738-757, October 1989.
7. M. Herlihy and S. Tirthapura. Self stabilizing smoothing and counting. In Proceedings of the 23rd International Conference on Distributed Computing Systems (ICDCS), pages 4-11, 2003.
8. W. Hoeffding. Probability inequalities for sums of bounded random variables. American Statistical Association Journal, 58:13-30, 1963.
9. M.R.Klugerman and C.G.Plaxton. Small-depth counting networks. In Proceedings of the 24th Annual ACM Symposium on Theory of Computing, pages 417-428, 1992.