•Can we quantify the inherent data locality of key algorithms?
•Do there exist “hierarchical” variants of key
algorithms?
•Do there exist “latency tolerant” variants of key algorithms?
•Can bandwidth-intensive algorithms be substituted for latency-sensitive algorithms?
•Can Little’s Law be “beaten” by formulating algorithms that access data lower in the memory hierarchy? If so, then systems such as
HTMT can be used effectively.