The impact of randomization in smoothing networks

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2008, Pages 345-354

  Mavronicolas, Marios ^a   Sauerwald, Thomas ^b  

^a UNIVERSITY OF CYPRUS   (Cyprus)

^b UNIVERSITY OF PADERBORN   (Germany)

Author keywords

Randomization; Smoothing networks

Indexed keywords

BALANCING; DISTRIBUTED COMPUTER SYSTEMS; WIRE;

GOOD SMOOTHNESS; HIGH PROBABILITY; LOWER AND UPPER BOUNDS; PROBABILISTIC STRUCTURES; RANDOMIZATION; SMOOTHING NETWORKS; TIGHT BOUND; UPPER BOUND;

RANDOM PROCESSES;

EID: 57549110839     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1400751.1400797     Document Type: Conference Paper

References (15)

1. W. Aiello, R. Venkatesan and M. Yung, "Coins, Weights and Contention in Balancing Networks," Proceedings of the 13th ACM Symposium on Principles of Distributed Computing, pp. 193-205, 1994.
2. M. Ajtai, J. Komlos and E. Szemerédi, "An O(n lg n) Sorting Network," Combinatorica, Vol. 3, pp. 1-19, 1983.
3. J. Aspnes, M. Herlihy and N. Shavit, "Counting Networks," Journal of the ACM, Vol. 41, pp. 1020-1048, 1994.
4. K. E. Batcher, "Sorting Networks and their Applications," Proceedings of the AFIPS Joint Computer Conference, pp. 334-338, 1968.
5. C. Busch and M. Mavronicolas, "An Efficient Counting Network," Proceedings of the 1st Merged Symposium IPPS/SPDP 1998 pp. 380-384, 1998.
6. D. P. Bertsekas and J. N. Tsitsiklis, Parallel and, Distributed Computation: Numerical Methods, Athena Scientific, 1997.
7. M. Dowd, Y. Perl, L. Rudoplh, and M. Saks, "The Periodic Balanced Sorting Network," Journal of the ACM, Vol. 36, pp. 738-757, 1989.
8. M. Herlihy and N. Shavit, The Art of Multiprocessor Programming, Morgan Kaufmann/Elsevier, 2008.
9. M. Herlihy and S. Tirthapura, "Randomized Smoothing Networks," Journal of Parallel and Distributed Computing, Vol. 66, pp. 626-632, 2006.
10. M. Herlihy and S. Tirthapura, "Self-Stabilizing Smoothing and Counting Networks," Distributed Computing, Vol. 18, pp. 345-357, 2006.
11. W. Hoeffding. "Probability Inequalities for Sums of Bounded Random Variables," Journal of the American Statistical Association, Vol. 53, pp. 13-30, 1963.
12. S. Kapidakis and M. Mavronicolas, "Distributed, Low Contention Task Allocation," Proceedings of the 8th IEEE Symposium on Parallel and Distributed Processing, pp. 358-365, 1996.
13. M. Klugerman, Small-Depth Counting Networks and Related. Topics, Ph.D. Thesis, Massachusetts Institute of Technology, September 1994.
14. M. Klugerman and C. G. Plaxton, "Small-Depth Counting Networks," Proceedings of the 24th ACM Symposium on Theory of Computing, pp. 417-428, 1992.
15. C. P. Kruskal and M. Snir, "A Unified Theory of Interconnection Network Structure," Theoretical Computer Science, Vol. 48, No. 3, pp. 75-94, 1986.