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

Saving power in flash and disk hybrid storage system 闪存和磁盘混合存储系统的节能性能

2009 IEEE International Symposium on Modeling, Analysis & Simulation of Computer and Telecommunication Systems Pub Date : 2009-12-28 DOI: 10.1109/MASCOT.2009.5366680

L. Prada, José Daniel García Sánchez, J. Carretero, Félix García

引用次数: 5

Presenting Dynamic Markovian Agents with a road tunnel application 动态马尔可夫智能体在公路隧道中的应用

2009 IEEE International Symposium on Modeling, Analysis & Simulation of Computer and Telecommunication Systems Pub Date : 2009-12-28 DOI: 10.1109/MASCOT.2009.5367075

Davide Cerotti, M. Gribaudo, A. Bobbio

引用次数: 10

Service differentiation in multi-rate HSDPA systems 多速率HSDPA系统中的业务分化

2009 IEEE International Symposium on Modeling, Analysis & Simulation of Computer and Telecommunication Systems Pub Date : 2009-12-28 DOI: 10.1109/MASCOT.2009.5366777

Hongxia Sun, C. Williamson

引用次数: 5

Power and performance modeling of virtualized desktop systems 虚拟化桌面系统的功率和性能建模

2009 IEEE International Symposium on Modeling, Analysis & Simulation of Computer and Telecommunication Systems Pub Date : 2009-12-28 DOI: 10.1109/MASCOT.2009.5366785

Andrzej Kochut

