2026-09-19T03:27:06Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/998402022-01-13T07:54:01Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Michael Stonebraker and Frans Kaashoek.
Taft, Rebecca (Rebecca Yale)
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2015-11-09T19:52:22Z
2015-11-09T19:52:22Z
2015
2015
http://hdl.handle.net/1721.1/99840
927409325
Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2015.
Cataloged from PDF version of thesis.
Includes bibliographical references (pages [68]-[70]).
Public cloud providers who support a Database-as-a-Service offering must efficiently allocate computing resources to each of their customers in order to reduce the total number of servers needed without incurring SLA violations. For example, Microsoft serves more than one million database customers on its Azure SQL Database platform. In order to avoid unnecessary expense and stay competitive in the cloud market, Microsoft must pack database tenants onto servers as efficiently as possible. This thesis examines a dataset which contains anonymized customer resource usage statistics from Microsoft's Azure SQL Database service over a three-month period in late 2014. Using this data, this thesis contributes several new algorithms to efficiently pack database tenants onto servers by collocating tenants with compatible usage patterns. An experimental evaluation shows that the placement algorithms, specifically the Scalar Static algorithm and the Dynamic algorithm, are able to pack databases onto half of the machines used in production while incurring fewer SLA violations. The evaluation also shows that with two different cost models these algorithms can save 80% of operational costs compared to the algorithms used in production in late 2014.
by Rebecca Taft.
S.M.
[70] unnumbered pages
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.
Predictive modeling for management of database resources in the cloud
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="2514bd5a-bbdd-41e4-b3c0-e1dca52aef71">
<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>Predictive modeling for management of database resources in the cloud</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2015</PublicationDate>
<Authors>
<Author>
<DisplayName>Taft, Rebecca (Rebecca Yale)</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>Public cloud providers who support a Database-as-a-Service offering must efficiently allocate computing resources to each of their customers in order to reduce the total number of servers needed without incurring SLA violations. For example, Microsoft serves more than one million database customers on its Azure SQL Database platform. In order to avoid unnecessary expense and stay competitive in the cloud market, Microsoft must pack database tenants onto servers as efficiently as possible. This thesis examines a dataset which contains anonymized customer resource usage statistics from Microsoft's Azure SQL Database service over a three-month period in late 2014. Using this data, this thesis contributes several new algorithms to efficiently pack database tenants onto servers by collocating tenants with compatible usage patterns. An experimental evaluation shows that the placement algorithms, specifically the Scalar Static algorithm and the Dynamic algorithm, are able to pack databases onto half of the machines used in production while incurring fewer SLA violations. The evaluation also shows that with two different cost models these algorithms can save 80% of operational costs compared to the algorithms used in production in late 2014.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>