ACM Home Page
Please provide us with feedback. Feedback
Allocation-phase aware thread scheduling policies to improve garbage collection performance
Full text PdfPdf (805 KB)
Source
International Symposium on Memory Management archive
Proceedings of the 6th international symposium on Memory management table of contents
Montreal, Quebec, Canada
SESSION: Object lifetimes table of contents
Pages: 79 - 90  
Year of Publication: 2007
ISBN:978-1-59593-893-0
Authors
Feng Xian  University of Nebraska-Lincoln, Lincoln, NE
Witawas Srisa-an  University of Nebraska-Lincoln, Lincoln, NE
Hong Jiang  University of Nebraska-Lincoln, Lincoln, NE
Sponsors
ACM: Association for Computing Machinery
SIGPLAN: ACM Special Interest Group on Programming Languages
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 55,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1296907.1296919
What is a DOI?

ABSTRACT

Past studies have shown that objects are created and then die in phases. Thus, one way to sustain good garbage collection efficiency is to have a large enough heap to allow many allocation phases to complete and most of the objects to die before invoking garbage collection. However, such an operating environment is hard to maintain in large multithreaded applications because most typical time-sharing schedulers are not allocation-phase cognizant; i.e., they often schedule threads in a way that prevents them from completing their allocation phases quickly. Thus, when garbage collection is invoked, most allocation phases have yet to be completed, resulting in poor collection efficiency. We introduce two new scheduling strategies, LARF (lower allocation rate first) and MQRR (memory-quantum round robin) designed to be allocation-phase aware by assigning higher execution priority to threads in computation-oriented phases. The simulation results show thatallthe reductions of the garbage collection time in a generational collector can range from 0%-27% when compare to a round robin scheduler. The reductions of the overall execution time and the average thread turnaround time range from -0.1%-3% and -0.1%-13%, respectively.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
J. Aas. Understanding the Linux 2.6.8.1 Scheduler. On--line article, 2006. http://josh.trancesoftware.com/linux/linux cpu scheduler.pdf.
2
3
4
5
6
7
 
8
9
10
11
 
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. http://www.csg.is.titech.ac.jp/paper/hibinodsn2005.pdf.
13
 
14
JBoss. Jboss Application Server. Product Literature, Last Retrieved: June 2007. http://www.jboss.org/products/jbossas.
 
15
 
16
Lime Wire, LLC. Lime Wire. Web Document, 2007. http://www.limewire.org.
 
17
Microsoft. About the Common Language Runtime (CLR). http://www.gotdotnet.com/team/clr/about clr.aspx.
18
19
 
20
21
 
22
Standard Performance Evaluation Corporation. SPECjbb2000, 2000. http://www.spec.org/osg/jbb2000/docs/whitepaper.html.
 
23
Standard Performance Evaluation Corporation. SPECjAppServer2004 User's Guide. On--Line User's Guide, 2004. http://www.spec.org/osg/jAppServer2004/docs/UserGuide.html.
24
 
25
Sun Microsystems. ECPERF. http://java.sun.com/developer/earlyAccess/j2ee/ecperf/download.html.
 
26
Sun Microsystems. Performance Documentation for the Java HotSpot VM. On--Line Documentation, Last Retrieved: June 2007. http://java.sun.com/docs/hotspot/.
27
28
 
29
30
 
31
F. Xian, W. Srisa--an, C. Jia, and H. Jiang. AS--GC: An Efficient Generational Garbage Collector for Java Application Servers. In Proceedings of the 21st European Conference on Object--Oriented Programming (ECOOP), pages 126--150, Berlin, Germany, July 2007.
32
 
33


Collaborative Colleagues:
Feng Xian: colleagues
Witawas Srisa-an: colleagues
Hong Jiang: colleagues