Scale up vs. scale out in cloud storage and graph processing systems

Wenting Wang, Le Xu, Indranil Gupta

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Deployers of cloud storage and iterative processing systems typically have to deal with either dollar budget constraints or throughput requirements. This paper examines the question of whether such cloud storage and iterative processing systems are more cost-efficient when scheduled on a COTS (scale out) cluster or a single beefy (scale up) machine. We experimentally evaluate two systems: 1) a distributed key-value store (Cassandra), and 2) a distributed graph processing system (GraphLab). Our studies reveal scenarios where each option is preferable over the other. We provide recommendations for deployers of such systems to decide between scale up vs. scale out, as a function of their dollar or throughput constraints. Our results indicate that there is a need for adaptive scheduling in heterogeneous clusters containing scale up and scale out nodes.

Original languageEnglish (US)
Title of host publicationProceedings - 2015 IEEE International Conference on Cloud Engineering, IC2E 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages428-433
Number of pages6
ISBN (Electronic)9781479982189
DOIs
StatePublished - 2015
Event2015 IEEE International Conference on Cloud Engineering, IC2E 2015 - Tempe, United States
Duration: Mar 9 2015Mar 12 2015

Publication series

NameProceedings - 2015 IEEE International Conference on Cloud Engineering, IC2E 2015

Other

Other2015 IEEE International Conference on Cloud Engineering, IC2E 2015
Country/TerritoryUnited States
CityTempe
Period3/9/153/12/15

ASJC Scopus subject areas

  • Software
  • Control and Systems Engineering
  • Computer Networks and Communications
  • Hardware and Architecture

Fingerprint

Dive into the research topics of 'Scale up vs. scale out in cloud storage and graph processing systems'. Together they form a unique fingerprint.

Cite this