DocumentCode
704259
Title
Scale Up vs. Scale Out in Cloud Storage and Graph Processing Systems
Author
Wenting Wang ; Le Xu ; Gupta, Indranil
Author_Institution
Dept. of Comput. Sci., Univ. of Illinois, Champaign, IL, USA
fYear
2015
fDate
9-13 March 2015
Firstpage
428
Lastpage
433
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 (Graph Lab). 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 or adaptive scheduling in heterogeneous clusters containing scale up and scale out nodes.
Keywords
adaptive scheduling; cloud computing; graph theory; storage management; COTS cluster; adaptive scheduling; cloud storage; cloud storage deployer; distributed graph processing systems; distributed key-value store; dollar budget constraints; heterogeneous clusters; iterative processing systems; scale out; scale up; single beefy machine; throughput requirements; Cloud computing; Engines; Google; Random access memory; Servers; Throughput; Twitter; cloud computing; graph processing; key-value store; scale out; scale up;
fLanguage
English
Publisher
ieee
Conference_Titel
Cloud Engineering (IC2E), 2015 IEEE International Conference on
Conference_Location
Tempe, AZ
Type
conf
DOI
10.1109/IC2E.2015.55
Filename
7092956
Link To Document