Ursa: Scalable load and power management in cloud storage systems

Gae Won You, Seung Won Hwang, Navendu Jain

Research output: Contribution to journalArticle

10 Citations (Scopus)

Abstract

Enterprise and cloud data centers are comprised of tens of thousands of servers providing petabytes of storage to a large number of users and applications. At such a scale, these storage systems face two key challenges: (1) hot-spots due to the dynamic popularity of stored objects; and (2) high operational costs due to power and cooling. Existing storage solutions, however, are unsuitable to address these challenges because of the large number of servers and data objects. This article describes the design, implementation, and evaluation of Ursa, a system that scales to a large number of storage nodes and objects, and aims to minimize latency and bandwidth costs during system reconfiguration. Toward this goal, Ursa formulates an optimization problem that selects a subset of objects from hot-spot servers and performs topology-aware migration to minimize reconfiguration costs. As exact optimization is computationally expensive, we devise scalable approximation techniques for node selection and efficient divide-and-conquer computation. We also show that the same dynamic reconfiguration techniques can be leveraged to reduce power costs by dynamically migrating data off under-utilized nodes, and powering up servers neighboring existing hot-spots to reduce reconfiguration costs. Our evaluation shows that Ursa achieves cost-effective load management, is time-responsive in computing placement decisions (e.g., about two minutes for 10K nodes and 10M objects), and provides power savings of 15%-37%.

Original languageEnglish
Article number1
JournalACM Transactions on Storage
Volume9
Issue number1
DOIs
Publication statusPublished - 2013 Mar 1

Fingerprint

Servers
Costs
Set theory
Power management
Topology
Cooling
Bandwidth
Industry

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture

Cite this

@article{ece7f454a075437d9c6c562a05b81c41,
title = "Ursa: Scalable load and power management in cloud storage systems",
abstract = "Enterprise and cloud data centers are comprised of tens of thousands of servers providing petabytes of storage to a large number of users and applications. At such a scale, these storage systems face two key challenges: (1) hot-spots due to the dynamic popularity of stored objects; and (2) high operational costs due to power and cooling. Existing storage solutions, however, are unsuitable to address these challenges because of the large number of servers and data objects. This article describes the design, implementation, and evaluation of Ursa, a system that scales to a large number of storage nodes and objects, and aims to minimize latency and bandwidth costs during system reconfiguration. Toward this goal, Ursa formulates an optimization problem that selects a subset of objects from hot-spot servers and performs topology-aware migration to minimize reconfiguration costs. As exact optimization is computationally expensive, we devise scalable approximation techniques for node selection and efficient divide-and-conquer computation. We also show that the same dynamic reconfiguration techniques can be leveraged to reduce power costs by dynamically migrating data off under-utilized nodes, and powering up servers neighboring existing hot-spots to reduce reconfiguration costs. Our evaluation shows that Ursa achieves cost-effective load management, is time-responsive in computing placement decisions (e.g., about two minutes for 10K nodes and 10M objects), and provides power savings of 15{\%}-37{\%}.",
author = "You, {Gae Won} and Hwang, {Seung Won} and Navendu Jain",
year = "2013",
month = "3",
day = "1",
doi = "10.1145/2435204.2435205",
language = "English",
volume = "9",
journal = "ACM Transactions on Storage",
issn = "1553-3077",
publisher = "Association for Computing Machinery (ACM)",
number = "1",

}

Ursa : Scalable load and power management in cloud storage systems. / You, Gae Won; Hwang, Seung Won; Jain, Navendu.

In: ACM Transactions on Storage, Vol. 9, No. 1, 1, 01.03.2013.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Ursa

T2 - Scalable load and power management in cloud storage systems

AU - You, Gae Won

AU - Hwang, Seung Won

AU - Jain, Navendu

PY - 2013/3/1

Y1 - 2013/3/1

N2 - Enterprise and cloud data centers are comprised of tens of thousands of servers providing petabytes of storage to a large number of users and applications. At such a scale, these storage systems face two key challenges: (1) hot-spots due to the dynamic popularity of stored objects; and (2) high operational costs due to power and cooling. Existing storage solutions, however, are unsuitable to address these challenges because of the large number of servers and data objects. This article describes the design, implementation, and evaluation of Ursa, a system that scales to a large number of storage nodes and objects, and aims to minimize latency and bandwidth costs during system reconfiguration. Toward this goal, Ursa formulates an optimization problem that selects a subset of objects from hot-spot servers and performs topology-aware migration to minimize reconfiguration costs. As exact optimization is computationally expensive, we devise scalable approximation techniques for node selection and efficient divide-and-conquer computation. We also show that the same dynamic reconfiguration techniques can be leveraged to reduce power costs by dynamically migrating data off under-utilized nodes, and powering up servers neighboring existing hot-spots to reduce reconfiguration costs. Our evaluation shows that Ursa achieves cost-effective load management, is time-responsive in computing placement decisions (e.g., about two minutes for 10K nodes and 10M objects), and provides power savings of 15%-37%.

AB - Enterprise and cloud data centers are comprised of tens of thousands of servers providing petabytes of storage to a large number of users and applications. At such a scale, these storage systems face two key challenges: (1) hot-spots due to the dynamic popularity of stored objects; and (2) high operational costs due to power and cooling. Existing storage solutions, however, are unsuitable to address these challenges because of the large number of servers and data objects. This article describes the design, implementation, and evaluation of Ursa, a system that scales to a large number of storage nodes and objects, and aims to minimize latency and bandwidth costs during system reconfiguration. Toward this goal, Ursa formulates an optimization problem that selects a subset of objects from hot-spot servers and performs topology-aware migration to minimize reconfiguration costs. As exact optimization is computationally expensive, we devise scalable approximation techniques for node selection and efficient divide-and-conquer computation. We also show that the same dynamic reconfiguration techniques can be leveraged to reduce power costs by dynamically migrating data off under-utilized nodes, and powering up servers neighboring existing hot-spots to reduce reconfiguration costs. Our evaluation shows that Ursa achieves cost-effective load management, is time-responsive in computing placement decisions (e.g., about two minutes for 10K nodes and 10M objects), and provides power savings of 15%-37%.

UR - http://www.scopus.com/inward/record.url?scp=84875713901&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84875713901&partnerID=8YFLogxK

U2 - 10.1145/2435204.2435205

DO - 10.1145/2435204.2435205

M3 - Article

AN - SCOPUS:84875713901

VL - 9

JO - ACM Transactions on Storage

JF - ACM Transactions on Storage

SN - 1553-3077

IS - 1

M1 - 1

ER -