Virtualization technologies in cloud computing are ubiquitous throughout data centers around the world where providers consider operational costs and fast delivery guarantees for a variety of profitable services. These providers should consistently invoke measures for increasing the efficiencies of their virtualized services in a competitive environment where fast entry to market, technology advancement, and service price differentials separate sustaining providers from antiquated ones. Therefore, providers seeking further efficiencies and profit opportunities should consider how their resources are managed in virtual computing environments which leverage memory reclamation techniques, specifically page-sharing; motivating the design of new memory sharing-aware resource management algorithms. In this dissertation, we design families of offline and online sharing-aware algorithms for resource management in virtual computing environments and investigate their properties and relationships to various sharing models. Our contribution consists of the design of new online and approximation algorithms offering relevant performance guarantees and their applications to next-generation virtualization technologies.
","abstract_html":"<p>Virtualization technologies in cloud computing are ubiquitous throughout data centers around the world where providers consider operational costs and fast delivery guarantees for a variety of profitable services. These providers should consistently invoke measures for increasing the efficiencies of their virtualized services in a competitive environment where fast entry to market, technology advancement, and service price differentials separate sustaining providers from antiquated ones. Therefore, providers seeking further efficiencies and profit opportunities should consider how their resources are managed in virtual computing environments which leverage memory reclamation techniques, specifically page-sharing; motivating the design of new memory sharing-aware resource management algorithms. In this dissertation, we design families of offline and online sharing-aware algorithms for resource management in virtual computing environments and investigate their properties and relationships to various sharing models. Our contribution consists of the design of new online and approximation algorithms offering relevant performance guarantees and their applications to next-generation virtualization technologies.</p>","abstract_has_math":false,"creators":["Rampersaud, Safraz"],"institution":null,"degree_name":"Ph.D.","degree_level":"Open Access Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Daniel Grosu"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2016,"date_issued":"2016-01-01T08:00:00Z","date_published":"2016-01-01T08:00:00Z","updated_at":"2026-07-24T06:00:26Z","subjects":["approximation algorithms","multilinear programming","sharing-aware","vector bin-packing","vector knapsack","virtualization","Computer Sciences"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://digitalcommons.wayne.edu/oa_dissertations/1477","outbound_label":"Repository record","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Daniel Grosu"]},{"key":"dc:creator","label":"Author","values":["Rampersaud, Safraz"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2016-01-01T08:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Open Access Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["approximation algorithms","multilinear programming","sharing-aware","vector bin-packing","vector knapsack","virtualization","Computer Sciences"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.wayne.edu/oa_dissertations/1477"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Virtualization technologies in cloud computing are ubiquitous throughout data centers around the world where providers consider operational costs and fast delivery guarantees for a variety of profitable services. These providers should consistently invoke measures for increasing the efficiencies of their virtualized services in a competitive environment where fast entry to market, technology advancement, and service price differentials separate sustaining providers from antiquated ones. Therefore, providers seeking further efficiencies and profit opportunities should consider how their resources are managed in virtual computing environments which leverage memory reclamation techniques, specifically page-sharing; motivating the design of new memory sharing-aware resource management algorithms. In this dissertation, we design families of offline and online sharing-aware algorithms for resource management in virtual computing environments and investigate their properties and relationships to various sharing models. Our contribution consists of the design of new online and approximation algorithms offering relevant performance guarantees and their applications to next-generation virtualization technologies.
"]},{"key":"dc:title","label":"Title","values":["Sharing-Aware Resource Management Algorithms For Virtual Computing Environments"]}]}],"canonical_facts":{"dc:contributor":["Daniel Grosu"],"dc:creator":["Rampersaud, Safraz"],"dc:date.available":["2016-01-01T08:00:00Z"],"dc:description.abstract":["Virtualization technologies in cloud computing are ubiquitous throughout data centers around the world where providers consider operational costs and fast delivery guarantees for a variety of profitable services. These providers should consistently invoke measures for increasing the efficiencies of their virtualized services in a competitive environment where fast entry to market, technology advancement, and service price differentials separate sustaining providers from antiquated ones. Therefore, providers seeking further efficiencies and profit opportunities should consider how their resources are managed in virtual computing environments which leverage memory reclamation techniques, specifically page-sharing; motivating the design of new memory sharing-aware resource management algorithms. In this dissertation, we design families of offline and online sharing-aware algorithms for resource management in virtual computing environments and investigate their properties and relationships to various sharing models. Our contribution consists of the design of new online and approximation algorithms offering relevant performance guarantees and their applications to next-generation virtualization technologies.
"],"dc:identifier":["https://digitalcommons.wayne.edu/oa_dissertations/1477"],"dc:subject":["approximation algorithms","multilinear programming","sharing-aware","vector bin-packing","vector knapsack","virtualization","Computer Sciences"],"dc:title":["Sharing-Aware Resource Management Algorithms For Virtual Computing Environments"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Open Access Dissertation"],"thesis:degree_name":["Ph.D."]},"updated_at":"2026-07-24T06:00:26Z"}