Sciweavers

Share
VLDB
2004
ACM
126views Database» more  VLDB 2004»
9 years 3 months ago
STEPS towards Cache-resident Transaction Processing
Online transaction processing (OLTP) is a multibillion dollar industry with high-end database servers employing state-of-the-art processors to maximize performance. Unfortunately,...
Stavros Harizopoulos, Anastassia Ailamaki
NAA
2004
Springer
178views Mathematics» more  NAA 2004»
9 years 3 months ago
Performance Optimization and Evaluation for Linear Codes
In this paper, we develop a probabilistic model for estimation of the numbers of cache misses during the sparse matrix-vector multiplication (for both general and symmetric matrice...
Pavel Tvrdík, Ivan Simecek
ICCS
2004
Springer
9 years 3 months ago
Platform-Independent Cache Optimization by Pinpointing Low-Locality Reuse
Abstract. For many applications, cache misses are the primary performance bottleneck. Even though much research has been performed on automatically optimizing cache behavior at the...
Kristof Beyls, Erik H. D'Hollander
SPAA
2004
ACM
9 years 3 months ago
Effectively sharing a cache among threads
We compare the number of cache misses M1 for running a computation on a single processor with cache size C1 to the total number of misses Mp for the same computation when using p ...
Guy E. Blelloch, Phillip B. Gibbons
ASPLOS
2004
ACM
9 years 3 months ago
Software prefetching for mark-sweep garbage collection: hardware analysis and software redesign
Tracing garbage collectors traverse references from live program variables, transitively tracing out the closure of live objects. Memory accesses incurred during tracing are essen...
Chen-Yong Cher, Antony L. Hosking, T. N. Vijaykuma...
PPAM
2005
Springer
9 years 3 months ago
A New Diagonal Blocking Format and Model of Cache Behavior for Sparse Matrices
Algorithms for the sparse matrix-vector multiplication (shortly SpM×V ) are important building blocks in solvers of sparse systems of linear equations. Due to matrix sparsity, the...
Pavel Tvrdík, Ivan Simecek
ESA
2005
Springer
161views Algorithms» more  ESA 2005»
9 years 3 months ago
Cache-Oblivious Comparison-Based Algorithms on Multisets
Abstract. We study three comparison-based problems related to multisets in the cache-oblivious model: Duplicate elimination, multisorting and finding the most frequent element (th...
Arash Farzan, Paolo Ferragina, Gianni Franceschini...
CLUSTER
2005
IEEE
9 years 3 months ago
Fast Query Processing by Distributing an Index over CPU Caches
Data intensive applications on clusters often require requests quickly be sent to the node managing the desired data. In many applications, one must look through a sorted tree str...
Xiaoqin Ma, Gene Cooperman
SPAA
2006
ACM
9 years 4 months ago
The cache complexity of multithreaded cache oblivious algorithms
We present a technique for analyzing the number of cache misses incurred by multithreaded cache oblivious algorithms on an idealized parallel machine in which each processor has a...
Matteo Frigo, Volker Strumpen
ISCA
2006
IEEE
187views Hardware» more  ISCA 2006»
9 years 4 months ago
A Case for MLP-Aware Cache Replacement
Performance loss due to long-latency memory accesses can be reduced by servicing multiple memory accesses concurrently. The notion of generating and servicing long-latency cache m...
Moinuddin K. Qureshi, Daniel N. Lynch, Onur Mutlu,...
books