S. M. Blackburn, S. Singhai, M. Hertz, K. S. McKinely, and J. E. B. Moss. Pretenuring for java. In Proceedings of the 16th ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), pages 342--352. ACM Press, 2001.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....memory deallocation. However, garbage collection imposes a performance overhead since it must identify and reuse memory that is no longer accessible by the program, while the program is executing. The performance of heap allocation and collection techniques has been the focus of much research [10, 12, 9, 16, 1, 13, 31, 6]. The goal of most of this prior work has been to provide generalpurpose mechanisms that enable high performance execution across all applications. However, other prior research [5, 14, 33] has shown that the efficacy of a memory management system (the allocator and the garbage collector) is ....

BLACKBURN, S., MOSS, J., MCKINLEY, K., AND STEPHANOVIC, D. Pretenuring for Java. In Proceedings of the Conference on Object-Oriented Programming Systems, Languages, and Applications (OOPSLA) (Tampa, FL, Oct 2001).

....assume that whoever allocated a block of memory should be responsible for paying for that memory. We implemented exactly such a mechanism to account for memory usage in IBM s RVM [24] by modifying the RVM s garbage collector [25] New pluggable garbage collection systems for Java, such as GCTk [26], may allow us to implement such features without requiring changes to the underlying JVM. In addition, the Real time Specification for Java allows programs to create individual memory regions treated differently by the garbage collector and select from which region memory is allocated. See ....

Blackburn, S.M., Singhai, S., Hertz, M., McKinley, K.S., Moss, J.E.B.: Pretenuring for Java. In: OOPSLA 2001: Conference on Object-Oriented Programming Systems, Languages, and Applications. Volume 36 of ACM SIGPLAN Notices., Tampa Bay, Florida (2001) 342--352

....assume that whoever allocated a block of memory should be responsible for paying for that memory. We implemented exactly such a mechanism to account for memory usage in IBM s RVM [2] by modifying the RVM s garbage collector [63] New pluggable garbage collection systems for Java, such as GCTk [10], may allow us to implement such features without requiring changes to the underlying JVM. In addition, the Real time Specification for Java allows programs to create individual memory regions treated differently by the garbage collector and select from which region memory is allocated. Thread ....

S. M. Blackburn, S. Singhai, M. Hertz, K. S. McKinley, and J. E. B. Moss. Pretenuring for Java. In OOPSLA 2001.

.... partitioning [39, 34] used in generational garbage collectors, provides the above properties for the youngest objects, these properties do not necessarily hold for the older objects [21] To alleviate some of the shortcomings of age based partitioning, researchers have proposed many enhancements [4, 10, 11, 24, 43]. Our work explores whether the connectivity of objects can yield new partitioning schemes or improve existing schemes. We investigate both direct connectivity (e.g. object O1 points to object O2 ) and transitive connectivity (e.g. object O1 is reachable from object O2 ) Using empirical ....

....of connectivity: i) connectivity from the stack (ii) connectivity , and (iii) connectivity in the heap. Our results indicate that all three kinds of connectivity correlate strongly with object lifetimes and deathtimes: i) objects that are reachable only from the stack are usually shortlived [4]; ii) objects that are reachable from globals usually live for most of the program execution; iii) heap objects with a pointer (or path of pointers) between them usually have the same deathtime. We also discuss an algorithm for performing partial garbage collections based on connectivity ....

[Article contains additional citation context not shown here]

S. Blackburn, S. Singhai, M. Hertz, K. S. McKinley, and J. E. B. Moss. Pretenuring for Java. In and Applications (OOPSLA), 2001.

No context found.

BLACKBURN, S. M., SINGHAI, S., HERTZ, M., MCKINLEY, K. S., AND MOSS, J. E. B. Pretenuring for Java. In Proceedings of SIGPLAN 2001.

No context found.

S. M. Blackburn, S. Singhai, M. Hertz, , K. S. McKinley, and J. E. B. Moss. Pretenuring for Java. In ACM Conference on Object-Oriented Programming Systems, Languages, and Applications, pages 342--352, Tampa, FL, Oct. 2001. ACM.

