Dynamic time slice management based on cpupool in virtualized systems가상화된 시스템에서 성능 향상을 위한 cpupool 기반의 동적 타임 슬라이스 관리 기법

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 712
  • Download : 0
DC FieldValueLanguage
dc.contributor.advisorHuh, Jaehyuk-
dc.contributor.advisor허재혁-
dc.contributor.authorHeo, Taekyung-
dc.contributor.author허태경-
dc.date.accessioned2017-03-29T02:40:41Z-
dc.date.available2017-03-29T02:40:41Z-
dc.date.issued2016-
dc.identifier.urihttp://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=649694&flag=dissertationen_US
dc.identifier.urihttp://hdl.handle.net/10203/221907-
dc.description학위논문(석사) - 한국과학기술원 : 전산학부, 2016.2 ,[v, 32 p. :]-
dc.description.abstractIn virtualized systems, virtual time that is experienced by virtual machines (VMs) is physically discontinuous. Even if a VM assumes that it uses physical CPUs exclusively, physical CPUs are shared by other VMs, which results in the virtual time being physically discontinuous. Due to this virtual time discontinuity, lock intensive VMs and I/O intensive VMs are slowed down severely. Although many studies have been conducted to solve these problems, most of them try to solve each phenomenon, not the root cause of the problem, the virtual time discontinuity problem. Recently, Ahn et al. generalized these problems into the virtual time discontinuity problem and suggested an architectural solution. They proposed to shorten the time slice to 1ms to remove the virtual time discontinuity. Additionally, to relieve the negative effects on caches caused by frequent context switches, they proposed to use a context prefetcher and to adopt a context aware cache insertion policy. Although they have solved the virtual time discontinuity problem successfully, they suggested architectural solutions that are not available in current processors. In this paper, we try to solve the virtual time discontinuity problem without additional hardware modification. Using cpupools, which are available in Xen, we try to solve the virtual time discontinuity problem by providing a short time slice cpupool to the VMs that suffer from the virtual time discontinuity problem, while providing a long time slice cpupool to the VMs that benefit more from caches. We decide the characteristic of VMs on-the-fly using decision trees that are constructed from experiments. We constructed the decision trees using many different factors that are closely related to the time slice preference of VMs. We used the pause-loop exiting (PLE) count, the inter-processor interrupt (IPI) count, and the number of packets handled per second. Cpupool is a nice solution for managing time slices in the CPU level. However, using cpupools can cause underutilization of CPUs. Underutilized CPUs cannot be used by the VMs that are located in different cpupools, and this can result in low CPU utilization. To solve this problem, we propose a pseudo-work-conserving mechanism between cpupools. Additionally, we identify and mitigate the cache interference problem that can be caused by solving the virtual time discontinuity problem.-
dc.languageeng-
dc.publisher한국과학기술원-
dc.subjectvirtualization-
dc.subjectvirtual time discontinuity-
dc.subjectconsolidation-
dc.subjectcpupool-
dc.subjectXen-
dc.subjecttime slice-
dc.subjectscheduler-
dc.subject가상화-
dc.subject가상 시간 불연속-
dc.subject-
dc.subject타임 슬라이스-
dc.subject스케쥴링-
dc.titleDynamic time slice management based on cpupool in virtualized systems-
dc.title.alternative가상화된 시스템에서 성능 향상을 위한 cpupool 기반의 동적 타임 슬라이스 관리 기법-
dc.typeThesis(Master)-
dc.identifier.CNRN325007-
dc.description.department한국과학기술원 :전산학부,-
Appears in Collection
CS-Theses_Master(석사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0