Sciweavers

290 search results - page 8 / 58
» A Study of Branch Prediction Strategies
Sort
View
ISCAPDCS
2003
14 years 11 months ago
N-Tuple Compression: A Novel Method for Compression of Branch Instruction Traces
Branch predictors and processor front-ends have been the focus of a number of computer architecture studies. Typically they are evaluated separately from other components using tr...
Aleksandar Milenkovic, Milena Milenkovic, Jeffrey ...
ASAP
2007
IEEE
133views Hardware» more  ASAP 2007»
15 years 1 months ago
An Efficient Hardware Support for Control Data Validation
Software-based, fine-grain control flow integrity (CFI) validation technique has been proposed to enforce control flow integrity of program execution. By validating every indirect...
Yong-Joon Park, Zhao Zhang, Gyungho Lee
GECCO
2008
Springer
170views Optimization» more  GECCO 2008»
14 years 10 months ago
Evolving prediction weights using evolution strategy
The evolution strategy is one of the strongest evolutionary algorithms for optimizing real-value vectors. In this paper, we study how to use it for the evolution of prediction wei...
Trung Hau Tran, Cédric Sanza, Yves Duthen
LCPC
2005
Springer
15 years 3 months ago
Revisiting Graph Coloring Register Allocation: A Study of the Chaitin-Briggs and Callahan-Koblenz Algorithms
Techniques for global register allocation via graph coloring have been extensively studied and widely implemented in compiler frameworks. This paper examines a particular variant â...
Keith D. Cooper, Anshuman Dasgupta, Jason Eckhardt
ISCI
2002
130views more  ISCI 2002»
14 years 9 months ago
A study of object declustering strategies in parallel temporal object database systems
In a transaction-time temporal object database management system (TODBMS), updating an object creates a new version of the object, but the old version is still accessible. A TODBM...
Kjetil Nørvåg