Fast, contention-free combining tree barriers for shared-memory multiprocessors

Michael L. Scott, John M. Mellor-Crummey. Fast, contention-free combining tree barriers for shared-memory multiprocessors. International Journal of Parallel Programming, 22(4):449-481, 1994. [doi]

@article{ScottM94,
  title = {Fast, contention-free combining tree barriers for shared-memory multiprocessors},
  author = {Michael L. Scott and John M. Mellor-Crummey},
  year = {1994},
  doi = {10.1007/BF02577741},
  url = {http://dx.doi.org/10.1007/BF02577741},
  researchr = {https://researchr.org/publication/ScottM94},
  cites = {0},
  citedby = {0},
  journal = {International Journal of Parallel Programming},
  volume = {22},
  number = {4},
  pages = {449-481},
}