Energy-Efficient Workload Placement with Bounded Slowdown in Disaggregated Datacenters

Simple item page
dc.contributor.advisorGhaderi, Majid
dc.contributor.authorSefati, Amirhossein
dc.contributor.committeememberKrishnamurthy, Diwakar
dc.contributor.committeememberBoyd, Jeffrey
dc.contributor.committeememberGhaderi, Majid
dc.date.accessioned2023-12-11T16:47:42Z
dc.date.available2023-12-11T16:47:42Z
dc.date.issued2023-12-08
dc.description.abstractDisaggregated Data Center (DDC) is a modern datacenter architecture that decouples hardware resources from monolithic servers into pools of resources that can be dynamically composed to match diverse workload requirements. While disaggregation improves resource utilization, it could negatively impact workload slowdown due to the latency of accessing disaggregated resources over the datacenter network. To this end, we consider CPU and memory disaggregation and conduct measurements to experimentally profile several popular datacenter workloads in order to characterize the impact of disaggregation on workload execution slowdown. We then develop a workload placement algorithm, called Iterative Rounding-based Placement ( IRoP), that given a set of workloads, determines where to place each workload (i.e., on which CPU) and how much local and remote memory is allocated to it. The key insight in designing IRoP is that the impact of remote memory latency on slowdown can be substantially masked by assigning workloads to higher-performing CPUs, albeit at the cost of higher power consumption. As such, IRoP aims to find a workload placement that minimizes the DDC power consumption while respecting a bounded slowdown for each workload. We provide extensive simulation results to demonstrate the flexibility of IRoP in providing a wide range of trade-offs between power consumption and workload slowdown. We also compare IRoP with several existing baselines. Our results indicate that IRoP can reduce power consumption and slowdown in the considered scenarios by up to 8% and 12%, respectively.
dc.identifier.citationSefati, A. (2023). Energy-efficient workload placement with bounded slowdown in disaggregated datacenters (Master's thesis, University of Calgary, Calgary, Canada). Retrieved from https://prism.ucalgary.ca.
dc.identifier.urihttps://hdl.handle.net/1880/117679
dc.identifier.urihttps://doi.org/10.11575/PRISM/42522
dc.language.isoen
dc.publisher.facultyScience
dc.publisher.institutionUniversity of Calgary
dc.rightsUniversity of Calgary graduate students retain copyright ownership and moral rights for their thesis. You may use this material in any way that is permitted by the Copyright Act or through licensing that has been assigned to the document. For uses that are not allowable under copyright legislation or licensing, you are required to seek permission.
dc.subjectDisaggregated Datacenter
dc.subjectPower Consumption Optimization
dc.subjectWorkload Profiling
dc.subjectSlowdown of Workloads
dc.subject.classificationEducation--Sciences
dc.subject.classificationComputer Science
dc.subject.classificationEnergy
dc.titleEnergy-Efficient Workload Placement with Bounded Slowdown in Disaggregated Datacenters
dc.typemaster thesis
thesis.degree.disciplineComputer Science
thesis.degree.grantorUniversity of Calgary
thesis.degree.nameMaster of Science (MSc)
ucalgary.thesis.accesssetbystudentI do not require a thesis withhold – my thesis will have open access and can be viewed and downloaded publicly as soon as possible.
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
ucalgary_2023_sefati_amirhossein.pdf
Size:
2.27 MB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
2.62 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Open Theses and Dissertations