Sciweavers

183 search results - page 5 / 37
» Linear-Time Algorithms in Memory Hierarchies
Sort
View
CF
2005
ACM
13 years 9 months ago
A case for a working-set-based memory hierarchy
Modern microprocessor designs continue to obtain impressive performance gains through increasing clock rates and advances in the parallelism obtained via micro-architecture design...
Steve Carr, Soner Önder
ICML
2006
IEEE
14 years 8 months ago
Fast and space efficient string kernels using suffix arrays
String kernels which compare the set of all common substrings between two given strings have recently been proposed by Vishwanathan & Smola (2004). Surprisingly, these kernels...
Choon Hui Teo, S. V. N. Vishwanathan
ICPPW
2002
IEEE
14 years 10 days ago
Near-Optimal Loop Tiling by Means of Cache Miss Equations and Genetic Algorithms
The effectiveness of the memory hierarchy is critical for the performance of current processors. The performance of the memory hierarchy can be improved by means of program transf...
Jaume Abella, Antonio González, Josep Llosa...
CIDR
2011
237views Algorithms» more  CIDR 2011»
12 years 11 months ago
Rethinking Database Algorithms for Phase Change Memory
Phase change memory (PCM) is an emerging memory technology with many attractive features: it is non-volatile, byte-addressable, 2–4X denser than DRAM, and orders of magnitude be...
Shimin Chen, Phillip B. Gibbons, Suman Nath
PPOPP
2003
ACM
14 years 20 days ago
Factorization with morton-ordered quadtree matrices for memory re-use and parallelism
Quadtree matrices using Morton-order storage provide natural blocking on every level of a memory hierarchy. Writing the natural recursive algorithms to take advantage of this bloc...
Jeremy D. Frens, David S. Wise