2703 search results - page 410 / 541 » Optimizing memory transactions |
142
click to vote
PLDI
1999
ACM
15 years 10 months ago
1999
ACM
Load-reuse analysis finds instructions that repeatedly access the same memory location. This location can be promoted to a register, eliminating redundant loads by reusing the re...
213
click to vote
CADE
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. We present the first implementation of a theorem prover running on a smart card. The prover is written in Java and implements a dual tableau calculus. Due to the limited ...
169
click to vote
SPAA
1998
ACM
15 years 10 months ago
1998
ACM
Modern shared-memory multiprocessors use complex memory system implementations that include a variety of non-trivial and interacting optimizations. More time is spent in verifying...
162
click to vote
SPAA
1997
ACM
15 years 10 months ago
1997
ACM
Consider a set of shared objects in a distributed network, where several copies of each object may exist at any given time. To ensure both fast access to the objects as well as e ...
190
click to vote
CF
2007
ACM
15 years 10 months ago
2007
ACM
In this paper we describe a new technique, called pipeline spectroscopy, and use it to measure the cost of each cache miss. The cost of a miss is displayed (graphed) as a histogra...