3206 search results - page 92 / 642 » Optimizing Graph Algorithms for Improved Cache Performance |
119
Voted
OSDI
2004
ACM
16 years 2 months ago
2004
ACM
Program-counter-based (PC-based) prediction techniques have been shown to be highly effective and are widely used in computer architecture design. In this paper, we explore the op...
130
click to vote
ESA
2001
Springer
15 years 7 months ago
2001
Springer
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...
155
click to vote
MICRO
1997
IEEE
15 years 6 months ago
1997
IEEE
Modern architectural trends in instruction-level parallelism (ILP) are to increase the computational power of microprocessors significantly. As a result, the demands on memory ha...
112
Voted
SWAT
2004
Springer
15 years 8 months ago
2004
Springer
The first polynomial time algorithm (O(n4 )) for modular decomposition appeared in 1972 [8] and since then there have been incremental improvements, eventually resulting in linear...
115
Voted
ECAI
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. This paper describes a new way of implementing an intelligent web caching service, based on an analysis of usage. Since the cache size in software is limited, and the sea...