Sciweavers

7064 search results - page 3 / 1413
» From States to Histories
Sort
View
JILP
2000
90views more  JILP 2000»
13 years 7 months ago
Speculative Updates of Local and Global Branch History: A Quantitative Analysis
In today's wide-issue processors, even small branch-misprediction rates introduce substantial performance penalties. Worse yet, inadequate branch prediction creates a bottlen...
Kevin Skadron, Margaret Martonosi, Douglas W. Clar...
CASSIS
2004
Springer
14 years 26 days ago
History-Based Access Control and Secure Information Flow
Abstract. This paper addresses the problem of static checking of programs to ensure that they satisfy confidentiality policies in the presence of dynamic access control in the for...
Anindya Banerjee, David A. Naumann
HIPEAC
2007
Springer
14 years 1 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
AAAI
2004
13 years 8 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
ICALP
2007
Springer
14 years 1 months ago
Deterministic History-Independent Strategies for Storing Information on Write-Once Memories
Motivated by the challenging task of designing “secure” vote storage mechanisms, we study information storage mechanisms that operate in extremely hostile environments. In suc...
Tal Moran, Moni Naor, Gil Segev