The cache complexity of multithreaded cache oblivious algorithms

Matteo Frigo, Volker Strumpen. The cache complexity of multithreaded cache oblivious algorithms. In Phillip B. Gibbons, Uzi Vishkin, editors, SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallel Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30 - August 2, 2006. pages 271-280, ACM, 2006. [doi]

@inproceedings{FrigoS06,
  title = {The cache complexity of multithreaded cache oblivious algorithms},
  author = {Matteo Frigo and Volker Strumpen},
  year = {2006},
  doi = {10.1145/1148109.1148157},
  url = {http://doi.acm.org/10.1145/1148109.1148157},
  tags = {caching},
  researchr = {https://researchr.org/publication/FrigoS06},
  cites = {0},
  citedby = {0},
  pages = {271-280},
  booktitle = {SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallel Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30 - August 2, 2006},
  editor = {Phillip B. Gibbons and Uzi Vishkin},
  publisher = {ACM},
  isbn = {1-59593-452-9},
}