Construct · 1 fields · 1 citations

cache-oblivious algorithm: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Computer architecture

an algorithm that uses the memory hierarchy efficiently without knowing cache size or block length as parameters.

In computer architecture, cache-oblivious algorithm refers to an algorithm that uses the memory hierarchy efficiently without knowing cache size or block length as parameters. This meaning comes from Frigo (1999) in 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how cache-oblivious algorithm sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

architecture3 fields · 4 citationsjingle · one word, three constructs block3 fields · 6 citationsjingle · one word, three constructs cache2 fields · 4 citationsjingle · one word, two constructs

References

Frigo, M., Leiserson, C. E., Prokop, H., & Ramachandran, S. (1999). Cache-oblivious algorithms. 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039). https://doi.org/10.1109/sffcs.1999.814600

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct