Sciweavers

1453 search results - page 7 / 291
» State and history in operating systems
Sort
View
CONCUR
2010
Springer
14 years 11 months ago
Reasoning about Optimistic Concurrency Using a Program Logic for History
Optimistic concurrency algorithms provide good performance for parallel programs but they are extremely hard to reason about. Program logics such as concurrent separation logic and...
Ming Fu, Yong Li, Xinyu Feng, Zhong Shao, Yu Zhang
HIPEAC
2007
Springer
15 years 4 months ago
Branch History Matching: Branch Predictor Warmup for Sampled Simulation
Computer architects and designers rely heavily on simulation. The downside of simulation is that it is very time-consuming — simulating an industry-standard benchmark on today...
Simon Kluyskens, Lieven Eeckhout
DAGSTUHL
2007
14 years 11 months ago
Logical Particle Filtering
Abstract. In this paper, we consider the problem of filtering in relational hidden Markov models. We present a compact representation for such models and an associated logical par...
Luke S. Zettlemoyer, Hanna M. Pasula, Leslie Pack ...
OSDI
2008
ACM
15 years 10 months ago
CuriOS: Improving Reliability through Operating System Structure
An error that occurs in a microkernel operating system service can potentially result in state corruption and service failure. A simple restart of the failed service is not always...
Francis M. David, Ellick Chan, Jeffrey C. Carlyle,...
AAAI
2004
14 years 11 months ago
A General Solution to the Graph History Interaction Problem
Since the state space of most games is a directed graph, many game-playing systems detect repeated positions with a transposition table. This approach can reduce search effort by ...
Akihiro Kishimoto, Martin Müller 0003