Data-access cost scales as N to the 1/4 in an abstract memory hierarchy for a class of applications.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Proposes and evaluates a multithreaded FA-BSP implementation using LCI and OpenMP that claims to outperform traditional MPI on the NAS Integer Sort benchmark with irregular Gaussian distributions.
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.
-
Multithreaded Fine-Grained Asynchronous BSP for Integer Sorting with LCI and OpenMP
Proposes and evaluates a multithreaded FA-BSP implementation using LCI and OpenMP that claims to outperform traditional MPI on the NAS Integer Sort benchmark with irregular Gaussian distributions.