CloudDP '13最新文献

Component-based scalability for cloud applications 云应用程序基于组件的可伸缩性

CloudDP '13 Pub Date : 2013-04-14 DOI: 10.1145/2460756.2460760

Steffen Kächele, F. Hauck

引用次数: 22

Experiences of using a hybrid cloud to construct an environmental virtual observatory 利用混合云构建环境虚拟观测站的经验

CloudDP '13 Pub Date : 2013-04-14 DOI: 10.1145/2460756.2460759

Yehia El-khatib, G. Blair, Bholanathsingh Surajbali

引用次数: 23

Evaluating Cassandra as a manager of large file sets 评价Cassandra作为大型文件集的管理者

CloudDP '13 Pub Date : 2013-04-14 DOI: 10.1145/2460756.2460761

L. Beernaert, Pedro Gomes, M. Matos, R. Vilaça, R. Oliveira

{"title":"Evaluating Cassandra as a manager of large file sets","authors":"L. Beernaert, Pedro Gomes, M. Matos, R. Vilaça, R. Oliveira","doi":"10.1145/2460756.2460761","DOIUrl":"https://doi.org/10.1145/2460756.2460761","url":null,"abstract":"All companies developing their business on the Web, not only giants like Google or Facebook but also small companies focused on niche markets, face scalability issues in data management. The case study of this paper is the content management systems for classified or commercial advertisements on the Web. The data involved has a very significant growth rate and a read-intensive access pattern with a reduced update rate.\u0000 Typically, data is stored in traditional file systems hosted on dedicated servers or Storage Area Network devices due to the generalization and ease of use of file systems. However, this ease in implementation and usage has a disadvantage: the centralized nature of these systems leads to availability, elasticity and scalability problems.\u0000 The scenario under study, undemanding in terms of the system's consistency and with a simple interaction model, is suitable to a distributed database, such as Cassandra, conceived precisely to dynamically handle large volumes of data.\u0000 In this paper, we analyze the suitability of Cassandra as a substitute for file systems in content management systems. The evaluation, conducted using real data from a production system, shows that when using Cassandra, one can easily get horizontal scalability of storage, redundancy across multiple independent nodes and load distribution imposed by the periodic activities of safeguarding data, while ensuring a comparable performance to that of a file system.","PeriodicalId":205924,"journal":{"name":"CloudDP '13","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129174772","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

Storage and performance optimization of long tail key access in a social network 社交网络中长尾键访问的存储和性能优化

CloudDP '13 Pub Date : 2013-04-14 DOI: 10.1145/2460756.2460757

John Liang, James Luo, Mark Drayton, R. Nishtala, Richard Liu, Nick Hammer, Jason Taylor, Bill Jia

{"title":"Storage and performance optimization of long tail key access in a social network","authors":"John Liang, James Luo, Mark Drayton, R. Nishtala, Richard Liu, Nick Hammer, Jason Taylor, Bill Jia","doi":"10.1145/2460756.2460757","DOIUrl":"https://doi.org/10.1145/2460756.2460757","url":null,"abstract":"In a social network, it is natural to have hot objects such as a celebrity's Facebook page. Duplicating hot object data in each cluster provides quick cache access and avoids stressing a single server's network or CPU resources. But duplicating cold data in each cache cluster consumes significant RAM. A more storage efficient way is to separate hot data from cold data and duplicate only hot data in each cache cluster within a data center. The cold data, or the long tail data, which is accessed much less frequently, has only one copy at a regional cache cluster.\u0000 In this paper, a new sampling technique to capture all accesses to the same sampled keys is created. We then calculate the working set size for each key family for estimating the memory footprint. We introduce an important metric, duplication factor, as the ratio between the sum of each individual cluster's working set size and the regional working set size. We analyze why some key families have a higher duplication factor.\u0000 It is important to separate hot keys and cold keys from the same key family with minimal overhead. We present a novel cache promotion algorithm based on key access probability. We also proposed a probability model based on the binomial distribution to predict the promotion probability with various promotion thresholds.\u0000 Our experiment shows by shrinking the cluster level cache layer and having a fat regional level cache for cold data, we are able to achieve a higher combined cache hit ratio.","PeriodicalId":205924,"journal":{"name":"CloudDP '13","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126765260","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 4

Incremental stream processing using computational conflict-free replicated data types 使用计算无冲突复制数据类型的增量流处理

CloudDP '13 Pub Date : 2013-04-14 DOI: 10.1145/2460756.2460762

David Navalho, S. Duarte, Nuno M. Preguiça, M. Shapiro

引用次数: 11

Transforming reactive auto-scaling into proactive auto-scaling 将被动自动缩放转换为主动自动缩放

CloudDP '13 Pub Date : 2013-04-14 DOI: 10.1145/2460756.2460758

L. Moore, Kathryn Bean, T. Ellahi

引用次数: 54