Marios Mavronicolas
ABSTRACT
We revisit smoothing networks which are made up of balancers and wires. Tokens arrive arbitrarily on w input wires and propagate asynchronously through the network; each token gets service on the output wire it arrives at. The smoothness is the maximum discrepancy among the numbers of tokens arriving at the w output wires. We assume that balancers are oriented independently and uniformly at random. We present a collection of lower and upper bounds on smoothness, which are to some extent surprising:-The smoothness of a single block network is log log w + Θ(1) (with high probability), where the additive constant is between -2 and 4. This tight bound improves vastly over the upper bound of O(√log w) from Herlihy and Tirthapura, and it significantly improves our understanding of the smoothing properties of the block network. -Most significantly, the smoothness of the cascade of two block networks is no more than 16 (with high probability); this is the first known randomized network with so small depth (2 log w) and so good smoothness. The proof introduces some novel combinatorial and probabilistic structures and techniques which may be further applicable. This result demonstrates the full power of randomization in smoothing networks. -There is no randomized 1-smoothing network of width w and depth d that achieves 1-smoothness with probability better than d/w-1. In view of the deterministic 1-smoothing network from Klugerman and Plaxton, this result implies the first separation between deterministic and randomized smoothing networks, which demonstrates an unexpected limitation of randomization: it can get to constant smoothness very easily, but after that, the progress to 1-smoothing is very limited.
- 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. Google Scholar
Digital Library
- M. Ajtai, J. Komlós and E. Szemerédi,"An O(n lg n) Sorting Network," Combinatorica, Vol. 3, pp. 1--19, 1983. Google ScholarDigital Library
- J. Aspnes, M. Herlihy and N. Shavit,"Counting Networks," Journal of the ACM,Vol. 41, pp. 1020--1048, 1994. Google ScholarDigital Library
- K. E. Batcher,"Sorting Networks and their Applications," Proceedings of the AFIPS Joint Computer Conference, pp. 334--338, 1968.Google Scholar
- C. Busch and M. Mavronicolas,"An Efficient Counting Network," Proceedings of the 1st Merged Symposium IPPS/SPDP 1998pp. 380--384, 1998. Google ScholarDigital Library
- D. P. Bertsekas and J. N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods,Athena Scientific, 1997. Google ScholarDigital Library
- M. Dowd, Y. Perl, L. Rudoplh, and M. Saks,"The Periodic Balanced Sorting Network," Journal of the ACM,Vol. 36, pp. 738--757, 1989. Google ScholarDigital Library
- M. Herlihy and N. Shavit, The Art of Multiprocessor Programming,Morgan Kaufmann/Elsevier, 2008. Google ScholarDigital Library
- M. Herlihy and S. Tirthapura,"Randomized Smoothing Networks," Journal of Parallel and Distributed Computing,Vol. 66, pp. 626--632, 2006. Google ScholarDigital Library
- M. Herlihy and S. Tirthapura,"Self-Stabilizing Smoothing and Counting Networks," Distributed Computing,Vol. 18, pp. 345--357, 2006.Google ScholarDigital Library
- . Hoeffding.newblock "Probability Inequalities for Sums of Bounded Random Variables,"\newblock \textitJournal of the American Statistical Association, Vol. 53, pp. 13--30, 1963.Google ScholarCross Ref
- 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. Google ScholarDigital Library
- M. Klugerman, Small-Depth Counting Networks andRelated Topics,Ph.D. Thesis, Massachusetts Institute of Technology, September 1994. Google ScholarDigital Library
- M. Klugerman and C. G. Plaxton,"Small-Depth Counting Networks," Proceedings of the 24th ACM Symposium on Theory of Computing,pp. 417--428, 1992. Google ScholarDigital Library
- C. P. Kruskal and M. Snir,"A Unified Theory of Interconnection Network Structure," Theoretical Computer Science, Vol. 48, No. 3, pp. 75--94, 1986. Google ScholarDigital Library
Index Terms
- The impact of randomization in smoothing networks
Recommendations
The impact of randomization in smoothing networks
We revisit randomized smoothing networks (Herlihy and Tirthapura in J Parallel Distrib Comput 66(5):626---632, 2006), which are made up of balancers and wires. We assume that balancers are oriented independently and uniformly at random. Tokens arrive ...
Partially effective randomization in simulations between arbitrary and common PRAMs
It is known that Θ(log n/log log n) steps are needed to simulate one step of ARBITRARY CRCW PRAMs by COMMON CRCW PRAMs, but it was open whether there is a faster simulation when randomization is allowed. This paper gives both positive and negative ...
Faster randomized consensus with an oblivious adversary
Two new algorithms are given for randomized consensus in a shared-memory model with an oblivious adversary. Each is based on a new construction of a conciliator, an object that guarantees termination and validity, but that only guarantees agreement with ...
Comments