Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

article · 2021

Processor-Aware Cache-Oblivious Algorithms✱

Yuan Tang, Weiguo Gao

Cited by 3Abstract and details only

Abstract

Frigo et al. proposed an ideal cache model and a recursive technique to design sequential cache-efficient algorithms in a cache-oblivious fashion. Ballard et al. pointed out that it is a fundamental open problem to extend the technique to an arbitrary architecture. Ballard et al. raised another open question on how to parallelize Strassen’s algorithm exactly and efficiently on an arbitrary number of processors.

Cite this paper

APA 7

Tang, Y., & Gao, W. (2021). Processor-Aware Cache-Oblivious Algorithms✱. https://doi.org/10.1145/3472456.3472506

MLA 9

Tang, Yuan, and Weiguo Gao. “Processor-Aware Cache-Oblivious Algorithms✱.” 2021, pp. 1–10, https://doi.org/10.1145/3472456.3472506.

Chicago

Tang, Yuan, and Weiguo Gao. 2021. “Processor-Aware Cache-Oblivious Algorithms✱.” https://doi.org/10.1145/3472456.3472506.

Harvard

Tang, Y. and Gao, W. (2021) ‘Processor-Aware Cache-Oblivious Algorithms✱’. Available at: https://doi.org/10.1145/3472456.3472506.

BibTeX
@article{tang2021processor,
  title = {{Processor-Aware Cache-Oblivious Algorithms✱}},
  author = {Tang, Yuan and Gao, Weiguo},
  pages = {1--10},
  year = {2021},
  doi = {10.1145/3472456.3472506}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.

Related papers