Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Towards a Theory of Cache-Efficient Algorithms   We describe a model that enables us to analyze the running time of an
algorithm in a computer with a memory hierarchy with limited associativity, in
terms of various cache parameters. Our model, an extension of Aggarwal and
Vitter's I/O model, enables us to establish useful relationships between the
cache complexity and the I/O complexity of computations. As a corollary, we
obtain cache-optimal algorithms for some fundamental problems like sorting,
FFT, and an important subclass of permutations in the single-level cache model.
We also show that ignoring associativity concerns could lead to inferior
performance, by analyzing the average-case cache behavior of mergesort. We
further extend our model to multiple levels of cache with limited associativity
and present optimal algorithms for matrix transpose and sorting. Our techniques
may be used for systematic exploitation of the memory hierarchy starting from
the algorithm design stage, and dealing with the hitherto unresolved problem of
limited associativity.

15
The categories of this paper are: nucl-ex
17
The categories of this paper are: q-fin
22
The categories of this paper are: chao-dyn
6
The categories of this paper are: astro-ph
19
The categories of this paper are: eess
9
The categories of this paper are: nlin
23
The categories of this paper are: solv-int
7
The categories of this paper are: hep-th
37
The categories of this paper are: supr-con
27
The categories of this paper are: comp-gas
33
The categories of this paper are: plasm-ph
26
The categories of this paper are: bayes-an
24
The categories of this paper are: dg-ga
3
The categories of this paper are: physics
28
The categories of this paper are: alg-geom
18
The categories of this paper are: econ