## Diffracting trees (1994)

### Cached

### Download Links

- [www.cs.bgu.ac.il]
- [www.cs.bgu.ac.il]
- [theory.csail.mit.edu]
- [theory.csail.mit.edu]
- [www.math.tau.ac.il]
- [www.math.tau.ac.il]
- [www.cs.brown.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | In Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures. ACM |

Citations: | 57 - 12 self |

### BibTeX

@INPROCEEDINGS{Shavit94diffractingtrees,

author = {Nir Shavit and Asaph Zemach},

title = {Diffracting trees},

booktitle = {In Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures. ACM},

year = {1994}

}

### Years of Citing Articles

### OpenURL

### Abstract

Shared counters are among the most basic coordination structures in multiprocessor computation, with applications ranging from barrier synchronization to concurrent-data-structure design. This article introduces diffracting trees, novel data structures for shared counting and load balancing in a distributed/parallel environment. Empirical evidence, collected on a simulated distributed shared-memory machine and several simulated message-passing architectures, shows that diffracting trees scale better and are more robust than both combining trees and counting networks, currently the most effective known methods for implementing concurrent counters in software. The use of a randomized coordination method together with a combinatorial data structure overcomes the resiliency drawbacks of combining trees. Our simulations show that to handle the same load, diffracting trees and counting networks should have a similar width w, yet the depth of a diffracting tree is O(log w), whereas counting networks have depth O(log 2 w). Diffracting trees have already been used to implement highly efficient producer/consumer queues, and we believe diffraction will prove to be an effective alternative paradigm to combining and queue-locking in the design of many concurrent data structures.