{"title":"Towards the Automated Engineering of Dependable Adaptive Services","authors":"T. Baker, M. Randles, A. Taleb-Bendiab","doi":"10.1109/CCGrid.2012.79","DOIUrl":"https://doi.org/10.1109/CCGrid.2012.79","url":null,"abstract":"The dependability of runtime composition of Cloud-Based Services is affected by many issues including scalability and reliability, which are commonly proposed to be solved by the use of adaptive software solutions. Usually, however, the use of various software paradigms to achieve such adaptability requires that the design of the formal operational model to be implicitly linked with the end implementation. Such rigid reliance upon a static model thereby constrains the adaptability and flexibility of the composition. This paper contends that in order for adaptable Cloud-Based Services to be produced, a formal model should be specified and enacted independently from the runtime implementation. The paper shows by use of situation calculus and software representation techniques for service composition, such as an Intention Description Language, how these issues can be addressed for assured runtime adaptable, deliberative systems. In conclusion, by use of a representative example and a case study, the methodology proposed is evaluated to highlight the advantages discussed, and to identify problems still to be resolved.","PeriodicalId":346038,"journal":{"name":"2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)","volume":"14 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120988787","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}
{"title":"Separating Performance Anomalies from Workload-Explained Failures in Streaming Servers","authors":"C. Cunha, L. Silva","doi":"10.1109/CCGrid.2012.58","DOIUrl":"https://doi.org/10.1109/CCGrid.2012.58","url":null,"abstract":"Video-streaming services are dominating the Internet, delivering content for video-on-demand, TV, education and collaborative work. Service parameters addressing quality and continuity of video content have a special importance due to the human sensitiveness to variations on video quality and decades of quality patterns absorbed by traditional TV users. Thus, the performance analysis and repair lifecycle at server and network levels is mandatory to avoid degradation of user experience. At the network level, there are several effective techniques based on temporal and spatial data redundancy, though they deeply depend on healthy servers with enough resources to afford both the client and recovery workloads. Excess of streaming workloads and performance anomalies (i.e., server resources exhaustion not explained by client requests) are typical causes of server performance failures. The former is often caused by memory caching of popular videos, which impacts the number of requests accepted by the server and consequently blurs load admittance mechanisms when the workload changes. The latter is caused by server internal factors independent of client workloads (e.g., memory leaks and maintenance activities). Separating client workload related failures from performance anomalies is mandatory for selection of immediate repair actions, capacity planning and to support fault repair. We evaluated the performance of Naive Bayes and C4.5 Trees algorithms for classification of these failure states using client and server performance metrics. Results shown that it is possible to predict the type of failure with levels of recall and accuracy higher than 90% for workload types with different popularity levels.","PeriodicalId":346038,"journal":{"name":"2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121021224","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}
Qingjia Huang, Sen Su, Jian Li, Peng Xu, Kai Shuang, Xiaohui Huang
{"title":"Enhanced Energy-Efficient Scheduling for Parallel Applications in Cloud","authors":"Qingjia Huang, Sen Su, Jian Li, Peng Xu, Kai Shuang, Xiaohui Huang","doi":"10.1109/CCGrid.2012.49","DOIUrl":"https://doi.org/10.1109/CCGrid.2012.49","url":null,"abstract":"Energy consumption has become a major concern to the widespread deployment of cloud data centers. The growing importance for parallel applications in the cloud introduces significant challenges in reducing the power consumption drawn by the hosted servers. In this paper, we propose an enhanced energy-efficient scheduling (EES) algorithm to reduce energy consumption while meeting the performance-based service level agreement (SLA). Since slacking non-critical jobs can achieve significant power saving, we exploit the slack room and allocate them in a global manner in our schedule. Using random generated and real-life application workflows, our results demonstrate that EES is able to reduce considerable energy consumption while still meeting SLA.","PeriodicalId":346038,"journal":{"name":"2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)","volume":"31 17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124922058","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}
Khalid Mansour, R. Kowalczyk, Mohan Baruwal Chhetri
{"title":"On Effective Quality of Service Negotiation","authors":"Khalid Mansour, R. Kowalczyk, Mohan Baruwal Chhetri","doi":"10.1109/CCGrid.2012.75","DOIUrl":"https://doi.org/10.1109/CCGrid.2012.75","url":null,"abstract":"This paper addresses the problem of flexible procuring of multiple services with multiple non-functional characteristics, i.e., quality of service attributes. We investigate the one-to-many negotiation approach as a flexible method for procuring multiple services by a buyer agent. We address the problem of coordinating multiple concurrent negotiations and propose a novel dynamic negotiation strategy that considers the behaviors of the opponents in managing the local reservation values for the common negotiation issues. Most previous works consider the problem of negotiation over a single issue. We investigate a more complex scenario where a buyer agent negotiates with multiple seller agents over multiple services characterized by multiple issues. The initial experimental results show the effectiveness of our dynamic negotiation strategy when compared to a static strategy.","PeriodicalId":346038,"journal":{"name":"2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)","volume":"285 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122100922","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}
{"title":"Distributed Shared Memory Programming in the Cloud","authors":"Ahmad Anbar, Vikram K. Narayana, T. El-Ghazawi","doi":"10.1109/CCGrid.2012.48","DOIUrl":"https://doi.org/10.1109/CCGrid.2012.48","url":null,"abstract":"Cloud computing is beginning to play a dominant role in scientific computing. However, there are still several challenges that need to be addressed, before data-intensive scientific applications make the transition to the cloud. Adoption of a distributed shared memory (DSM) programming paradigm will be one approach to ease the transition, through the use of Partitioned Global Address Space (PGAS) languages. This paper explores initial results from the adoption of a PGAS language, Unified Parallel C, in programming a representative private cloud based on Eucalyptus.","PeriodicalId":346038,"journal":{"name":"2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129505091","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}
{"title":"Analyzing Effect of Network Processor's Cache Dependent Parameter on MPI Broadcast Performance","authors":"Kedar Kulkarni, G. Gadre","doi":"10.1109/CCGrid.2012.97","DOIUrl":"https://doi.org/10.1109/CCGrid.2012.97","url":null,"abstract":"For cluster based parallel computing, optimization at every layer of Network Protocol to improve the performance is an ongoing process. Use of dedicated Network Processor has become good choice to cope up with continuous and rapid growth of network link speed. GPP or RISC can be used for packet processing, because of their higher processing speed and flexibility. To improve overall performance, it is necessary to program Network Processor by making efficient use of its resources. In our experiment, we have formed Hot Connection pool that is heavily dependent on Network Processor cache. Our experimental result shows performance improvement when pool value is chosen proportionate to cache size of Network Processor.","PeriodicalId":346038,"journal":{"name":"2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128400556","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}
{"title":"Towards Trusted Services: Result Verification Schemes for MapReduce","authors":"Chu Huang, Sencun Zhu, Dinghao Wu","doi":"10.1109/CCGrid.2012.77","DOIUrl":"https://doi.org/10.1109/CCGrid.2012.77","url":null,"abstract":"Recent development in Internet-scale data applications and services, combined with the proliferation of cloud computing, has created a new computing model for data intensive computing best characterized by the MapReduce paradigm. The MapReduce computing paradigm, pioneered by Google in its Internet search application, is an architectural and programming model for efficiently processing massive amount of raw unstructured data. With the availability of the open source Hadoop tools, applications built based on the MapReduce computing model are rapidly growing. In this work, we focus on a unique security concern on the MapReduce architecture. Given the potential security risks from lazy or malicious servers involved in a MapReduce task, we design efficient and innovative mechanisms for detecting cheating services under the MapReduce environment based on watermark injection and random sampling methods. The new detection schemes are expected to significantly reduce the cost of verification overhead. Finally, extensive analytical and experimental evaluation confirms the effectiveness of our schemes in MapReduce result verification.","PeriodicalId":346038,"journal":{"name":"2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)","volume":"163 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124576224","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}
{"title":"RO-BURST: A Robust Virtualization Cost Model for Workload Consolidation over Clouds","authors":"Jianzong Wang, Rui Hua, Yifeng Zhu, Ji-guang Wan, C. Xie, Yanjun Chen","doi":"10.1109/CCGrid.2012.87","DOIUrl":"https://doi.org/10.1109/CCGrid.2012.87","url":null,"abstract":"As more public cloud computing platforms are emerging in the market, a great challenge for these Infrastructure as a Server (IaaS) providers is how to measure the cost and charge the Software as a Service (SaaS) clients for the cloud computing services. This problem is compounded as virtualization technology is deployed in many cloud platforms to consolidate servers and improve their utilization. This paper studies three different but related models for apportioning costs in a private or public cloud environment supported by virtualized data centers. With given workload placement scenarios and randomly selected workloads, these models estimate the cost for each workload. Through simulations and thorough comparisons of the results, we finally champion the RO-BURST model tailored for the service providers' need, that is characterized by robustness and burstiness. What is more, we import Cost Volatility Factors to ensure that our model is able to adjust itself to the market and multiform demands in power and hardware components, such as disks and CPU, showing its compatibility and extensibility. We also come up with a pricing strategy with respect to servers the workload employs, which generates an applicable and less placement-sensitive fee for the clients.","PeriodicalId":346038,"journal":{"name":"2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126984888","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}
{"title":"Cloud Service Negotiation: Concession vs. Tradeoff Approaches","authors":"Xianrong Zheng, Patrick Martin, Kathryn Brohman","doi":"10.1109/CCGrid.2012.94","DOIUrl":"https://doi.org/10.1109/CCGrid.2012.94","url":null,"abstract":"For Cloud services, their non-functional properties like availability, reliability and security are important differentiators. However, service consumers and service providers may conflict over non-functional properties. In fact, the conflicts can be resolved via automated negotiation, which is considered as the most flexible approach to procure products and services. In this paper, we propose tradeoff approaches for Cloud service negotiation, and compare them with concession ones. As opposed to concession ones, tradeoff approaches do not reduce one's utility, but still can create a proposal attractive to its opponent. Indeed, simulation results show that tradeoff approaches outperform concession ones in terms of both individual utility and social benefit. However, simulation results also demonstrate that tradeoff approaches under perform concession ones in terms of success rate.","PeriodicalId":346038,"journal":{"name":"2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123352561","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}
Zhonghong Ou, B. Pang, Yang Deng, J. Nurminen, Antti Ylä-Jääski, P. Hui
{"title":"Energy- and Cost-Efficiency Analysis of ARM-Based Clusters","authors":"Zhonghong Ou, B. Pang, Yang Deng, J. Nurminen, Antti Ylä-Jääski, P. Hui","doi":"10.1109/CCGrid.2012.84","DOIUrl":"https://doi.org/10.1109/CCGrid.2012.84","url":null,"abstract":"General-purpose computing domain has experienced strategy transfer from scale-up to scale-out in the past decade. In this paper, we take a step further to analyze ARM-processor based cluster against Intel X86 workstation, from both energy-efficiency and cost-efficiency perspectives. Three applications are selected and evaluated to represent diversified applications, including Web server throughput, in-memory database, and video transcoding. Through detailed measurements, we make the observations that the energy-efficiency ratio of the ARM cluster against the Intel workstation varies from 2.6-9.5 in in-memory database, to approximately 1.3 in Web server application, and 1.21 in video transcoding. We also find out that for the Intel processor that adopts dynamic voltage and frequency scaling (DVFS) techniques, the power consumption is not linear with the CPU utilization level. The maximum energy saving achievable from DVFS is 20%. Finally, by utilizing a monthly cost model of data centers, we conclude that ARM cluster based data centers are feasible, and are advantageous in computationally lightweight applications, e.g. in-memory database and network-bounded Web applications. The cost advantage of ARM cluster diminishes progressively for computation-intensive applications, i.e. dynamic Web server application and video transcoding, because the number of ARM processors needed to provide comparable performance increases.","PeriodicalId":346038,"journal":{"name":"2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114233248","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}