Object equality profiling

MarinovDarko,; O'CallahanRobert,

doi:10.1145/949343.949333

Cited by 15 publications

(23 citation statements)

References 40 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In addition, their approach is meant to applied by the programmer. Our work differs from [24] in three main aspects. First, we do not have the limitations mentioned above.…”

Section: Related Workmentioning

confidence: 95%

“…Marinov and O'Callahan [24] proposed Object Equality Profiling (OEP) for helping programmers discover optimization opportunities in programs. Based on profiling of objects, they partition the objects into equality sets.…”

Section: Related Workmentioning

confidence: 99%

“…This similarity among objects can be exploited to reduce the heap space. For example, the schemes proposed in [25,24,13] compare the content of an object with a set of existing objects and replace the similar ones with a single copy in order to reduce the storage space. However, this is done mainly as a manual operation.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Exploiting frequent field values in java objects for reducing heap memory requirements

Chen

Kandemir

Irwin

2005

Proceedings of the 1st ACM/USENIX International Conference on Virtual Execution Environments

View full text Add to dashboard Cite

The capabilities of applications executing on embedded and mobile devices are strongly influenced by memory size limitations. In fact, memory limitations are one of the main reasons that applications run slowly or even crash in embedded/mobile devices. While improvements in technology enable the integration of more memory into embedded devices, the amount memory that can be included is also limited by cost, power consumption, and form factor considerations. Consequently, addressing memory limitations will continue to be of importance.Focusing on embedded Java environments, this paper shows how object compression can improve memory space utilization. The main idea is to make use of the observation that a small set of values tend to appear in some fields of the heapallocated objects much more frequently than other values. Our analysis shows the existence of such frequent field values in the SpecJVM98 benchmark suite. We then propose two object compression schemes that eliminate/reduce the space occupied by the frequent field values. Our extensive experimental evaluation using a set of eight Java benchmarks shows that these schemes can reduce the minimum heap size allowing Java applications to execute without outof-memory exceptions by up to 24% (14% on an average).

show abstract

“…In addition, their approach is meant to applied by the programmer. Our work differs from [24] in three main aspects. First, we do not have the limitations mentioned above.…”

Section: Related Workmentioning

confidence: 95%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Exploiting frequent field values in java objects for reducing heap memory requirements

Chen

Kandemir

Irwin

2005

Proceedings of the 1st ACM/USENIX International Conference on Virtual Execution Environments

View full text Add to dashboard Cite

show abstract

“…Object access profiles include properties such as writeonly objects, immutable objects, and non-accessed bytes based on the information about which program instructions access which fields of which objects. Object access profiling is crucial for many object optimizations, including object compression [5,12,21], lazy allocation [5,24], field reordering [6], and object merging [12]. For example, if certain objects are unlikely to be accessed after initialization, they should be compressed.…”

Section: Introductionmentioning

confidence: 99%

Continuous object access profiling and optimizations to overcome the memory wall and bloat

Odaira

Nakatani

2012

Proceedings of the Seventeenth International Conference on Architectural Support for Programming Languages and Operating System

View full text Add to dashboard Cite

Future microprocessors will have more serious memory wall problems since they will include more cores and threads in each chip. Similarly, future applications will have more serious memory bloat problems since they are more often written using objectoriented languages and reusable frameworks. To overcome such problems, the language runtime environments must accurately and efficiently profile how programs access objects.We propose Barrier Profiler, a low-overhead object access profiler using a memory-protection-based approach called pointer barrierization and adaptive overhead reduction techniques. Unlike previous memory-protection-based techniques, pointer barrierization offers per-object protection by converting all of the pointers to a given object to corresponding barrier pointers that point to protected pages. Barrier Profiler achieves low overhead by not causing signals at object accesses that are unrelated to the needed profiles, based on profile feedback and a compiler analysis. Our experimental results showed Barrier Profiler provided sufficiently accurate profiles with 1.3% on average and at most 3.4% performance overhead for allocation-intensive benchmarks, while previous code-instrumentation-based techniques suffered from 9.2% on average and at most 12.6% overhead. The low overhead allows Barrier Profiler to be run continuously on production systems. Using Barrier Profiler, we implemented two new online optimizations to compress write-only character arrays and to adjust the initial sizes of mostly non-accessed arrays. They resulted in speed-ups of up to 8.6% and 36%, respectively.

show abstract

“…To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. tion [12,14] or flyweight [8]). They also enable compiler optimizations such as reducing the number of dynamic reads [16].…”

Section: Introductionmentioning

confidence: 99%

Transformation for class immutability

Kjølstad

Dig

Acevedo

et al. 2011

Proceedings of the 33rd International Conference on Software Engineering

View full text Add to dashboard Cite

It is common for object-oriented programs to have both mutable and immutable classes. Immutable classes simplify programing because the programmer does not have to reason about side-effects. Sometimes programmers write immutable classes from scratch, other times they transform mutable into immutable classes. To transform a mutable class, programmers must find all methods that mutate its transitive state and all objects that can enter or escape the state of the class. The analyses are non-trivial and the rewriting is tedious. Fortunately, this can be automated.We present an algorithm and a tool, Immutator, that enables the programmer to safely transform a mutable class into an immutable class. Two case studies and one controlled experiment show that Immutator is useful. It (i) reduces the burden of making classes immutable, (ii) is fast enough to be used interactively, and (iii) is much safer than manual transformations.

show abstract

Object equality profiling

Cited by 15 publications

References 40 publications

Exploiting frequent field values in java objects for reducing heap memory requirements

Exploiting frequent field values in java objects for reducing heap memory requirements

Continuous object access profiling and optimizations to overcome the memory wall and bloat

Transformation for class immutability

Contact Info

Product

Resources

About