Data-access cost scales as N to the 1/4 in an abstract memory hierarchy for a class of applications.
International Journal of Parallel Programming , volume =
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The Fourth-Root Complexity of Data Movement
Data-access cost scales as N to the 1/4 in an abstract memory hierarchy for a class of applications.