Sciweavers

275 search results - page 11 / 55
» Using Randomized Caches in Probabilistic Real-Time Systems
Sort
View
IEEEPACT
2007
IEEE
14 years 1 months ago
L1 Cache Filtering Through Random Selection of Memory References
Distinguishing transient blocks from frequently used blocks enables servicing references to transient blocks from a small fully-associative auxiliary cache structure. By inserting...
Yoav Etsion, Dror G. Feitelson
NAA
2004
Springer
178views Mathematics» more  NAA 2004»
14 years 29 days 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
ICECCS
1997
IEEE
92views Hardware» more  ICECCS 1997»
13 years 11 months ago
Cache based fault recovery for distributed systems
No cache based techniques for roll-forward fault recovery exist at present. A split-cache approach is proposed that provides e cient support for checkpointing and roll-forward fau...
Avi Mendelson, Neeraj Suri
VOSS
2004
Springer
135views Mathematics» more  VOSS 2004»
14 years 29 days ago
Analysing Randomized Distributed Algorithms
Abstract. Randomization is of paramount importance in practical applications and randomized algorithms are used widely, for example in co-ordinating distributed computer networks, ...
Gethin Norman
SAT
2005
Springer
162views Hardware» more  SAT 2005»
14 years 1 months ago
Heuristics for Fast Exact Model Counting
An important extension of satisfiability testing is model-counting, a task that corresponds to problems such as probabilistic reasoning and computing the permanent of a Boolean ma...
Tian Sang, Paul Beame, Henry A. Kautz