286 search results - page 25 / 58 » Cache Remapping to Improve the Performance of Tiled Algorith... |
119
Voted
ADVIS
2000
Springer
15 years 7 months ago
2000
Springer
Modern applications demand support for a large number of clients and require large scale storage subsystems. This paper presents a theoretical model of prefetching and caching of s...
136
click to vote
ICS
2004
Tsinghua U.
15 years 8 months ago
2004
Tsinghua U.
Storage mapping optimization is a flexible approach to folding array dimensions in numerical codes. It is designed to reduce the memory footprint after a wide spectrum of loop tr...
116
Voted
SIGMOD
2001
ACM
16 years 3 months ago
2001
ACM
Caching approximate values instead of exact values presents an opportunity for performance gains in exchange for decreased precision. To maximize the performance improvement, cach...
133
Voted
ISSAC
2009
Springer
15 years 10 months ago
2009
Springer
We present a high performance algorithm for multiplying sparse distributed polynomials using a multicore processor. Each core uses a heap of pointers to multiply parts of the poly...
99
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
A generalization of the heapsort algorithm is proposed. At the expense of about 50% more comparison and move operations for typical cases, the dualheap sort algorithm offers sever...