Evaluating Cassandra Scalability with YCSB

Abramova, Veronika; Bernardino, Jorge; Furtado, Pedro

doi:10.1007/978-3-319-10085-2_18

Cited by 12 publications

(14 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Abramova et al measure the scalability of Cassandra with YCSB, and they use 1, 3, and 6 nodes for the experiments. 16 Androulaki et al present the architecture of Hyperledger Fabric for their experiments they use up to 110 peers. 2 Since Cassandra requires a lot of RAM and the experiments are conducted on the same machine, we were able to run at most 35 nodes (experiment 6).…”

Section: Experiments Overviewmentioning

confidence: 99%

“…Dinh et al present the benchmarking tool Blockbench for permissioned blockchain and they use networks of sizes; 1, 2, 4, 8, 12, 16, 20, 24, 28, and 32 nodes for their experiments . Abramova et al measure the scalability of Cassandra with YCSB, and they use 1, 3, and 6 nodes for the experiments . Androulaki et al present the architecture of Hyperledger Fabric for their experiments they use up to 110 peers .…”

Section: Experiments Designmentioning

confidence: 99%

“…Cloud Serving Benchmark, YCSB, which includes several workloads. This benchmark is often used in research. Kuhlenkamp et al compare Cassandra and Hbase based on YSCB. Abramova et al compare Cassandra and MongoDB by using workloads from YCSB. Abramova et al evaluate the scalability of Cassandra using YCSB. Wada et al evaluate the eventual consistency of 4 different NoSQL databases, including Cassandra…”

Section: Related Workmentioning

confidence: 99%

“…Cooper et al presents YCSB and, in their benchmarking, they used 2, 4, 6, 8, 10, and 12 nodes 14. Dinh et al present the benchmarking toolBlockbench for permissioned blockchain and they use networks of sizes;1,2,4,8,12,16,20, 24, 28, and 32 nodes for their experiments 7. …”

mentioning

confidence: 99%

See 3 more Smart Citations

Permissioned blockchains and distributed databases: A performance study

Bergman

Asplund

Nadjm‐Tehrani

2019

Concurrency and Computation

View full text Add to dashboard Cite

Blockchains are increasingly studied in the context of new applications. Permissioned blockchains promise to deal with the issue of complete removal of trust, a notion that is currently the hallmark of the developed society. Before the idea is adopted in contexts where resource efficiency and fast operation is a requirement, one could legitimately ask the question: can permissioned blockchains match the performance of traditional large-scale databases? This paper compares two popular frameworks, Hyperledger Fabric and Apache Cassandra, as representatives of permissioned blockchains and distributed databases, respectively. We compare their latency for varying workloads and network sizes. The results show that, for small systems, blockchains can start to compete with traditional databases, but also that the difference in consistency models and differences in setup can have a large impact on the resulting performance.

show abstract

Section: Experiments Overviewmentioning

confidence: 99%

Section: Experiments Designmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

mentioning

confidence: 99%

See 2 more Smart Citations

Permissioned blockchains and distributed databases: A performance study

Bergman

Asplund

Nadjm‐Tehrani

2019

Concurrency and Computation

View full text Add to dashboard Cite

show abstract

“…The main contribution of our work is a deep performance evaluation enabling the identification of pros/cons of the strategies implemented by those three systems. Experiment have been done on top of Grid'5000 [8] by considering several data manipulation scenarios leveraging Yahoo Cloud Service Benchmark (YCSB) [9], a well-known benchmark tool particularly designed to benchmark object stores [10], [11].…”

Section: Introductionmentioning

confidence: 99%

Performance Analysis of Object Store Systems in a Fog/Edge Computing Infrastructures

Confais

Lèbre

Parrein

2016

2016 IEEE International Conference on Cloud Computing Technology and Science (CloudCom)

View full text Add to dashboard Cite

Fog/Edge computing infrastructures have been proposed as an alternative of current Cloud Computing facilities to address the latency issue that prevent the development of several applications. The main idea is to deploy smaller data-centers at the edge of the backbone in order to bring cloud computing resources closer to the end-usages. While couple of works illustrated the advantages of such infrastructures in particular for IoT applications, the way of designing elementary services that can take advantage of such massively distributed infrastructures has not been yet discussed. In this paper, we propose to deal with such a question from the storage point of view. First, we propose a list of properties a storage system should meet in this context. Second, we evaluate through performance analysis three "offthe-shelf" object store solutions, namely Rados, Cassandra and InterPlanetary File System (IPFS). In particular, we focused (i) on access times to push and get objects under different scenarios and (ii) on the amount of network traffic that is exchanged between the different sites during such operations. Experiments have been conducted using the Yahoo Cloud System Benchmark (YCSB) on top of the Grid'5000 testbed. We show that among the three tested solutions IPFS fills most of the criteria expected for a Fog/Edge computing infrastructure.

show abstract

Performance Analysis of Object Store Systems in a Fog and Edge Computing Infrastructure

Confais

Lèbre

Parrein

2017

Lecture Notes in Computer Science

View full text Add to dashboard Cite

International audienceFog and Edge computing infrastructures have been proposed as an alternative to the current Cloud Computing facilities to address the latency issue for some applications. The main idea is to deploy smaller data-centers at the edge of the backbone in order to bring Cloud Computing resources closer to the end-usages. While a couple of works illustrated the advantages of such infrastructures in particular for Internet of Things (IoT) applications, the way of designing elementary services that can take advantage of such massively distributed infrastructures has not been yet discussed. In this paper, we propose to deal with such a question from the storage point of view. First, we propose a list of properties a storage system should meet in this context. Second, we evaluate through performance analysis three " off-the-shelf " object store solutions, namely Rados, Cassandra and InterPlanetary File System (IPFS). In particular , we focus (i) on access times to push and get objects under different scenarios and (ii) on the amount of network traffic that is exchanged between the different geographical sites during such operations. We also evaluate how the network latencies influence the access times. Experiments are conducted using the Yahoo Cloud System Benchmark (YCSB) on top of the Grid'5000 testbed. Finally, we show that adding a Scale-Out NAS system on each site improves the access times of IPFS and reduces the amount of traffic between the sites when objects are read locally by reducing the costly DHT access. The simultaneous observation of different Fog sites also constitutes the originality of this work

show abstract

Evaluating Cassandra Scalability with YCSB

Cited by 12 publications

References 12 publications

Permissioned blockchains and distributed databases: A performance study

Permissioned blockchains and distributed databases: A performance study

Performance Analysis of Object Store Systems in a Fog/Edge Computing Infrastructures

Performance Analysis of Object Store Systems in a Fog and Edge Computing Infrastructure

Contact Info

Product

Resources

About