Sciweavers

362 search results - page 9 / 73
» Mechanizing and Improving Dependency Pairs
Sort
View
HPCA
2003
IEEE
14 years 7 months ago
Dynamic Data Dependence Tracking and its Application to Branch Prediction
To continue to improve processor performance, microarchitects seek to increase the effective instruction level parallelism (ILP) that can be exploited in applications. A fundament...
Lei Chen, Steve Dropsho, David H. Albonesi
RTA
2004
Springer
14 years 25 days ago
Automated Termination Proofs with AProVE
We describe the system AProVE, an automated prover to verify (innermost) termination of term rewrite systems (TRSs). For this system, we have developed and implemented efficient al...
Jürgen Giesl, René Thiemann, Peter Sch...
IPPS
2000
IEEE
13 years 12 months ago
A Mechanism for Speculative Memory Accesses Following Synchronizing Operations
In order to reduce the overhead of synchronizing operations of shared memory multiprocessors, this paper proposes a mechanism, named specMEM, to execute memory accesses following ...
Takayuki Sato, Kazuhiko Ohno, Hiroshi Nakashima
ICPR
2008
IEEE
14 years 1 months ago
Tree-structure lossless coding using intervector angle
In this paper, we propose tree structure lossless coding, by which compression data are arranged in a tree structure. Current compression methods show improved performance by prod...
Jun Rokui
IEEEARES
2007
IEEE
14 years 1 months ago
Context-Dependent Access Control for Contextual Information
Abstract— Following Mark Weiser’s vision of ubiquitous computing and calm technology, computer systems should run in the background, preferably without the user noticing it at ...
Christin Groba, Stephan Grob, Thomas Springer