Sciweavers

362 search results - page 5 / 73
» Making the Most of Cache Groups
Sort
View
ICASSP
2009
IEEE
14 years 4 months ago
Small-group learning projects to make signal processing more appealing: From speech processing to OFDMA synchronization
Whereas lecturing is the most widely used mode of instruction, we have explored small-group learning projects to make signal processing more appealing at the University and in Eng...
G. Ferre, Audrey Giremus, Eric Grivel
CF
2006
ACM
13 years 11 months ago
Intermediately executed code is the key to find refactorings that improve temporal data locality
The growing speed gap between memory and processor makes an efficient use of the cache ever more important to reach high performance. One of the most important ways to improve cac...
Kristof Beyls, Erik H. D'Hollander
AAECC
2007
Springer
111views Algorithms» more  AAECC 2007»
13 years 10 months ago
When cache blocking of sparse matrix vector multiply works and why
Abstract. We present new performance models and a new, more compact data structure for cache blocking when applied to the sparse matrixvector multiply (SpM×V) operation, y ← y +...
Rajesh Nishtala, Richard W. Vuduc, James Demmel, K...
HIPEAC
2007
Springer
14 years 4 months ago
Dynamic Capacity-Speed Tradeoffs in SMT Processor Caches
Caches are designed to provide the best tradeoff between access speed and capacity for a set of target applications. Unfortunately, different applications, and even different phas...
Sonia López, Steve Dropsho, David H. Albone...
EMSOFT
2009
Springer
14 years 4 months ago
Cache-aware scheduling and analysis for multicores
The major obstacle to use multicores for real-time applications is that we may not predict and provide any guarantee on real-time properties of embedded software on such platforms...
Nan Guan, Martin Stigge, Wang Yi, Ge Yu