Jakub Krzywda, A. Ali-Eldin, E. Wadbro, Per-Olov Östberg, E. Elmroth
{"title":"Power Shepherd: Application Performance Aware Power Shifting","authors":"Jakub Krzywda, A. Ali-Eldin, E. Wadbro, Per-Olov Östberg, E. Elmroth","doi":"10.1109/CloudCom.2019.00019","DOIUrl":"https://doi.org/10.1109/CloudCom.2019.00019","url":null,"abstract":"Constantly growing power consumption of data centers is a major concern from environmental and economical reasons. Current approaches to reduce negative consequences of high power consumption focus on limiting the peak power consumption. During high workload periods, power consumption of highly utilized servers is throttled to stay within the power budget. However, the peak power reduction affects performance of hosted applications and thus leads to Quality of Service violations. In this paper, we introduce Power Shepherd, a hierarchical system for application performance aware power shifting. Power Shepherd reduces the data center operational costs by redistributing the available power among applications hosted in the cluster. This is achieved by, assigning server power budgets by the cluster controller, enforcing these power budgets using Running Average Power Limit (RAPL), and prioritizing applications within each server by adjusting the CPU scheduling configuration. We implement a prototype of the proposed solution and evaluate it in a real testbed equipped with power meters and using representative cloud applications. Our experiments show that Power Shepherd has potential to manage a cluster consisting of thousands of servers and limit the increase of operational costs by a significant amount when the cluster power budget is limited and the system is overutilized. Finally, we identify some outstanding challenges regarding model sensitivity and the fact that this approach in its current from is not beneficial to be used in all situations, e.g., when the system is underutilized.","PeriodicalId":181972,"journal":{"name":"2019 IEEE International Conference on Cloud Computing Technology and Science (CloudCom)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131925973","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":"MicroValid: A Validation Framework for Automatically Decomposed Microservices","authors":"Michel Cojocaru, Alexandru Uta, Ana Oprescu","doi":"10.1109/CloudCom.2019.00023","DOIUrl":"https://doi.org/10.1109/CloudCom.2019.00023","url":null,"abstract":"In a dynamic world of software development, the architectural styles are continuously evolving, adapting to new technologies and trends. Microservice architecture (MSA) is gaining adoption among industry practitioners due to its advantages compared to the monolithic architecture. Although MSA builds on the core concepts of Service Oriented Architecture (SOA), it pushes for a finer granularity, with stricter boundaries. Due to cost rationale, numerous companies choose to migrate from the monolithic style instead of developing from scratch. Recently, semi-automatic decomposition tools assist the migration process, yet a crucial part is still missing: validation. The current study focuses on providing a validation framework for microservices decomposed from monolithic applications and complete the puzzle of architectural migrations. From previous work we select quality attributes of microservices that may be assessed using static analysis. We then provide an implementation specification of the validation framework. We use five applications to evaluate our approach, and the results show that our solution is scalable while providing insightful measurements of the assessed quality attributes of microservices.","PeriodicalId":181972,"journal":{"name":"2019 IEEE International Conference on Cloud Computing Technology and Science (CloudCom)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116991402","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":"qCUDA: GPGPU Virtualization for High Bandwidth Efficiency","authors":"Yu-Shiang Lin, Chun-Yuan Lin, Che-Rung Lee, Yeh-Ching Chung","doi":"10.1109/CloudCom.2019.00025","DOIUrl":"https://doi.org/10.1109/CloudCom.2019.00025","url":null,"abstract":"The increasing demand for machine learning computation contributes to the convergence of high-performance computing and cloud computing, in which the virtualization of Graphics Processing Units (GPUs) becomes a critical issue. Although many GPGPU virtualization frameworks have been proposed, their performance is limited by the bandwidth of data transactions between the virtual machine (VM) and host. In this paper, we present a virtualization framework, qCUDA, to improve the performance of compute unified device architecture (CUDA) programs. qCUDA is based on the virtio framework, providing the para-virtualized driver and the device module for performing the interaction with the API remoting and memory management methods. In our test environment, qCUDA can achieve above 95% of the bandwidth efficiency for most results by comparing it with the native. Also, qCUDA has the features of flexibility and interposition. It can execute CUDA-compatible programs in the Linux and Windows VMs, respectively, on QEMU-KVM hypervisor for GPGPU virtualization.","PeriodicalId":181972,"journal":{"name":"2019 IEEE International Conference on Cloud Computing Technology and Science (CloudCom)","volume":"137 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127569619","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}
H. Jo, Youngjin Kim, Hochul Lee, Young Choon Lee, Hyuck Han, Sooyong Kang
{"title":"On the Trade-Off Between Performance and Storage Efficiency of Replication-Based Object Storage","authors":"H. Jo, Youngjin Kim, Hochul Lee, Young Choon Lee, Hyuck Han, Sooyong Kang","doi":"10.1109/CloudCom.2019.00051","DOIUrl":"https://doi.org/10.1109/CloudCom.2019.00051","url":null,"abstract":"The object storage systems are used to store and manage unstructured data. Most object storage systems provide the replication policy (REP) or erasure code policy (EC) to ensure the reliability and availability of data. In this paper, we study the trade-off between performance and storage efficiency of these policies with respect to different data sizes of user requests. To this end, we present a hybrid policy management system that takes advantage of both policies by automatically changing policy based on data size. We have implemented the hybrid system in OpenStack Swift. Our evaluation results show the throughput of GET request increases up to 36% while improving storage efficiency by up to 53% compared to that using the REP policy.","PeriodicalId":181972,"journal":{"name":"2019 IEEE International Conference on Cloud Computing Technology and Science (CloudCom)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131478848","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}
Chaofeng Wu, Ian T Foster, Ted Summer, Zhuozhao Li, A. Woodard, Ryan Chard, Matt Baughman, Y. Babuji, K. Chard, Jason Pitt
{"title":"ParaOpt: Automated Application Parameterization and Optimization for the Cloud","authors":"Chaofeng Wu, Ian T Foster, Ted Summer, Zhuozhao Li, A. Woodard, Ryan Chard, Matt Baughman, Y. Babuji, K. Chard, Jason Pitt","doi":"10.1109/CloudCom.2019.00045","DOIUrl":"https://doi.org/10.1109/CloudCom.2019.00045","url":null,"abstract":"The variety of instance types available on cloud platforms offers enormous flexibility to match the requirements of applications with available resources. However, selecting the most suitable instance type and configuring an application to optimally execute on that instance type can be complicated and time-consuming. For example, application parallelism flags must match available cores and problem sizes must be tuned to match available memory. As the search space of application configurations can be enormous, we propose an automated approach, called ParaOpt, to automatically explore and tune application configurations on arbitrary cloud instances. ParaOpt supports arbitrary applications, enables use of custom optimization methods, and can be configured with different optimization targets such as runtime and cost. We evaluate ParaOpt by optimizing genomics, molecular dynamics, and machine learning applications with four types of optimizers. We show with as few as 15 parameterized executions of an application, representing between 1.2%-26.7% of the search space, that ParaOpt is able to identify the optimal configuration in 32.7% of experiments and a near-optimal configuration in 83.2% of cases. As a result of using near-optimal configurations, ParaOpt reduces overall execution time by up to 85.8% when compared with using the default configuration.","PeriodicalId":181972,"journal":{"name":"2019 IEEE International Conference on Cloud Computing Technology and Science (CloudCom)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125513241","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":"Adaptive Cloud Application Tuning with Enhanced Structural Bayesian Optimization","authors":"Yuankun Shi, Ziyang Peng, Ren Wang, Zhaojuan Bian","doi":"10.1109/CloudCom.2019.00014","DOIUrl":"https://doi.org/10.1109/CloudCom.2019.00014","url":null,"abstract":"Bayesian optimization has been widely applied on the performance tuning for workloads such as: large web applications running on Java Virtual Machine (JVM), parallel databases such as Hive / HBase, and Hive on Spark. However, with the rapidly expanding search space of these complex and large applications on cloud, the evaluation phase takes inordinate amount of time, rendering Bayesian optimization ineffective. In this paper, we propose a novel Bayesian optimization based framework, called, Adaptive Cloud Application Optimization Framework (ACAOF) to efficiently and optimally tune the performance of cloud workloads via significantly pruning the search space. We conducted extensive evaluations on ACAOF to compare with non-optimized Bayesian optimization on multiple categories of cloud workloads. The results demonstrate that the ACAOF outperforms approximately by up to 218%. The comparison with other machine learning techniques such as Random Search, Neural Network, Genetic Algorithm and Hill Climb also shows the significant effectiveness of ACAOF.","PeriodicalId":181972,"journal":{"name":"2019 IEEE International Conference on Cloud Computing Technology and Science (CloudCom)","volume":"181 21","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114004506","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}
M. Chowdhury, M. Ferdous, Kamanashis Biswas, Niaz Chowdhury, A. Kayes, P. Watters, Alex Ng
{"title":"Trust Modeling for Blockchain-Based Wearable Data Market","authors":"M. Chowdhury, M. Ferdous, Kamanashis Biswas, Niaz Chowdhury, A. Kayes, P. Watters, Alex Ng","doi":"10.1109/CloudCom.2019.00070","DOIUrl":"https://doi.org/10.1109/CloudCom.2019.00070","url":null,"abstract":"Wearable devices continuously produce physiological data that can provide individuals critical information about their daily routine or fitness level in combination with their smartphones without requiring manual calculations or maintaining log-books. Real-time participant-generated data can enable large scale observational studies of health conditions, provide better insights into medical conditions of individuals and streamline clinical trial processes in medical research. However, privacy is a major concern for health data and there can be a lack of trust among different parties in the health data collection process. In addition, individuals often do not have sufficient control over the sharing of their data from the wearable devices. The lack of control, trust and privacy are key barriers to research participants being prepared to share their personal data from wearable devices. In this work, we propose a trust model to overcome the trust deficit among different parties. Then, we present a reference system architecture, rooted on the developed trust model, that provides incentive for individuals to securely share their health data through a data marketplace. By encouraging individuals to share their real-time health data, researchers will have access to large data sets at low cost.","PeriodicalId":181972,"journal":{"name":"2019 IEEE International Conference on Cloud Computing Technology and Science (CloudCom)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125561257","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}
Sudershan Lakshmanan Thirunavukkarasu, Mengyuan Zhang, Alaa Oqaily, Gagandeep Chawla, Lingyu Wang, M. Pourzandi, M. Debbabi
{"title":"Modeling NFV Deployment to Identify the Cross-Level Inconsistency Vulnerabilities","authors":"Sudershan Lakshmanan Thirunavukkarasu, Mengyuan Zhang, Alaa Oqaily, Gagandeep Chawla, Lingyu Wang, M. Pourzandi, M. Debbabi","doi":"10.1109/CloudCom.2019.00034","DOIUrl":"https://doi.org/10.1109/CloudCom.2019.00034","url":null,"abstract":"By providing network functions through software running on standard hardware, Network Functions Virtualization (NFV) brings many benefits, such as increased agility and flexibility with reduced costs, as well as additional security concerns. Although existing works have examined various security issues of NFV, such as vulnerabilities in VNF software and DoS, there has been little effort on a security issue that is intrinsic to NFV, i.e., as an NFV environment typically involves multiple abstraction levels, the inconsistency that may arise between different levels can potentially be exploited for security attacks. In this paper, we propose the first NFV deployment model to capture the deployment aspects of NFV at different abstraction levels, which is essential for an in-depth study of the inconsistencies between such levels. Based on the model and an implemented NFV testbed, we present concrete attack scenarios in which the inconsistencies are exploited to attack the network functions in a stealthy manner. Finally, we study the feasibility of detecting the inconsistencies through verification.","PeriodicalId":181972,"journal":{"name":"2019 IEEE International Conference on Cloud Computing Technology and Science (CloudCom)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127299499","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":"Activity Monitor A Personal Informatics Application","authors":"R. Dayarathna, Thisura Rathnayake","doi":"10.1109/CloudCom.2019.00054","DOIUrl":"https://doi.org/10.1109/CloudCom.2019.00054","url":null,"abstract":"This paper presents a personal informatics application developed to correctly identify the interactions of the users with their digital devices. As the first phase of this initiative was on the interaction with personal computers. Activity Monitor helps to answer or assist to answer questions related to addiction to the internet and various negative behaviors associated with computer usage.","PeriodicalId":181972,"journal":{"name":"2019 IEEE International Conference on Cloud Computing Technology and Science (CloudCom)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127924819","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":"Reasoning Based Workload Performance Prediction in Cloud Data Centers","authors":"Adeel Aslam, Hanhua Chen, Jiang Xiao, Hai Jin","doi":"10.1109/CloudCom.2019.00073","DOIUrl":"https://doi.org/10.1109/CloudCom.2019.00073","url":null,"abstract":"Cloud computing provides utility-based and scalable services to end-users. In the past decade, the demands for resource management in cloud computing have increased substantially which lead to certain challenges such as optimal resource utilization, power consumption, and service level agreement violations. Workload performance prediction serves as an assistance to address these issues. In this paper, we propose a prediction model based on clustered Case-Based Reasoning (CBR). The proposed model determines the performance metrics for workload prior to the co-operation of autonomic computing characteristics. Thus, CBR provides optimal scheduling of resources and workload monitoring for cloud data centers. In order to validate the proposed CBR-based prediction model, we perform a series of experiments and evaluate the effectiveness in terms of precision, recall, f-measure, and mean square error rate. We generate the cases for CBR using traces from the Google cluster data center. Moreover, we also validate our proposed prediction model against Support Vector Machine (SVM) prediction scheme. Experimental results show that the proposed CBR outperforms the SVM-based approach and yields 10% improvement in terms of precision.","PeriodicalId":181972,"journal":{"name":"2019 IEEE International Conference on Cloud Computing Technology and Science (CloudCom)","volume":"291 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121280873","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}