Sciweavers

334 search results - page 36 / 67
» eXtended Block Cache
Sort
View
FOCS
2003
IEEE
14 years 27 days ago
The Cost of Cache-Oblivious Searching
This paper gives tight bounds on the cost of cache-oblivious searching. The paper shows that no cache-oblivious search structure can guarantee a search performance of fewer than l...
Michael A. Bender, Gerth Stølting Brodal, R...
ICALP
2003
Springer
14 years 25 days ago
Optimal Cache-Oblivious Implicit Dictionaries
We consider the issues of implicitness and cache-obliviousness in the classical dictionary problem for n distinct keys over an unbounded and ordered universe. One finding in this ...
Gianni Franceschini, Roberto Grossi
IPPS
2002
IEEE
14 years 16 days ago
Memory-Intensive Benchmarks: IRAM vs. Cache-Based Machines
The increasing gap between processor and memory performance has led to new architectural models for memory-intensive applications. In this paper, we use a set of memory-intensive ...
Brian R. Gaeke, Parry Husbands, Xiaoye S. Li, Leon...
CGO
2004
IEEE
13 years 11 months ago
Static Identification of Delinquent Loads
The effective use of processor caches is crucial to the performance of applications. It has been shown that cache misses are not evenly distributed throughout a program. In applic...
Vlad-Mihai Panait, Amit Sasturkar, Weng-Fai Wong
MICRO
2008
IEEE
121views Hardware» more  MICRO 2008»
14 years 2 months ago
Temporal instruction fetch streaming
—L1 instruction-cache misses pose a critical performance bottleneck in commercial server workloads. Cache access latency constraints preclude L1 instruction caches large enough t...
Michael Ferdman, Thomas F. Wenisch, Anastasia Aila...