2026-09-19T05:51:11Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/464992022-01-13T07:54:29Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Carl Waldspurger and Larry Rudolph.
Stultz, Jacob A
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2009-08-26T16:37:01Z
2009-08-26T16:37:01Z
2008
2008
http://hdl.handle.net/1721.1/46499
402662301
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2008.
Includes bibliographical references (p. 55).
Virtualization systems such as VMware ESX Server use content-based page hashing to help identify duplicate memory pages within virtual machines. Such duplicate pages, once identified, can then be mapped copy-on-write to a single page in physical RAM, thus saving memory in a manner that is transparent to the virtual machine. The page hashes that are collected in this process can be further utilized. This thesis demonstrates how these page hashes can be used to reduce the time required to migrate running virtual machines from one physical machine to another. Normally, this is done by sending the virtual machine state and all memory contents from the source to destination machine. However, since some memory pages may already be present on the destination, it is possible to reduce the number of pages sent (and therefore total migration time and bandwidth used), by sending only a compact hash instead of the full contents for each page likely to be present on the destination machine. This thesis accomplishes this by creating a database of canonical or "standard" pages to determine which pages can be safely sent as only a hash. Tests of the system demonstrate up to 70% reduction in migration time in idealized workloads, 40% reduction in some realistic workloads, and minimal slowdown in some pathological cases.
by Jacob A. Stultz.
M.Eng.
55 p.
eng
Massachusetts Institute of Technology
M.I.T. theses are protected by
copyright. They may be viewed from this source for any purpose, but
reproduction or distribution in any format is prohibited without written
permission. See provided URL for inquiries about permission.
http://dspace.mit.edu/handle/1721.1/7582
Electrical Engineering and Computer Science.
Optimizing live virtual machine migrations using content-based page hashes
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="84fa25b4-8e09-4ee5-94e9-6b118a9af670">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>Optimizing live virtual machine migrations using content-based page hashes</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2008</PublicationDate>
<Authors>
<Author>
<DisplayName>Stultz, Jacob A</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Electrical Engineering and Computer Science.</Keyword>
<Abstract>Virtualization systems such as VMware ESX Server use content-based page hashing to help identify duplicate memory pages within virtual machines. Such duplicate pages, once identified, can then be mapped copy-on-write to a single page in physical RAM, thus saving memory in a manner that is transparent to the virtual machine. The page hashes that are collected in this process can be further utilized. This thesis demonstrates how these page hashes can be used to reduce the time required to migrate running virtual machines from one physical machine to another. Normally, this is done by sending the virtual machine state and all memory contents from the source to destination machine. However, since some memory pages may already be present on the destination, it is possible to reduce the number of pages sent (and therefore total migration time and bandwidth used), by sending only a compact hash instead of the full contents for each page likely to be present on the destination machine. This thesis accomplishes this by creating a database of canonical or "standard" pages to determine which pages can be safely sent as only a hash. Tests of the system demonstrate up to 70% reduction in migration time in idealized workloads, 40% reduction in some realistic workloads, and minimal slowdown in some pathological cases.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>