Sciweavers

111 search results - page 2 / 23
» Analysis of Branch Prediction Via Data Compression
Sort
View
SIGSOFT
2005
ACM
14 years 6 months ago
Arithmetic program paths
We present Arithmetic Program Paths, a novel, efficient way to compress program control-flow traces that reduces program bit traces to less than a fifth of their original size whi...
Manos Renieris, Shashank Ramaprasad, Steven P. Rei...
IEEEPACT
1998
IEEE
13 years 10 months ago
Static Methods in Hybrid Branch Prediction
Hybrid branch predictors combine the predictions of multiple single-level or two-level branch predictors. The prediction-combining hardware -- the "meta-predictor" -may ...
Dirk Grunwald, Donald C. Lindsay, Benjamin G. Zorn
EXPERT
2007
76views more  EXPERT 2007»
13 years 5 months ago
Online Sequential Prediction via Incremental Parsing: The Active LeZi Algorithm
Prediction is an important component in a variety of domains. Intelligent systems that can predict future events are better enabled to make more informed, and therefore more relia...
Karthik Gopalratnam, Diane J. Cook
WWW
2006
ACM
14 years 6 months ago
Compressing and searching XML data via two zips
XML is fast becoming the standard format to store, exchange and publish over the web, and is getting embedded in applications. Two challenges in handling XML are its size (the XML...
Paolo Ferragina, Fabrizio Luccio, Giovanni Manzini...
RTS
2006
129views more  RTS 2006»
13 years 5 months ago
Modeling out-of-order processors for WCET analysis
Estimating the Worst Case Execution Time (WCET) of a program on a given processor is important for the schedulability analysis of real-time systems. WCET analysis techniques typic...
Xianfeng Li, Abhik Roychoudhury, Tulika Mitra