2011 IEEE 19th Annual International Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunication Systems最新文献

Estimating Application Cache Requirement for Provisioning Caches in Virtualized Systems 虚拟化系统中发放缓存的应用缓存需求估算

2011 IEEE 19th Annual International Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunication Systems Pub Date : 2011-07-25 DOI: 10.1109/MASCOTS.2011.67

Ricardo Koller, Akshat Verma, R. Rangaswami

{"title":"Estimating Application Cache Requirement for Provisioning Caches in Virtualized Systems","authors":"Ricardo Koller, Akshat Verma, R. Rangaswami","doi":"10.1109/MASCOTS.2011.67","DOIUrl":"https://doi.org/10.1109/MASCOTS.2011.67","url":null,"abstract":"Miss rate curves (MRCs) are a fundamental concept in determining the impact of caches on an application's performance. In our research, we use MRCs to provision caches for applications in a consolidated environment. Current techniques for building MRCs at the CPU caches level require changes to the applications and are restricted to a few processor architectures [7], [22]. In this work, we investigate two techniques to partition shared L2 and L3 caches in a server and build MRCs for the VMs. These techniques make different trade-offs across accuracy, flexibility, and intrusiveness dimensions. The first technique is based on operating system (OS) page coloring and does not require change in commodity hardware or application. We improve upon existing page-coloring based approaches by identifying and overcoming a subtle but real problem of unequal associative cache sets loading to implement accurate cache allocation. Our second technique called Cache Grabber is even less intrusive and requires no changes in hardware, OS, or application. We present a comprehensive evaluation of the relative merits of these and other techniques to estimate MRCs. Our evaluation study enables a data center administrator to select the technique most suitable to his (her) specific data center to provision caches for consolidated applications.","PeriodicalId":415258,"journal":{"name":"2011 IEEE 19th Annual International Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunication Systems","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115103647","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}

引用次数: 11

CosMig: Modeling the Impact of Reconfiguration in a Cloud CosMig:对云中的重新配置的影响进行建模

2011 IEEE 19th Annual International Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunication Systems Pub Date : 2011-07-25 DOI: 10.1109/MASCOTS.2011.37

Akshat Verma, Gautam Kumar, Ricardo Koller, Aritra Sen

{"title":"CosMig: Modeling the Impact of Reconfiguration in a Cloud","authors":"Akshat Verma, Gautam Kumar, Ricardo Koller, Aritra Sen","doi":"10.1109/MASCOTS.2011.37","DOIUrl":"https://doi.org/10.1109/MASCOTS.2011.37","url":null,"abstract":"Clouds allow enterprises to increase or decrease their resource allocation on demand in response to changes in workload intensity. Virtualization is one of the building blocks for cloud computing and provides the mechanisms to implement the dynamic allocation of resources. These dynamic reconfiguration actions lead to performance impact during the reconfiguration duration. In this paper, we model the cost of reconfiguring a cloud-based IT infrastructure in response to workload variations. We show that maintaining a cloud requires frequent reconfigurations necessitating both VM resizing and VM live migration, with live migration dominating reconfiguration costs. We design the CosMig model to predict the duration of live migration and its impact on application performance. Our model is based on parameters that are typically monitored in enterprise data centers. Further, the model faithfully captures the impact of shared resources in a virtualized environment. We experimentally validate the accuracy and effectiveness of CosMig using micro benchmarks and representative applications.","PeriodicalId":415258,"journal":{"name":"2011 IEEE 19th Annual International Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunication Systems","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121658915","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}

引用次数: 50

Analysis of the Most Representative Factors Affecting Warning Message Dissemination in VANETs under Real Roadmaps 真实路线图下vanet预警信息传播最具代表性因素分析

2011 IEEE 19th Annual International Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunication Systems Pub Date : 2011-07-25 DOI: 10.1109/MASCOTS.2011.25

Manuel Fogué, Piedad Garrido, F. Martinez, Juan-Carlos Cano, C. Calafate, P. Manzoni

{"title":"Analysis of the Most Representative Factors Affecting Warning Message Dissemination in VANETs under Real Roadmaps","authors":"Manuel Fogué, Piedad Garrido, F. Martinez, Juan-Carlos Cano, C. Calafate, P. Manzoni","doi":"10.1109/MASCOTS.2011.25","DOIUrl":"https://doi.org/10.1109/MASCOTS.2011.25","url":null,"abstract":"In recent years, new architectures and technologies have been proposed for Vehicular ad hoc networks (VANETs).However, the experiments to validate these proposals tend to overlook the most important and representative factors. Moreover, the scenarios simulated tend to be very simplistic (highways or Manhattan-based layouts), which could seriously affect the validity of the obtained results. In this paper, we present a statistical analysis based on the2k factorial methodology to determine the most representative factors affecting traffic safety applications under real roadmaps. Our purpose is to determine which are the key factors affecting Warning Message Dissemination (WMD) in order to concentrate on such parameters, thus reducing the amount of simulation time required. Simulation results show that the key factors affecting warning messages delivery are the density of vehicles, and the roadmap used. Based on this statistical analysis, we consider that VANET researchers must evaluate the benefits of their proposals using different vehicle densities and city scenarios.","PeriodicalId":415258,"journal":{"name":"2011 IEEE 19th Annual International Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunication Systems","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114839818","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}

引用次数: 25

Automated Transformation of Component-Based Software Architecture Models to Queueing Petri Nets 基于组件的软件体系结构模型到排队Petri网的自动转换

2011 IEEE 19th Annual International Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunication Systems Pub Date : 2011-07-25 DOI: 10.1109/MASCOTS.2011.23

P. Meier, Samuel Kounev, H. Koziolek

{"title":"Automated Transformation of Component-Based Software Architecture Models to Queueing Petri Nets","authors":"P. Meier, Samuel Kounev, H. Koziolek","doi":"10.1109/MASCOTS.2011.23","DOIUrl":"https://doi.org/10.1109/MASCOTS.2011.23","url":null,"abstract":"Performance predictions early in the software development process can help to detect problems before resources have been spent on implementation. The Palladio Component Model (PCM) is an example of a mature domain-specific modeling language for component-based systems enabling performance predictions at design time. PCM provides several alternative model solution methods based on analytical and simulation techniques. However, existing solution methods suffer from scalability issues and provide limited flexibility in trading-off between results accuracy and analysis overhead. Queueing Petri Nets (QPNs) are a general-purpose modeling formalism, at a lower level of abstraction, for which efficient and mature simulation-based solution techniques are available. This paper contributes a formal mapping from PCM to QPN models, implemented by means of an automated model-to-model transformation as part of a new PCM solution method based on simulation of QPNs. The limitations of the mapping and the accuracy and overhead of the new solution method compared to existing methods are evaluated in detail in the context of five case studies of different size and complexity. The new solution method proved to provide good accuracy with solution overhead up to 20 times lower compared to PCM's reference solver.","PeriodicalId":415258,"journal":{"name":"2011 IEEE 19th Annual International Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunication Systems","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132985641","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}

引用次数: 50

A Model-free Learning Approach for Coordinated Configuration of Virtual Machines and Appliances 虚拟机与设备协同配置的无模型学习方法

2011 IEEE 19th Annual International Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunication Systems Pub Date : 2011-07-25 DOI: 10.1109/MASCOTS.2011.44

Xiangping Bu, J. Rao, Chengzhong Xu

{"title":"A Model-free Learning Approach for Coordinated Configuration of Virtual Machines and Appliances","authors":"Xiangping Bu, J. Rao, Chengzhong Xu","doi":"10.1109/MASCOTS.2011.44","DOIUrl":"https://doi.org/10.1109/MASCOTS.2011.44","url":null,"abstract":"Cloud computing has a key requirement for resource configuration in a real-time manner. In such virtualized environments, both virtual machines (VMs) and hosted applications need to be configured on-the-fly to adapt to system dynamics. The interplay between the layers of VMs and applications further complicates the problem of cloud configuration. Independent tuning of each aspect may not lead to optimal system wide performance. In this paper, we propose a framework, namely CoTuner, for coordinated configuration of VMs and resident applications. At the heart of the framework is a model-free hybrid reinforcement learning (RL) approach, which combines the advantages of Simplex and RL methods and is further enhanced by the use of system knowledge guided exploration policies. Experimental results on Xen-based virtualized environments with TPC-W and TPC-C benchmarks demonstrate that CoTuner is able to drive a virtual server system into an optimal or near optimal configuration state dynamically, in response to the change of workload. It improves the systems throughput by more than 30% over independent tuning strategies. In comparison with the coordinated tuning strategies based solely on Simplex or basic RL algorithm, the hybrid RL algorithm gains 30% to 40% throughput improvement. Moreover, the algorithm is able to reduce SLA violation of the applications by more than 80%.","PeriodicalId":415258,"journal":{"name":"2011 IEEE 19th Annual International Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunication Systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128908001","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}

引用次数: 18

Hot Random Off-Loading: A Hybrid Storage System with Dynamic Data Migration 热随机卸载:一种数据动态迁移的混合存储系统

2011 IEEE 19th Annual International Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunication Systems Pub Date : 2011-07-25 DOI: 10.1109/MASCOTS.2011.41

Lin Lin, Yifeng Zhu, Jianhui Yue, Zhao Cai, B. Segee

{"title":"Hot Random Off-Loading: A Hybrid Storage System with Dynamic Data Migration","authors":"Lin Lin, Yifeng Zhu, Jianhui Yue, Zhao Cai, B. Segee","doi":"10.1109/MASCOTS.2011.41","DOIUrl":"https://doi.org/10.1109/MASCOTS.2011.41","url":null,"abstract":"Random accesses are generally harmful to performance in hard disk drives due to more dramatic mechanical movement. This paper presents the design, implementation, and evaluation of Hot Random Off-loading (HRO), a self-optimizing hybrid storage system that uses a fast and small SSD as a by-passable cache to hard disks, with a goal to serve a majority of random I/O accesses from the fast SSD. HRO dynamically estimates the performance benefits based on history access patterns, especially the randomness and the hotness, of individual files, and then uses a 0-1 knapsack model to allocate or migrate files between the hard disks and the SSD. HRO can effectively identify files that are more frequently and randomly accessed and place these files on the SSD. We implement a prototype of HRO in Linux and our implementation is transparent to the rest of the storage stack, including applications and file systems. We evaluate its performance by directly replaying three real-world traces on our prototype. Experiments demonstrate that HRO improves the overall I/O throughput up to 39% and the latency up to 23%.","PeriodicalId":415258,"journal":{"name":"2011 IEEE 19th Annual International Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunication Systems","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122354369","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}

引用次数: 37

Activity Based Sector Synchronisation: Efficient Transfer of Disk-State for WAN Live Migration 基于活动的扇区同步:广域网实时迁移的有效磁盘状态传输

2011 IEEE 19th Annual International Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunication Systems Pub Date : 2011-07-25 DOI: 10.1109/MASCOTS.2011.20

Sherif Akoush, R. Sohan, B. Roman, A. Rice, A. Hopper

引用次数: 15

VIRCONEL: A Network Virtualizer 网络虚拟化器

2011 IEEE 19th Annual International Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunication Systems Pub Date : 2011-07-25 DOI: 10.1109/MASCOTS.2011.38

Yacine Benchaïb, A. Hecker

引用次数: 7

Fuzzy Modeling Based Resource Management for Virtualized Database Systems 基于模糊建模的虚拟化数据库系统资源管理

2011 IEEE 19th Annual International Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunication Systems Pub Date : 2011-07-25 DOI: 10.1109/MASCOTS.2011.70

Lixi Wang, Jing Xu, Ming Zhao, Yi-Cheng Tu, J. Fortes

{"title":"Fuzzy Modeling Based Resource Management for Virtualized Database Systems","authors":"Lixi Wang, Jing Xu, Ming Zhao, Yi-Cheng Tu, J. Fortes","doi":"10.1109/MASCOTS.2011.70","DOIUrl":"https://doi.org/10.1109/MASCOTS.2011.70","url":null,"abstract":"The hosting of databases on virtual machines (VMs) has great potential to improve the efficiency of resource utilization and the ease of deployment of database systems. This paper considers the problem of on-demand allocation of resources to a VM running a database serving dynamic and complex query workloads while meeting QoS (Quality of Service) requirements. An autonomic resource-management approach is proposed to address this problem. It uses adaptive fuzzy modeling to capture the behavior of a VM hosting a database with dynamically changing workloads and to predict its multi-type resource needs. A prototype of the proposed approach is implemented on Xen-based VMs and evaluated using workloads based on TPC-H and RUBiS. The results demonstrate that CPU and disk I/O bandwidth can be efficiently allocated to database VMs serving workloads with dynamically changing intensity and composition while meeting QoS targets. For TPC-H-based experiments, the resulting throughput is within 89.5 -- 100% of what would be obtained using resource allocation based on peak loads, For RUBiS, the response time target (set based on the performance under peak-load-based allocation) is met for 97% of the time. Moreover, substantial resources are saved (about 62.6% of CPU and 76.5% of disk I/O bandwidth) in comparison to peak-load-based allocation.","PeriodicalId":415258,"journal":{"name":"2011 IEEE 19th Annual International Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunication Systems","volume":"703 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116120681","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}

引用次数: 46

A Distributed Self-Learning Approach for Elastic Provisioning of Virtualized Cloud Resources 虚拟化云资源弹性发放的分布式自学习方法

2011 IEEE 19th Annual International Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunication Systems Pub Date : 2011-07-25 DOI: 10.1109/MASCOTS.2011.47

J. Rao, Xiangping Bu, Chengzhong Xu, Kun Wang

{"title":"A Distributed Self-Learning Approach for Elastic Provisioning of Virtualized Cloud Resources","authors":"J. Rao, Xiangping Bu, Chengzhong Xu, Kun Wang","doi":"10.1109/MASCOTS.2011.47","DOIUrl":"https://doi.org/10.1109/MASCOTS.2011.47","url":null,"abstract":"Although cloud computing has gained sufficient popularity recently, there are still some key impediments to enterprise adoption. Cloud management is one of the top challenges. The ability of on-the-fly partitioning hardware resources into virtual machine(VM) instances facilitates elastic computing environment to users. But the extra layer of resource virtualization poses challenges on effective cloud management. The factors of time-varying user demand, complicated interplay between co-hosted VMs and the arbitrary deployment of multitier applications make it difficult for administrators to plan good VM configurations. In this paper, we propose a distributed learning mechanism that facilitates self-adaptive virtual machines resource provisioning. We treat cloud resource allocation as a distributed learning task, in which each VM being a highly autonomous agent submits resource requests according to its own benefit. The mechanism evaluates the requests and replies with feedback. We develop a reinforcement learning algorithm with a highly efficient representation of experiences as the heart of the VM side learning engine. We prototype the mechanism and the distributed learning algorithm in an iBalloon system. Experiment results on an Xen-based cloud test bed demonstrate the effectiveness of iBalloon. The distributed VM agents are able to reach near-optimal configuration decisions in 7 iteration step sat no more than 5% performance cost. Most importantly, iBalloon shows good scalability on resource allocation by scaling to 128correlated VMs.","PeriodicalId":415258,"journal":{"name":"2011 IEEE 19th Annual International Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunication Systems","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132653580","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}

引用次数: 91