DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Park, Dae-Yeon | - |
dc.contributor.advisor | 박대연 | - |
dc.contributor.author | Koh, Pil-Sung | - |
dc.contributor.author | 고필성 | - |
dc.date.accessioned | 2011-12-14T01:52:36Z | - |
dc.date.available | 2011-12-14T01:52:36Z | - |
dc.date.issued | 2004 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=238398&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/37721 | - |
dc.description | 학위논문(석사) - 한국과학기술원 : 전기및전자공학전공, 2004.2, [ iv, 26 p. ] | - |
dc.description.abstract | In recent years Java™ Virtual Machine (JVM) is widely used for server applications, such as web services and web application servers (WASes). Server workloads like these have different characteristics from other workloads. They are large applications that need large number of threads, processors, sockets, and a large amount of memory. They are interactive in that they should respond to the requests of clients in short time. And they are long running and the working sets increase as time goes on. To improve the performance of server workloads, a new design of the garbage collection (GC) component of JVM that meets the characteristics of them is required. At first, generational garbage collection algorithm can increase the throughput of garbage collection. And to reduce the working set of server workloads and the memory fragmentation of long running servers, compacting garbage collection algorithm is necessary. But compaction needs copying of a lot of objects and occurs while program activity is stopped. So it is a major contributor to garbage collection pause times. We present a low pause incremental compaction algorithm in a generational garbage collection. It increases the throughput of garbage collection and reduces pause times by compacting a part of the heap occasionally when young generation garbage collection occurs. Experiments show that our algorithm reduces maximum garbage collection pause time stably up to 38%. And the increase of total run time is minimal compared to previous algorithm. | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.subject | GENERATIONAL GARBAGE COLLECTION | - |
dc.subject | JAVA VIRTUAL MACHINE | - |
dc.subject | LOW PAUSE INCREMENTAL COMPACTION | - |
dc.subject | 정지 시간을 줄이는 부분 컴팩션 | - |
dc.subject | 세대를 구별하는 가비지 컬렉션 | - |
dc.subject | 자바 가상 머신 | - |
dc.title | Low pause incremental compaction in a generational garbage collection | - |
dc.title.alternative | 세대를 구별하는 가비지 컬렉션에서 정지 시간을 줄이는 부분 컴팩션 연구 | - |
dc.type | Thesis(Master) | - |
dc.identifier.CNRN | 238398/325007 | - |
dc.description.department | 한국과학기술원 : 전기및전자공학전공, | - |
dc.identifier.uid | 020023017 | - |
dc.contributor.localauthor | Park, Dae-Yeon | - |
dc.contributor.localauthor | 박대연 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.