4th International Conference on Principles and Practices ... - MADOC

tion that most objects die young is no longer true in application
servers. Thus, the Generation Mark-Sweep technique used in the
HotSpot VM does not perform well. Second, garbage collection
techniques to increase paralellism while greatly improve the maximum
throughput, make degradation behavior worse. Third, Ulterior
Reference Counting, an incremental generational technique,
can positively impacted the degradation behavior. Last, more conservative
heap sizing policy only has slightly positive effect on the
degradation behavior. However, it can significantly reduce the heap
usage (20%) and the number of page fault (10%).
8. ACKNOWLEDGMENTS
This work is support in part by NSF under grant number CNS-
0411043. We also thank the reviewers for valuable comments.
9. REFERENCES
[1] A. W. Appel. Simple generational garbage collection and fast
allocation. Software Practice and Experience,
19(2):171–183, 1989.
[2] E. Armstrong. Hotspot a new breed of virtual machine.
JavaWorld, 1998.
[3] D. F. Bacon, C. R. Attanasio, H. Lee, V. T. Rajan, and
S. Smith. Java without the Coffee Breaks: A Nonintrusive
Multiprocessor Garbage Collector. In SIGPLAN <strong>Conference</strong>
on Programming Language Design and Implementation,
pages 92–103, 2001.
[4] D. F. Bacon and V. T. Rajan. Concurrent cycle collection in
reference counted systems. Lecture Notes in Computer
Science, 2072:207–235, 2001.
[5] S. M. Blackburn, P. Cheng, and K. S. McKinley. Myths and
realities: the performance impact of garbage collection. In
SIGMETRICS 2004/PERFORMANCE 2004: Proceedings of
the joint international conference on Measurement and
modeling of computer systems, pages 25–36, New York, NY,
USA, 2004. ACM Press.
[6] S. M. Blackburn, R. E. Jones, K. S. McKinley, and J. E. . B.
Moss. Beltway: Getting Around Garbage Collection
Gridlock. In Proceedings of the Programming Languages
Design and Implementatio n, 2002.
[7] S. M. Blackburn and K. S. McKinley. Ulterior reference
counting: fast garbage collection without a long wait. In
OOPSLA ’03: Proceedings of the 18th annual ACM
SIGPLAN conference on Object-oriented programing,
systems, languages, and applications, pages 344–358, New
York, NY, USA, 2003. ACM Press.
[8] T. W. Christopher. Reference count garbage collection.
Software Practice and Experience, 14(6):503–507, June,
1984.
[9] A. Gupta and M. Doyle. Turbo-charging Java HotSpot
Virtual Machine, v1.4.x to Improve
the Performance and Scalability of Application Servers.
http://java.sun.com/developer/technicalArticles/Programming/turbo/.
[10] M. Hertz, S. M. Blackburn, J. E. B. Moss, K. S. McKinley,
and D. Stefanovic. Error-free garbage collection traces: how
to cheat and not get caught. In SIGMETRICS ’02:
Proceedings of the 2002 ACM SIGMETRICS international
conference on Measurement and modeling of computer
systems, pages 140–151, New York, NY, USA, 2002. ACM
Press.
[11] M. Hertz, Y. Feng, and E. D. Berger. Garbage collection
without paging. In PLDI ’05: Proceedings of the 2005 ACM
SIGPLAN conference on Programming language design and
implementation, pages 143–153, New York, NY, USA, 2005.
ACM Press.
[12] H. Hibino, K. Kourai, and S. Shiba. Difference of
Degradation Schemes among Operating Systems:
Experimental Analysis for Web Application Servers. In
Workshop on Dependable Software, Tools and Methods,
Yokohama, Japan, July 2005.
[13] JBoss. Jboss Application Server. Product Literature, Last
Retrieved: June 2005. http://www.jboss.org/products/jbossas.
[14] R. Jones and R. Lins. Garbage Collection: Algorithms for
automatic Dynamic Memory Management. John Wiley and
Sons, 1998.
[15] J. L. McCarthy. Recursive Functions of Symbolic
Expressions and Their Computation by Machine.
Communications of the ACM, 3(4):184–195, 1960.
[16] D. Sholler. .NET seen gaining steam in dev projects. In ZD
Net, http://techupdate.zdnet.com, April 2002.
[17] W. Srisa-an, C. Lo, and J. Chang. Do generational schemes
improve the garbage collection efficiency. In <strong>International</strong>
Symposium on Performance Analysis of Systems and
Software (ISPASS 2000, pages 58–63, Austin, TX, April
24-25, 2000.
[18] W. Srisa-an, M. Oey, and S. Elbaum. Garbage collection in
the presence of remote objects: An empirical study. In
<strong>International</strong> Symposium on Distributed Objects and
Applications, Agia Napa, Cyprus, 2005.
[19] Standard Performance Evaluation Corporation.
SPECjAppServer2004 User’s Guide. On-Line User’s Guide,
2004.
http://www.spec.org/osg/jAppServer2004/docs/UserGuide.html.
[20] D. Stutz, T. Neward, and G. Shilling. Shared Source CLI
Essentials. O’Reilly and Associates, 2003.
[21] D. Ungar. Generational scavenging: A non-disruptive high
performance storage reclamation algorithm. In ACM
SIGSOFT/SIGPLAN Software Engineering Symposium on
Practical Software Development Environments, pages
157–167, April 1984.
[22] J. Weizenbaum. Symmetric List Processor. Communications
of the ACM, 6(9):524–544, 1963.
[23] M. Welsh, D. E. Culler, and E. A. Brewer. SEDA: An
architecture for well-conditioned, scalable internet services.
In Symposium on Operating Systems Principles, pages
230–243, 2001.
[24] P. R. Wilson. Uniprocessor garbage collection techniques. In
Proceedings of the <strong>International</strong> Workshop on Memory
Management, 1992.
[25] T. Yang, M. Hertz, E. D. Berger, S. F. Kaplan, and J. E. B.
Moss. Automatic Heap Sizing: Taking Real Memory into
Account. In Proceedings of the <strong>International</strong> Symposium on
Memory Management, 2004.
[26] C. Zhang, K. Kelsey, X. Shen, C. Ding, M. Hertz, and
M. Ogihara. Program-level adaptive memory management.
In <strong>International</strong> Symposium on Memory Management,
Ottawa, Canada, June 2006.
[27] L. Zhang and C. Krintz. Adaptive code unloading for
resource-constrained JVMs. In Proceedings of the 2004 ACM
SIGPLAN/SIGBED conference on Languages, compilers,
and tools, pages 155–164, Washington, DC, USA, 2004.
49