{"title":"Understanding the Impact of vCPU Scheduling on DVFS-Based Power Management in Virtualized Cloud Environment","authors":"Ming Liu, Chao Li, Tao Li","doi":"10.1109/MASCOTS.2014.44","DOIUrl":"https://doi.org/10.1109/MASCOTS.2014.44","url":null,"abstract":"Virtualized platform has emerged as a prominent environment for cloud computing, especially in today's power-constrained data centers. However, due to a lack of coordination between runtime power management and a virtual CPU (vCPU) scheduler, existing virtualized cloud platform is far from efficient. First, current frequency control mechanism is unable to satisfy the fast-changing vCPU frequency requirement imposed by vCPU scheduler, which we refer to as demand imbalance problem. In addition, newly created vCPUs, if scheduled solely based on fairness, can cause inefficient frequency rise and drop on an unmatched physical core, which we refer to as utilization mismatch problem. In both cases, the system incurs degraded power efficiency and sub-optimal workload performance. In this study we perform a comprehensive analysis on the interplay between vCPU scheduling and processor-centric power control in virtualized cloud environment. Using representative workloads from Cloud Suite and real server deployment, we examine the energy/performance implications of frequency scaling and vCPU scheduling on both single-VM and multi-VM cloud host. We show that existing virtualized platform has the potential to improve energy efficiency and workload performance by 32% and 25%, respectively, if vCPUs are balanced and appropriately scheduled. We also show that dirty page rate, virtual block device processing rate, virtual network packets arrival rate, and network I/O buffer availability are important efficiency indicators for energy-efficient virtualized cloud system design.","PeriodicalId":345311,"journal":{"name":"2014 IEEE 22nd International Symposium on Modelling, Analysis & Simulation of Computer and Telecommunication Systems","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114970330","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":"COLD: Cloud Optimized Workload Deployer","authors":"Diana Arroyo, Iqbal Mohomed","doi":"10.1109/MASCOTS.2014.76","DOIUrl":"https://doi.org/10.1109/MASCOTS.2014.76","url":null,"abstract":"We demonstrate a prototype system called COLD that we are developing at IBM Research which provides optimized deployment of workload in the cloud. A workload refers to an application, consisting of virtual entities (e.g. VM, volume), to be deployed in a cloud infrastructure, consisting of physical entities (e.g. PM, storage). The resource requirements of the virtual entities, as well as metadata describing relations among virtual entities (e.g. location proximity requirement), are described using a declarative workload definition language, namely using a HOT template. COLD provides a clean separation between the underlying mechanisms offered by a given cloud environment for lifecycle management of virtual resources and policies that influence optimal placement. The current implementation of COLD is tied to Open Stack, though we have plans in the future to make it cloud agnostic. It is designed to be fault-tolerant. In a software defined environment of an Open Stack cloud with various hyper visors, we show the operation of COLD to place various Heat stacks that contain specific policies such as rack-level antic location.","PeriodicalId":345311,"journal":{"name":"2014 IEEE 22nd International Symposium on Modelling, Analysis & Simulation of Computer and Telecommunication Systems","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117129080","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}
Andrej Podzimek, L. Chen, L. Bulej, Walter Binder, P. Tůma
{"title":"Showstopper: The Partial CPU Load Tool","authors":"Andrej Podzimek, L. Chen, L. Bulej, Walter Binder, P. Tůma","doi":"10.1109/MASCOTS.2014.75","DOIUrl":"https://doi.org/10.1109/MASCOTS.2014.75","url":null,"abstract":"Provisioning strategies relying on CPU load may be suboptimal for many applications, because the relation between CPU load and application performance can be non-linear and complex. With the knowledge of the relation between CPU load and application performance, resource provisioning strategies could be tuned to a particular application, but the required knowledge is difficut to obtain, because classic benchmarking is not suited for performance evaluation of partial-load scenarios. As a remedy, we present Showstopper, a tool capable of achieving and sustaining a predefined partial CPU load (or replay a load trace) by controlling the execution of arbitrary CPU-bound workloads. By analyzing performance interference among applications running in colocated virtual machines, we demonstrate how Showstopper enables systematic and reproducible exploration of the platform- and application-specific relation between CPU load and application performance.","PeriodicalId":345311,"journal":{"name":"2014 IEEE 22nd International Symposium on Modelling, Analysis & Simulation of Computer and Telecommunication Systems","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127131407","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}
G. Michelon, L. Lima, J. D. Oliveira, A. Calsavara, G. Andrade
{"title":"A Strategy for Data Replication in Mobile Ad Hoc Networks","authors":"G. Michelon, L. Lima, J. D. Oliveira, A. Calsavara, G. Andrade","doi":"10.1109/MASCOTS.2014.69","DOIUrl":"https://doi.org/10.1109/MASCOTS.2014.69","url":null,"abstract":"This paper addresses the problem of data replication in MANETs (Mobile Ad hoc Network) presenting a new solution that improves the performance of data access in such networks. To make the data available to the user at any place and any time, several issues related to the dynamics of MANETs need to be considered, particularly the node's mobility and limited computing resources. The development of methods for data replication in this context represents, therefore, a major challenge, because a series of application-dependent requirements must be handled in a transparent and adaptive manner. One way to tackle this is through an application-level message forwarding mechanism using Virtual Magnetic Fields. In systems where fault tolerance is implemented through data replication, we show that the use of virtual magnetic fields provides an adequate paradigm in the context of dynamic factors that would influence the decision of which network nodes will keep replicas of data.","PeriodicalId":345311,"journal":{"name":"2014 IEEE 22nd International Symposium on Modelling, Analysis & Simulation of Computer and Telecommunication Systems","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129356151","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":"Concurrent and Distributed CloudSim Simulations","authors":"P. Kathiravelu, L. Veiga","doi":"10.1109/MASCOTS.2014.70","DOIUrl":"https://doi.org/10.1109/MASCOTS.2014.70","url":null,"abstract":"Cloud Computing researches involve a tremendous amount of entities such as users, applications, and virtual machines. Due to the limited access and often variable availability of such resources, researchers have their prototypes tested against the simulation environments, opposed to the real cloud environments. Existing cloud simulation environments such as CloudSim and EmuSim are executed sequentially, where a more advanced cloud simulation tool could be created extending them, leveraging the latest technologies as well as the availability of multi-core computers and the clusters in the research laboratories. This research seeks to develop Cloud2Sim, a concurrent and distributed cloud simulator, extending CloudSim while exploiting the features provided by Hazel cast, Infinispan and Hibernate Search to distribute the storage and execution of the simulation.","PeriodicalId":345311,"journal":{"name":"2014 IEEE 22nd International Symposium on Modelling, Analysis & Simulation of Computer and Telecommunication Systems","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114422255","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":"A Versatile Traffic and Power Aware Performability Analysis of Server Virtualized Systems","authors":"M. Escheikh, H. Jouini, Kamel Barkaoui","doi":"10.1109/MASCOTS.2014.34","DOIUrl":"https://doi.org/10.1109/MASCOTS.2014.34","url":null,"abstract":"We propose in this paper a workload-aware perform ability analysis of elastic server virtualized systems (SVS) based on non-Markovian SRN modeling approach. This analysis investigates correlations between several modules involving workload-aware power management (PM) mechanism, virtual machine (VM) and VM monitor (VMM) subject to aging, failure and rejuvenation. We show through numerical results how performance (i.e. waiting time), power usage as well as power-performance efficiency are impacted by power management attribute when using time varying workload with bursty nature. We show also how we can quantify PM attributes leading to small waiting time and a good utilization of the active power state.","PeriodicalId":345311,"journal":{"name":"2014 IEEE 22nd International Symposium on Modelling, Analysis & Simulation of Computer and Telecommunication Systems","volume":"141 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124483064","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":"ZombieNAND: Resurrecting Dead NAND Flash for Improved SSD Longevity","authors":"E. Wilson, Myoungsoo Jung, M. Kandemir","doi":"10.1109/MASCOTS.2014.37","DOIUrl":"https://doi.org/10.1109/MASCOTS.2014.37","url":null,"abstract":"As consumer pressure for more bits per dollar and higher density-per-solid-state disk (SSD) forces manufacturers to squeeze more than one bit per flash cell and feature sizes downwards, wear-out is again becoming an increasing concern. Specifically, while single-level cell flash at larger feature sizes used to boast over 100,000 program/erase (P/E) cycles, modern triple-level cell flash can only sustain a measly 3,000 P/E cycles before it can no longer be reliably used. However, one lesser known facet of NAND flash design is that there is no material difference between cells that store one, two, or three bits per cell - it is merely a logical interpretation of the cells contents. Therefore, in this work we leverage this interesting property to explore how resurrecting dead flash cells to create \"Zombie-NAND\" flash can improve an SSD's lifetime, and what, if any, impact on latency results in doing such. Specifically, we analyze the impact of switching a TLC or MLC cell down one bit upon death, this allows the voltage thresholds to rise and life, though at a lower capacity, to continue for that cell. Finding that traditional wear-leveling techniques actually inhibit the benefits of this scheme, we propose and explore how controlled \"wear-unleveling\" can work in tandem with Zombie-NAND cells to provide vastly increased life and decreased latencies for the drive. In this exploration, we perform rigorous performance measurement over a number of parameters representative of a variety of commodity and commercial SSDs.","PeriodicalId":345311,"journal":{"name":"2014 IEEE 22nd International Symposium on Modelling, Analysis & Simulation of Computer and Telecommunication Systems","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124107094","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":"Energy Aware Algorithmic Engineering","authors":"Swapnoneel Roy, A. Rudra, Akshat Verma","doi":"10.1109/MASCOTS.2014.47","DOIUrl":"https://doi.org/10.1109/MASCOTS.2014.47","url":null,"abstract":"In this work, we argue that energy management should be a guiding principle for design and implementation of algorithms. Traditional complexity models for algorithms are simple and do not aid in design of energy-efficient algorithms. In this work, we conducted a large number of experiments to understand energy consumption for algorithms. We study the energy consumption for popular vector operations, matrix operations, sorting, and graph algorithms. We observed that the energy consumption for any given algorithm depends on the memory parallelism the algorithm can exhibit for a given data layout in the RAM with variations up to 100% for many popular algorithms. Our experiments validate the asymptotic energy complexity model presented in a companion paper [1] and brings out many practical insights. We show that reads can be more expensive in terms of energy than writes, and different data types can lead to different energy consumption. Our most important result is a theoretical and experimental quantification of the impact of parallel data sequences on energy consumption. We also observe that high memory parallelism can also increase energy consumption with multiple concurrent access sequences. We use insights from our experiments to propose algorithmic engineering techniques for practical energy efficient software.","PeriodicalId":345311,"journal":{"name":"2014 IEEE 22nd International Symposium on Modelling, Analysis & Simulation of Computer and Telecommunication Systems","volume":"4 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113932527","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}
Mennan Selimi, J. L. Florit, Davide Vega, Roc Meseguer, E. López, Amin M. Khan, Axel Neumann, Felix Freitag, Leandro Navarro-Moldes, Roger Baig, P. Garcia, A. Moll, R. P. Centelles, Ivan Vilata i Balaguer, M. Aymerich, Santiago Lamora
{"title":"Cloud-Based Extension for Community-Lab","authors":"Mennan Selimi, J. L. Florit, Davide Vega, Roc Meseguer, E. López, Amin M. Khan, Axel Neumann, Felix Freitag, Leandro Navarro-Moldes, Roger Baig, P. Garcia, A. Moll, R. P. Centelles, Ivan Vilata i Balaguer, M. Aymerich, Santiago Lamora","doi":"10.1109/MASCOTS.2014.73","DOIUrl":"https://doi.org/10.1109/MASCOTS.2014.73","url":null,"abstract":"Community-Lab is an open, distributed infrastructure for researchers to carry out experiments within wireless community networks. Community networks are an emergent model of infrastructures built with off-the-shelf communication equipment that aims to satisfy a community's demand for Internet access and ICT services. Community-Lab consists of more than 100 nodes that are integrated in existing community networks, thus giving researchers access to community networks and allowing them to conduct experimental evaluation of routing protocols, services and applications deployed there. Community networks have now the opportunity to extend the collaborative network building to the next level, that is, building collaborative services implemented as community clouds, built, operated and maintained by the community, that run on community-owned heterogeneous resources, and offer cloud-based services that are of the community's interest. This demo paper focuses on demonstrating the cloud extension of Community-Lab, enabling now community cloud experiments. By means of selected applications, we show how Community-Lab has been extended with distributed clouds, where different devices such as server, desktop PCs, low-resource embedded PCs and IoT boards are brought together forming a heterogeneous distributed cloud environment for researchers to experiment in community networks.","PeriodicalId":345311,"journal":{"name":"2014 IEEE 22nd International Symposium on Modelling, Analysis & Simulation of Computer and Telecommunication Systems","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130164011","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":"Multi-fusion Based Distributed Spectrum Sensing against Data Falsification Attacks and Byzantine Failures in CR-MANET","authors":"Kanthakumar Pongaliur, Li Xiao","doi":"10.1109/MASCOTS.2014.61","DOIUrl":"https://doi.org/10.1109/MASCOTS.2014.61","url":null,"abstract":"In mobile ad-hoc cognitive radio networks (CRMANET), accurately identifying primary user spectrum occupancy is an important requirement in successful utilization of the spectrum by the secondary user. This is made difficult by malicious mobile secondary users launching spectrum sensing data falsification (SSDF) attacks, byzantine failures of devices, primary user signal fading, and hidden terminal problems. Another ability of these malicious users is to use their mobility to hide under the changing neighborhood. Existing state of the art techniques either consider a centralized approach in decision making or when considering an ad-hoc network, do not take into account the mobility of the devices which adds unique limitations. We present a light weight multi-fusion based distributed spectrum sensing scheme (MFDSS) in a mobile ad-hoc secondary user network to overcome the aforementioned problems. MFDSS allows each secondary user to collect semi-global information to make decisions in a distributed manner. It uses outlier detection and data fusion to remove incorrect sensing data generated by byzantine failures. Reputation information of the devices is used to suppress a SSDF attack. MFDSS incorporates a reputation propagation and fusion scheme to prevent malicious devices from hiding behind changing topology and to maintain the freshness of the reputation information. Additionally, MFDSS includes an incubation period to discourage devices from changing identity to perform a Sybil attack or to mask a bad reputation. Detailed analysis is presented and the results show significant improvement in correct primary user spectrum occupancy identification. We also show that without the reputation propagation of MFDSS, a malicious device is able to move its position and hide its malicious intentions in the new neighborhood.","PeriodicalId":345311,"journal":{"name":"2014 IEEE 22nd International Symposium on Modelling, Analysis & Simulation of Computer and Telecommunication Systems","volume":"256 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128909677","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}