Sciweavers

99 search results - page 16 / 20
» Compiler-Cooperative Memory Management in Java
Sort
View
POS
1998
Springer
13 years 11 months ago
Optimizing the Read and Write Barriers for Orthogonal Persistence
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 ...
Antony L. Hosking, Nathaniel Nystrom, Quintin I. C...
PLDI
2010
ACM
14 years 19 days ago
Finding low-utility data structures
Many opportunities for easy, big-win, program optimizations are missed by compilers. This is especially true in highly layered Java applications. Often at the heart of these misse...
Guoqing Xu, Nick Mitchell, Matthew Arnold, Atanas ...
TC
2008
13 years 7 months ago
The Synonym Lookaside Buffer: A Solution to the Synonym Problem in Virtual Caches
To support dynamic address translation in today's microprocessors, the first-level cache is accessed in parallel with a translation lookaside buffer (TLB). However, this curre...
Xiaogang Qiu, Michel Dubois
OOPSLA
2004
Springer
14 years 27 days ago
The garbage collection advantage: improving program locality
As improvements in processor speed continue to outpace improvements in cache and memory speed, poor locality increasingly degrades performance. Because copying garbage collectors ...
Xianglong Huang, Stephen M. Blackburn, Kathryn S. ...
ASPLOS
2009
ACM
14 years 8 months ago
Leak pruning
Managed languages improve programmer productivity with type safety and garbage collection, which eliminate memory errors such as dangling pointers, double frees, and buffer overfl...
Michael D. Bond, Kathryn S. McKinley