45 search results - page 5 / 9 » Optimal and Efficient Speculation-Based Partial Redundancy E... |
ICPP
1998
IEEE
15 years 2 months ago
1998
IEEE
To execute a shared memory program efficiently, we have to manage memory consistency with low overheads, and have to utilize communication bandwidth of the platform as much as pos...
PLDI
2003
ACM
15 years 3 months ago
2003
ACM
We describe a technique for automatically proving compiler optimizations sound, meaning that their transformations are always semantics-preserving. We first present a domainspeci...
POS
1998
Springer
15 years 2 months ago
1998
Springer
Persistent programming languages manage volatile memory as a cache for stable storage, imposing a read barrier on operations that access the cache, and a write barrier on updates ...
ECOOP
1998
Springer
15 years 2 months ago
1998
Springer
In this paper, we propose architectural support for object manipulation, stack processing and method invocation to enhance the execution speed of Java bytecodes. First, a virtual a...
PLDI
1990
ACM
15 years 1 months ago
1990
ACM
- This paper describes techniques for optimizing range checks performed to detect array bound violations. In addition to the elimination of range check:s, the optimizations discuss...