Randomized smoothing networks

  title={Randomized smoothing networks},
  author={Maurice Herlihy and Srikanta Tirthapura},
  journal={18th International Parallel and Distributed Processing Symposium, 2004. Proceedings.},
Summary form only given. A smoothing network is a distributed data structure that accepts tokens on input wires and routes them to output wires. It ensures that however imbalanced the traffic on input wires, the numbers of tokens emitted on output wires are approximately balanced. We study randomized smoothing networks, whose initial states are chosen at random. Randomized smoothing networks require no global initialization, and also require no global reconfiguration after faults. We make the… CONTINUE READING
Highly Cited
This paper has 18 citations. REVIEW CITATIONS


Publications referenced by this paper.
Showing 1-10 of 14 references

Sorting in c log n parallel sets

View 4 Excerpts
Highly Influenced

Sorting Networks and Their Applications

AFIPS Spring Joint Computing Conference • 1968
View 4 Excerpts
Highly Influenced

Switching networks for generating random permutations

M. Dowd, Y. Perl, L. Rudolph, M. Saks

A survey on counting networks

Y. Perl, L. Rudolph, M. Saks
Proceedings of Workshop on Distributed Data and Structures ( WDAS ) , March • 1998


W. Aiello, R. Venkatesan, M. Yung
weights and contention in balancing networks, in: Proceedings of the Annual ACM Symposium on Principles of Distributed Computing • 1994
View 2 Excerpts

Similar Papers

Loading similar papers…