Exploiting Coarse-Grained Parallelism in B+ Tree Searches on an APU

Mayank Daga, Mark Nutter. Exploiting Coarse-Grained Parallelism in B+ Tree Searches on an APU. In 2012 SC Companion: High Performance Computing, Networking Storage and Analysis, Salt Lake City, UT, USA, November 10-16, 2012. pages 240-247, IEEE Computer Society, 2012. [doi]

@inproceedings{DagaN12,
  title = {Exploiting Coarse-Grained Parallelism in B+ Tree Searches on an APU},
  author = {Mayank Daga and Mark Nutter},
  year = {2012},
  doi = {10.1109/SC.Companion.2012.40},
  url = {http://doi.ieeecomputersociety.org/10.1109/SC.Companion.2012.40},
  researchr = {https://researchr.org/publication/DagaN12},
  cites = {0},
  citedby = {0},
  pages = {240-247},
  booktitle = {2012 SC Companion: High Performance Computing, Networking Storage and Analysis, Salt Lake City, UT, USA, November 10-16, 2012},
  publisher = {IEEE Computer Society},
  isbn = {978-1-4673-6218-4},
}