2010 IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems最新文献_第2页

A Simulation Framework for the Analysis of the TLB Behavior in Virtualized Environments 虚拟环境中TLB行为分析的仿真框架

2010 IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems Pub Date : 2010-08-17 DOI: 10.1109/MASCOTS.2010.30

G. Venkatasubramanian, R. Figueiredo, R. Illikkal, D. Newell

{"title":"A Simulation Framework for the Analysis of the TLB Behavior in Virtualized Environments","authors":"G. Venkatasubramanian, R. Figueiredo, R. Illikkal, D. Newell","doi":"10.1109/MASCOTS.2010.30","DOIUrl":"https://doi.org/10.1109/MASCOTS.2010.30","url":null,"abstract":"Due to the rising importance of virtualization, extensive efforts have gone into determining and improving the performance of workloads on virtualized platforms. This has resulted in a series of modifications to the leading architecture used in virtualized system (x86) by adding hardware support for virtualization, the latest of which is the addition of tags and tag comparators to the x86 TLB. In this context, it is necessary to have a thorough understanding of the TLB behavior of virtualized workloads and understand the change in this behavior with TLB related architectural parameters. One way of obtaining this understanding is by conducting a simulation-based study of the interaction of various micro-architectural parameters and their effect on the TLB behavior. However, the lack of suitable simulation frameworks makes such a study daunting. In this paper, we present a full-system simulation framework which is suitable for conducting such studies. We first motivate the need for TLB modeling in virtualized systems. Then, we present the framework, develop and validate a timing model for the TLB and evaluate the simulation speed when this model is used. Using the timing model, the influence of the TLB on workload performance is examined for a variety of single and multi-domain workloads and compared with equivalent non-virtualized workloads. It is found that the performance of virtualized workloads, in terms of instructions per cycle (IPC), can vary by 1% to 35% due to the TLB and that this IPC variation can be as much as 9 times the variation in nonvirtualized workloads.","PeriodicalId":406889,"journal":{"name":"2010 IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116853252","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}

引用次数: 8

Predicting the Performance of Virtual Machine Migration 预测虚拟机迁移的性能

2010 IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems Pub Date : 2010-08-17 DOI: 10.1109/MASCOTS.2010.13

Sherif Akoush, R. Sohan, A. Rice, A. Moore, A. Hopper

引用次数: 318

A Symbolic Reachability Graph and Associated Markov Process for a Class of Dynamic Petri Nets 一类动态Petri网的符号可达图及相关马尔可夫过程

2010 IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems Pub Date : 2010-08-17 DOI: 10.1109/MASCOTS.2010.65

L. Capra

引用次数: 2

Analytical Modelling and Message Delay Performance Evaluation of the IEEE 802.16 MAC Protocol IEEE 802.16 MAC协议的分析建模与消息延迟性能评估

2010 IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems Pub Date : 2010-08-17 DOI: 10.1109/MASCOTS.2010.27

L. D. Moraes, D. Vieira

{"title":"Analytical Modelling and Message Delay Performance Evaluation of the IEEE 802.16 MAC Protocol","authors":"L. D. Moraes, D. Vieira","doi":"10.1109/MASCOTS.2010.27","DOIUrl":"https://doi.org/10.1109/MASCOTS.2010.27","url":null,"abstract":"The IEEE 802.16 is a well known set of standards, which have been developed for global deployment of Metropolitan Area Networks (MANs) in order to provide broadband wireless accesses supporting the integrated transmission of multimedia applications with different Quality of Service (QoS) requirements. In order to achieve the QoS requirements of multimedia applications, the IEEE 802.16 standards offers different scheduling schemes. This paper is concerned with the analytical modelling of the MAC protocol and the analysis of average message delays for real and non-real time traffics in broadband access wireless networks operating under the IEEE 802.16 standard. The message delays results obtained are presented for two scenarios, as a function of the load generated for different types of traffic. In addition, the impact on the network performance caused by some of the parameters utilized as part of the random access mechanism is also investigated. The results obtained through the use of the analytical model proposed in this paper are compared with those obtained with the aid of a simulation tool. The agreement of comparisons involving analytical and simulation results in the examples studied show that the model proposed in this paper could be very useful when utilized to represent and study further behavior characteristics of the end-to-end message delays involved in IEEE 802.16 standard MAC protocol under consideration.","PeriodicalId":406889,"journal":{"name":"2010 IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130333073","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}

引用次数: 7

Profit Allocation in Coalitional VoD Service 联盟视频点播业务的利润分配

2010 IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems Pub Date : 2010-08-17 DOI: 10.1109/MASCOTS.2010.20

N. Kamiyama, R. Kawahara, H. Hasegawa

{"title":"Profit Allocation in Coalitional VoD Service","authors":"N. Kamiyama, R. Kawahara, H. Hasegawa","doi":"10.1109/MASCOTS.2010.20","DOIUrl":"https://doi.org/10.1109/MASCOTS.2010.20","url":null,"abstract":"Although video-on-demand (VoD) services are provided by many ISPs, the amount of content provided by each VoD service is one order smaller than that provided by rental video services, so the limited content count is one of the obstacles to widespread VoD services. To solve this problem, ISPs can form a coalition with other ISPs and use content owned by other ISPs. However, to form a coalition among multiple ISPs, ISPs need to rationally allocate the profit obtained by the coalition to convince all ISPs participating in the coalition. We propose using the Shapley value of the coalitional game as the rational allocation of profit. Assuming that all but one ISP has the same number of users or (and) the same number of rare content, we derive the Shapley value in closed form and clarify the influence of the numbers of users and rare content on the coalition. We also compare the Shapley value with three general allocation models and show that the Shapley value agrees with the allocation when the profit obtained by each content delivery is equally shared by two ISPs, one that accommodates the receiving user and the other that owns the delivered content.","PeriodicalId":406889,"journal":{"name":"2010 IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133420477","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

Dynamic Load Balancing Multipathing in Data Center Ethernet 数据中心以太网中的动态负载均衡多路径

2010 IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems Pub Date : 2010-08-17 DOI: 10.1109/MASCOTS.2010.51

Yang Yu, Khin Mi Mi Aung, Edmund Kheng Kiat Tong, C. Foh

引用次数: 11

Sequential Prefetch Cache Sizing for Maximal Hit Rate 最大命中率的顺序预取Cache大小

2010 IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems Pub Date : 2010-08-17 DOI: 10.1109/MASCOTS.2010.18

S. Bhatia, Elizabeth Varki, A. Merchant

{"title":"Sequential Prefetch Cache Sizing for Maximal Hit Rate","authors":"S. Bhatia, Elizabeth Varki, A. Merchant","doi":"10.1109/MASCOTS.2010.18","DOIUrl":"https://doi.org/10.1109/MASCOTS.2010.18","url":null,"abstract":"We propose a prefetch cache sizing module for use with any sequential prefetching scheme and evaluate its impact on the hit rate. Disk array caches perform sequential prefetching by loading data contiguous to I/O request data into the array cache. If the I/O workload has sequential locality, then data prefetched in response to sequential accesses in the workload will receive hits. Different schemes prefetch different data, so the prefetch cache size requirement varies. Moreover, the proportion of sequential and random requests in the workload and their interleaving pattern affects the size requirement. If the cache is too small, then prefetched data would get evicted from the cache before a request for the data arrives, thus lowering the hit rate. If the cache is too large, then valuable cache space is wasted. We present a simple sizing module that can be added to any prefetching scheme to ensure that the prefetch cache size is adequately matched to the requirement of the prefetching scheme on a dynamic workload comprising multiple streams. We analytically compute the maximal hit rate achievable by popular prefetching schemes and through simulations, show that our sizing module maintains the prefetch cache at a size that nearly achieves this maximal hit rate.","PeriodicalId":406889,"journal":{"name":"2010 IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128678360","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}

引用次数: 19

Element Based Semantics in Multi Formalism Performance Models 多形式化性能模型中基于元素的语义

2010 IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems Pub Date : 2010-08-17 DOI: 10.1109/MASCOTS.2010.54

M. Iacono, M. Gribaudo

引用次数: 25

RRDtrace: Long-term Raw Network Traffic Recording using Fixed-size Storage RRDtrace:使用固定大小存储的长期原始网络流量记录

2010 IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems Pub Date : 2010-08-17 DOI: 10.1109/MASCOTS.2010.19

A. Papadogiannakis, M. Polychronakis, E. Markatos

{"title":"RRDtrace: Long-term Raw Network Traffic Recording using Fixed-size Storage","authors":"A. Papadogiannakis, M. Polychronakis, E. Markatos","doi":"10.1109/MASCOTS.2010.19","DOIUrl":"https://doi.org/10.1109/MASCOTS.2010.19","url":null,"abstract":"Recording raw network traffic for long-term periods can be extremely beneficial for a multitude of monitoring and security applications. However, storing all traffic of high volume networks is infeasible even for short-term periods due to the increased storage requirements. Traditional approaches for data reduction like aggregation and sampling either require knowing the traffic features of interest in advance, or reduce the traffic volume by selecting a representative set of packets uniformly over the collecting period. In this work we present RRDtrace, a technique for storing full-payload packets for arbitrary long periods using fixed-size storage. RRDtrace divides time into intervals and retains a larger number of packets for most recent intervals. As traffic ages, an aging daemon is responsible for dynamically reducing its storage space by keeping smaller representative groups of packets, adapting the sampling rate accordingly. We evaluate the accuracy of RRDtrace on inferring the flow size distribution, distribution of traffic among applications, and percentage of malicious population. Our results show that RRDtrace can accurately estimate these properties using the suitable sampling strategy, some of them for arbitrary long time and others only for a recent period.","PeriodicalId":406889,"journal":{"name":"2010 IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems","volume":"171 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129664346","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

Black-Box Performance Modeling for Solid-State Drives 固态硬盘的黑匣子性能建模

2010 IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems Pub Date : 2010-08-17 DOI: 10.1109/MASCOTS.2010.48

Shan Li, H. H. Huang

{"title":"Black-Box Performance Modeling for Solid-State Drives","authors":"Shan Li, H. H. Huang","doi":"10.1109/MASCOTS.2010.48","DOIUrl":"https://doi.org/10.1109/MASCOTS.2010.48","url":null,"abstract":"Flash-based Solid-State Drives (SSDs) have become a promising alternative to magnetic Hard Disk Drives (HDDs) thanks to the large improvements in performance, power consumption, and shock resistance. An accurate SSD performance model will provide the important research tools for exploring the design space of flash-based storage systems. While many HDD performance models have been developed, architectural differences prevent these models from being effective for SSDs, mostly because their designs cannot accurately account for many unique SSD characteristics (e.g., low latencies, slow updates, and expensive erases). In this paper, we utilize the black-box modeling technique to analyze and evaluate SSD performance, including latency, bandwidth, and throughput. Such an approach is appealing because it requires minimal a priori information about SSDs. We construct and evaluate our models on three commercial SSDs. Although this approach may lead to less accurate predictions for HDDs, we find that a black-box model with a comprehensive set of workload characteristics can achieve the mean relative errors of 20%, 13%, and 6% for latency, bandwidth, and throughput predictions, respectively.","PeriodicalId":406889,"journal":{"name":"2010 IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems","volume":"2000 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130287091","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}

引用次数: 38