....a large object space. Direct comparisons between GCTk and the native Jikes RVM collectors are therefore not possible without significant changes to one of the systems. After developing the generational collectors, we tuned them over an eighteen month period of heavy use in several contexts [7, 8]. For example, they use a very fast address order write barrier [7] We compare Beltway against these collectors. These collectors are not limited in any way by the generalizations we employ in Beltway. We did however design GCTk using object oriented techniques which enables the reuse of key GC ....

....is complete, unlike older first. More importantly, Beltway generalizes over all these previous collector organizations, and, in addition, supports segregation by object characteristics such as size [21] type [27] or allocation site (e.g. segregation of longlived, immortal, or immutable objects) [8, 14], although we do not explore this type of segregation in this paper. Any references into an increment must be tracked if that increment is to be collected independently. Pointer tracking may use remembered sets [34] card marking [39] hardware support [4, 9, 16, 26] or a combination of ....

[Article contains additional citation context not shown here]

Stephen M. Blackburn, Sharad Singhai, Matthew Hertz, Kathryn S. McKinley, and J. Eliot B. Moss. Pretenuring for Java. In Proceedings of the 2001.

....benchmarks, though not all, the Older First collector achieves significantly lower maximum pause times than generational collectors. We believe better implementations of OF are possible. For instance, profile driven pretenuring provides immediate improvements to this basic collector organization [6]. We hope eventually to build OF in a 64 bit environment, in which OF will have the same fast write barrier as the generational collectors. The question of adaptive tuning of window size and other heap configurations remains open, as well as generalizations of the Older First window motion ....

BLACKBURN, S. M., SINGHAI, S., HERTZ, M., MCKINLEY, K. S., AND MOSS, J. E. B. Pretenuring for Java. In Proceedings of SIGPLAN 2001.

....material are the authors and do not necessarily reflect those of the sponsors. ing surge in GC research. A number of studies use object lifetime traces and simulations to examine the effectiveness of new GC algorithms [13, 19] Others use traces to tune garbage collection via profile feedback [5, 6, 12, 16]. The demand for traces is sufficient that the GC research community is discussing a standard file format to enable sharing of traces [7] Producing perfectly accurate traces is currently a very time consuming process; for many benchmarks (such as SPEC 202 jess, SPEC 213 javac, or SPEC 228 jack) ....

BLACKBURN, S. M., SINGHAI, S., HERTZ, M., MCKINLEY, K. S., AND MOSS, J. E. B. Pretenuring for Java. In Proceedings of SIGPLAN 2001.

No context found.

S. M. Blackburn, S. Singhai, M. Hertz, K. S. McKinely, and J. E. B. Moss. Pretenuring for java. In Proceedings of the 16th ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), pages 342--352. ACM Press, 2001.

No context found.

BLACKBURN, S., MOSS, J., MCKINLEY, K., AND STEPHANOVIC, D. Pretenuring for Java. In Proceedings of the Conference on ObjectOriented Programming Systems, Languages, and Applications (OOPSLA) (Tampa, FL, Oct 2001).

No context found.

BLACKBURN, S., MOSS, J., MCKINLEY, K., AND STEPHANOVIC, D. Pretenuring for Java. In Proceedings of the Conference on Object-Oriented Programming Systems, Languages, and Applications (OOPSLA) (Tampa, FL, Oct 2001).

No context found.

Stephen Blackburn, Sharad Singhai, Matthew Hertz, Kathryn S. McKinley, and J. Eliot B. Moss. Pretenuring for Java. In Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), 2001.

No context found.

BLACKBURN, S., MOSS, J., MCKINLEY, K., AND STEPHANOVIC, D. Pretenuring for Java. In Proceedings of the Conference on ObjectOriented Programming Systems, Languages, and Applications (OOPSLA) (Tampa, FL, Oct 2001).

No context found.

S. M. Blackburn, S. Singhai, M. Hertz, K. S. McKinely, and J. E. B. Moss. Pretenuring for Java. In the Conference on Object Oriented Programming Systems Languages and Applications (OOPSLA'01), pages 342--352, Tampa Bay, FL, USA, 2001.

No context found.

Blackburn, S. M., Singhai, S., Hertz, M., McKinley, K. S., and Moss, J. E. B. Pretenuring for Java. In ACM Conference on Object-Oriented Programming, Systems, Languages and Applications, 2001.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC