Sciweavers

2703 search results - page 389 / 541
» Optimizing memory transactions
Sort
View
122
Voted
OOPSLA
2004
Springer
15 years 9 months ago
Finding your cronies: static analysis for dynamic object colocation
This paper introduces dynamic object colocation, an optimization to reduce copying costs in generational and other incremental garbage collectors by allocating connected objects t...
Samuel Z. Guyer, Kathryn S. McKinley
146
Voted
PLDI
2010
ACM
15 years 8 months 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 ...
PPPJ
2009
ACM
15 years 8 months ago
SlimVM: a small footprint Java virtual machine for connected embedded systems
The usage of cellular phones, PDAs, and other mobile devices has increased dramatically over the past ten years. Java is targeted to be one of the most popular execution environme...
Christoph Kerschbaumer, Gregor Wagner, Christian W...
ICDT
2001
ACM
147views Database» more  ICDT 2001»
15 years 8 months ago
Parallelizing the Data Cube
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
Frank K. H. A. Dehne, Todd Eavis, Susanne E. Hambr...
129
Voted
CASES
2007
ACM
15 years 7 months ago
Stack size reduction of recursive programs
For memory constrained environments like embedded systems, optimization for program size is often as important, if not more important, as optimization for execution speed. Commonl...
Stefan Schäckeler, Weijia Shang