|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| Woo Jin Kim, Kyungbaek Kim, Jaesun Han, Keuntae Park, Daeyeon Park, "Thread-Aware Garbage Collection for Server Applications," 2012 IEEE/IPSJ 12th International Symposium on Applications and the Internet, pp. 81, 2004 Symposium on Applications and the Internet (SAINT'04), 2004. | |||
| BibTex | x | ||
| @article{ 10.1109/SAINT.2004.1266102, author = {Woo Jin Kim and Kyungbaek Kim and Jaesun Han and Keuntae Park and Daeyeon Park}, title = {Thread-Aware Garbage Collection for Server Applications}, journal ={2012 IEEE/IPSJ 12th International Symposium on Applications and the Internet}, volume = {0}, year = {2004}, isbn = {0-7695-2068-5}, pages = {81}, doi = {http://doi.ieeecomputersociety.org/10.1109/SAINT.2004.1266102}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - 2012 IEEE/IPSJ 12th International Symposium on Applications and the Internet TI - Thread-Aware Garbage Collection for Server Applications SN - 0-7695-2068-5 SP EP A1 - Woo Jin Kim, A1 - Kyungbaek Kim, A1 - Jaesun Han, A1 - Keuntae Park, A1 - Daeyeon Park, PY - 2004 KW - null VL - 0 JA - 2012 IEEE/IPSJ 12th International Symposium on Applications and the Internet ER - | |||
In recent years server applications using Java become popular. However, they have different performance requirements from other applications: high throughput and small response time. One of obstacles for achieving those requirements is a Java Virtual Machine (JVM). Among the services that a JVM provides, garbage collection affects server applications in throughput and latency. Some JVMs have various garbage collectors for server-side Java but they do not still consider the behavior of server applications.
We show that the lifetime pattern of objects is distinguished by the thread that allocates them in server applications. Separating objects and applying different collection policies according to threads, we propose that a garbage collector can achieve both high throughput and small pause time. Experiments show that the throughput of our collector is up to 1.7 times greater than that of previous generational collectors with the same pause time and the pause time of minor collection is smaller by almost 10% given the same throughput.