{"title":"Power and performance modeling of virtualized desktop systems","authors":"Andrzej Kochut","doi":"10.1109/MASCOT.2009.5366785","DOIUrl":"https://doi.org/10.1109/MASCOT.2009.5366785","url":null,"abstract":"Desktop virtualization is a new delivery method in which desktop operating systems execute in a data center and users access their applications using stateless “thin-client” devices. This paradigm promises significant benefits in terms of data security, flexibility, and reduction of the total cost of ownership. However, in order to further optimize this approach while maintaining good user experience, efficient resource management algorithms are required. This paper formulates an analytical model allowing for detailed investigation of how power consumption of virtualized server farm depends on properties of workload, adaptiveness of virtualization infrastructure, and average density of virtual machines per physical server. Assumptions needed to develop the model are confirmed using statistical analysis of desktop workload traces and the model itself is also validated using simulations. We apply the model to compare power consumption of static and dynamic virtual machine allocation strategies. The results of the study can be used to develop online virtual machine migration algorithms. Even though this paper focuses on virtualized systems running desktop workloads, the modeling approach is general and can be applied in other contexts.","PeriodicalId":275737,"journal":{"name":"2009 IEEE International Symposium on Modeling, Analysis & Simulation of Computer and Telecommunication Systems","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130908683","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}

引用次数: 16

Simulation environment for design and verification of Network-on-Chip and multi-core systems 片上网络和多核系统设计与验证的仿真环境

2009 IEEE International Symposium on Modeling, Analysis & Simulation of Computer and Telecommunication Systems Pub Date : 2009-12-28 DOI: 10.1109/MASCOT.2009.5366697

G. Khan, V. Dumitriu

引用次数: 4

Balancing soft error coverage with lifetime reliability in redundantly multithreaded processors 在冗余多线程处理器中平衡软错误覆盖率和生命周期可靠性

2009 IEEE International Symposium on Modeling, Analysis & Simulation of Computer and Telecommunication Systems Pub Date : 2009-12-28 DOI: 10.1109/MASCOT.2009.5363142

Taniya Siddiqua, S. Gurumurthi

引用次数: 11

Horizon — Exploiting timing information for parallel network simulation 利用时序信息进行并行网络仿真

2009 IEEE International Symposium on Modeling, Analysis & Simulation of Computer and Telecommunication Systems Pub Date : 2009-12-28 DOI: 10.1109/MASCOT.2009.5366710

G. Kunz, O. Landsiedel, Klaus Wehrle

引用次数: 3

Globally fair radio resource allocation for wireless mesh networks 无线网状网络的全球公平无线电资源分配

2009 IEEE International Symposium on Modeling, Analysis & Simulation of Computer and Telecommunication Systems Pub Date : 2009-12-28 DOI: 10.1109/MASCOT.2009.5366631

Ashish Raniwala, Pradipta De, Srikant Sharma, Rupa Krishnan, T. Chiueh

{"title":"Globally fair radio resource allocation for wireless mesh networks","authors":"Ashish Raniwala, Pradipta De, Srikant Sharma, Rupa Krishnan, T. Chiueh","doi":"10.1109/MASCOT.2009.5366631","DOIUrl":"https://doi.org/10.1109/MASCOT.2009.5366631","url":null,"abstract":"Network flows running on a wireless mesh network (WMN) may suffer from partial failures in the form of serious throughput degradation, sometimes to the extent of starvation, because of weaknesses in the underlying MAC protocol, dissimilar physical transmission rates or different degrees of local congestion. Most existing WMN transport protocols fail to take these factors into account. This paper describes the design, implementation and evaluation of a coordinated congestion control (C3L) algorithm that guarantees fair resource allocation under adverse scenarios and thus provides end-to-end max-min fairness among competing flows. The C3L algorithm features an advanced topology discovery mechanism that detects the inhibition of wireless communication links, and a general collision domain capacity re-estimation mechanism that effectively addresses such inhibition. A comprehensive ns-2-based simulation study as well as empirical measurements taken from an IEEE 802.11a-based multi-hop wireless testbed demonstrate that the C3L algorithm greatly improves inter-flow fairness, eliminates the starvation problem, and at the same time maintains high radio resource utilization efficiency.","PeriodicalId":275737,"journal":{"name":"2009 IEEE International Symposium on Modeling, Analysis & Simulation of Computer and Telecommunication Systems","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127818279","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}

引用次数: 10

Workload modeling using pseudo2D-HMM 使用pseudo2D-HMM进行工作负载建模

2009 IEEE International Symposium on Modeling, Analysis & Simulation of Computer and Telecommunication Systems Pub Date : 2009-12-28 DOI: 10.1109/MASCOT.2009.5366721

Alessandro Moro, E. Mumolo, M. Nolich

{"title":"Workload modeling using pseudo2D-HMM","authors":"Alessandro Moro, E. Mumolo, M. Nolich","doi":"10.1109/MASCOT.2009.5366721","DOIUrl":"https://doi.org/10.1109/MASCOT.2009.5366721","url":null,"abstract":"In this paper, we present a novel approach for accurate modeling of computer workloads. According to this approach, the sequences of features generated by a program during its execution are considered as time series and are processed with signal processing techniques both for feature extraction and statistical pattern matching. In the feature extraction phase we used spectral analysis for describing the sequence and to retain the important information. In the pattern matching phase we used a simplified form of bidimensional Hidden Markov Model, called pseudo2D-HMM, as Statistical Machine Learning Algorithm. Several processes of the same workload are necessary to obtain a 2D-HMM model of the workload. In this way, the models are obtained in an initial training phase; we developed techniques for on-line workload classification of a running process and for synthetic traces generation. The proposed algorithms is evaluated via trace-driven simulations using the SPEC 2000 workloads. We show that pseudo2D-HMMs accurately describe memory references sequences; the classification accuracy is about 92% with six different workloads.","PeriodicalId":275737,"journal":{"name":"2009 IEEE International Symposium on Modeling, Analysis & Simulation of Computer and Telecommunication Systems","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124257353","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

Performance modeling of systems using fair share scheduling with Layered Queueing Networks 分层排队网络中公平共享调度系统的性能建模

2009 IEEE International Symposium on Modeling, Analysis & Simulation of Computer and Telecommunication Systems Pub Date : 2009-12-28 DOI: 10.1109/MASCOT.2009.5366689

Lianhua Li, G. Franks

{"title":"Performance modeling of systems using fair share scheduling with Layered Queueing Networks","authors":"Lianhua Li, G. Franks","doi":"10.1109/MASCOT.2009.5366689","DOIUrl":"https://doi.org/10.1109/MASCOT.2009.5366689","url":null,"abstract":"Fair-share scheduling attempts to grant access to a resource based on the amount of ¿share¿ that a task possesses. It is widely used in places such as Internet routing, and recently, in the Linux kernel. Software performance engineering is concerned with creating responsive applications and often uses modeling to predict the behaviour of a system before the system is built. This work extends the Layered Queueing Network (LQN) performance model used to model distributed software systems by including hierarchical fair-share scheduling with both guarantees and caps. To exercise the model, the Completely Fair Scheduler, found in recent Linux kernels, is incorporated into PARASOL, the underlying simulation engine of the LQN simulator, lqsim. This simulator is then used to study the effects of fair-share scheduling on a multi-tier implementation of a building security system. The results here show that fair-share scheduling with guarantees is not sufficient when an application is layered into multiple tiers because of contention at lower layers in the system. Fair-share scheduling with caps must be used instead.","PeriodicalId":275737,"journal":{"name":"2009 IEEE International Symposium on Modeling, Analysis & Simulation of Computer and Telecommunication Systems","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133693401","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}

引用次数: 9