2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS)最新文献

筛选
英文 中文
Modeling the Energy-Time Performance of MIC Architecture System MIC架构系统的能量-时间性能建模
Lavanya Ramapantulu, Thy Dao, Dumitrel Loghin, N. Thoai, Y. M. Teo
{"title":"Modeling the Energy-Time Performance of MIC Architecture System","authors":"Lavanya Ramapantulu, Thy Dao, Dumitrel Loghin, N. Thoai, Y. M. Teo","doi":"10.1109/MASCOTS.2016.54","DOIUrl":"https://doi.org/10.1109/MASCOTS.2016.54","url":null,"abstract":"Many Integrated Core (MIC) architecture systems are becoming increasingly popular for HPC applications as they have the dual-advantage of accelerating vector processing and a general-purpose programming model. One of the key challenges for energy-efficient execution on MIC architecture systems is to determine time and energy-efficient configurations among a large system configuration space. Given a parallel program with an execution time deadline and an energy budget, we propose a measurement-based analytical modeling approach to determine these system configurations. In contrast to current approaches, we model both inter-and intra-core resource overlaps, memory contention among threads within a core and memory contention across multiple cores. The model is validated against direct measurement using six representative HPC applications on Intel Xeon Phi system. We show that a Pareto frontier consisting of optimal configurations exist for a parallel program executing on MIC architecture systems. To further understand the Pareto frontier, we use the performance-to-power ratio metric (PPR), that quantifies the amount of useful computations performed per unit energy during the execution. The proposed approach can be used to determine what thread affinity is suitable for offloading execution to accelerators such as Xeon Phi and save energy.","PeriodicalId":129389,"journal":{"name":"2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130553107","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}
引用次数: 1
A Platform for Run-Time Health Verification of Elastic Cyber-Physical Systems 弹性网络物理系统运行时健康验证平台
D. Moldovan, Hong Linh Truong
{"title":"A Platform for Run-Time Health Verification of Elastic Cyber-Physical Systems","authors":"D. Moldovan, Hong Linh Truong","doi":"10.1109/MASCOTS.2016.14","DOIUrl":"https://doi.org/10.1109/MASCOTS.2016.14","url":null,"abstract":"Cyber-physical Systems (CPS) have components deployed both in the physical world, and in computing environments, such as smart buildings or factories. Elastic Cyber-physical Systems (eCPS) are adaptable CPS capable of aligning their resources, cost, and quality to varying demand. However, failures can appear at run-time in the physical or software resources used by the eCPS. Failures can have different origins, from hardware failure, to management operations, software bugs, or resource congestion. While static verification methods can determine failure sources, they are less applicable to eCPS with complex hardware and software stacks. To this end, in this paper we introduce an approach and supporting platform for verifying at run-time eCPS health, and evaluate it on an eCPS for analysis of streaming data from smart environments.","PeriodicalId":129389,"journal":{"name":"2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS)","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133387076","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}
引用次数: 5
Write Amplification with Write Skew 带有写倾斜的写放大
Yue Yang, Jianwen Zhu
{"title":"Write Amplification with Write Skew","authors":"Yue Yang, Jianwen Zhu","doi":"10.1109/MASCOTS.2016.23","DOIUrl":"https://doi.org/10.1109/MASCOTS.2016.23","url":null,"abstract":"Write amplification is a measure of garbage collection efficiency and a key objective to minimize for NAND flash memory based solid state drives. Prior works on analytical modeling of write amplification tend to fall short of the promises to offer more insights than simulations due to their complexity. This paper derives a simple formula to predict write amplification for practical skewed write traffic, which became recently known to closely follow Zipf's law.","PeriodicalId":129389,"journal":{"name":"2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124429549","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}
引用次数: 1
ALUPower: Data Dependent Power Consumption in GPUs ALUPower: gpu中与数据相关的功耗
J. Lucas, B. Juurlink
{"title":"ALUPower: Data Dependent Power Consumption in GPUs","authors":"J. Lucas, B. Juurlink","doi":"10.1109/MASCOTS.2016.21","DOIUrl":"https://doi.org/10.1109/MASCOTS.2016.21","url":null,"abstract":"Existing architectural power models for GPUs count activities such as executing floating point or integer instructions, but do not consider the data values processed. While data value dependent power consumption can often be neglected when performing architectural simulations of high performance Out-of-Order (OoO) CPUs, we show that this approach is invalid for estimating the power consumption of GPUs. The throughput processing approach of GPUs reduces the amount of control logic and shifts the area and power budget towards functional units and register files. This makes accurate estimations of the power consumption of functional units even more crucial than in OoO CPUs. Using measurements from actual GPUs, we show that the processed data values influence the energy consumption of GPUs significantly. For example, the power consumption of one kernel varies between 155 and 257 Watt depending on the processed values. Existing architectural simulators are not able to model the influence of the data values on power consumption. RTL and gate level simulators usually consider data values in their power estimates but require detailed modeling of the employed units and are extremely slow. We first describe how the power consumption of GPU functional units can be measured and characterized using microbenchmarks. Then measurement results are presented and several opportunities for energy reduction by software developers or compilers are described. Finally, we demonstrate a simple and fast power macro model to estimate the power consumption of functional units and provide a significant improvement in accuracy compared to previously used constant energy per instruction models.","PeriodicalId":129389,"journal":{"name":"2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117193201","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}
引用次数: 6
Queueing Analysis of Software Defined Network with Realistic OpenFlow–Based Switch Model 基于现实openflow交换模型的软件定义网络排队分析
Yuki Goto, H. Masuyama, Bryan K. F. Ng, Winston K.G. Seah, Yutaka Takahashi
{"title":"Queueing Analysis of Software Defined Network with Realistic OpenFlow–Based Switch Model","authors":"Yuki Goto, H. Masuyama, Bryan K. F. Ng, Winston K.G. Seah, Yutaka Takahashi","doi":"10.1109/MASCOTS.2016.30","DOIUrl":"https://doi.org/10.1109/MASCOTS.2016.30","url":null,"abstract":"Software Defined Networking (SDN) is the latest network architecture that does for networking what virtualisation did for servers in data centres. In SDN, separation of the control plane from the data plane brought about new flexibility in the routing of flows through the network. Closely associated with SDN is OpenFlow, the most widely used protocol governing the information exchange between the data plane (switching devices) and the control plane (controller). The ease of implementing and testing new schemes in SDN has prompted many researchers to adopt the experimental and prototyping approach to validate their ideas. Consequently, there has been very little work done to evaluate the performance of SDN and/or OpenFlow-based networks analytically. While the experimentation approach in validation has merits, analytical modelling provides valuable insights by making explicit the dependence of SDN performance on chosen parameters. In this paper: (i) we propose a queueing model of an OpenFlow-based SDN that takes into account classful treatment of packets arriving at a switch and (ii) derive an exact analysis of the proposed queueing model.","PeriodicalId":129389,"journal":{"name":"2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115237004","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}
引用次数: 62
Product-Forms for Probabilistic Input/Output Automata 概率输入/输出自动机的产品形式
F. Cavallin, A. Marin, S. Rossi
{"title":"Product-Forms for Probabilistic Input/Output Automata","authors":"F. Cavallin, A. Marin, S. Rossi","doi":"10.1109/MASCOTS.2016.19","DOIUrl":"https://doi.org/10.1109/MASCOTS.2016.19","url":null,"abstract":"Probabilistic I/O automata (PIOAs) provide a modelling framework that is well suited for describing and analyzing distributed and concurrent systems. They incorporate a notion of probabilistic choice as well as a notion of composition that allows one to construct a PIOA for a composite system from a collection of simpler PIOAs representing the components. Differently from other probabilistic models, the local actions of a PIOA are associated with time delays governed by independent random variables with continuous-time exponential distributions. The contribution of this paper consists in studying the product-form property for PIOAs. Our main result is the formulation of a theorem giving sufficient conditions for a composition of PIOAs to be in product-form and hence to efficiently compute its stationary probabilities.","PeriodicalId":129389,"journal":{"name":"2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115318969","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}
引用次数: 0
Optimizing Secure SDN-Enabled Inter-Data Centre Overlay Networks through Cognitive Routing 通过认知路由优化安全的支持sdn的数据中心间覆盖网络
Frédéric François, E. Gelenbe
{"title":"Optimizing Secure SDN-Enabled Inter-Data Centre Overlay Networks through Cognitive Routing","authors":"Frédéric François, E. Gelenbe","doi":"10.1109/MASCOTS.2016.26","DOIUrl":"https://doi.org/10.1109/MASCOTS.2016.26","url":null,"abstract":"More and more businesses are deploying their application(s) with different cloud providers which are close to their customers in order to provide better Quality of Service (QoS) to their end customers. In this work, an optimized and secure software-defined overlay network is proposed as an efficient mechanism to interconnect these geographically-dispersed applications compared to using only plain IP routing. A logically centralized Cognitive Routing Engine (CRE), based on Random Neural Networks with Reinforcement Learning, was developed to find with minimal monitoring overhead the optimal overlay paths when the public Internet is used as the communication means between the overlay nodes. CRE was evaluated by using an overlay network composed of hosts from 5 different public clouds where it was shown that the latency of CRE paths is most of the time within 5% of the latency of the optimal IP paths. Furthermore, it was also demonstrated that CRE is able to do asymmetric path optimization where the forward path is different from the reverse path for a given data centre pair in order to further improve QoS.","PeriodicalId":129389,"journal":{"name":"2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114680532","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}
引用次数: 49
Modeling Energy Packets Networks in the Presence of Failures 存在故障的能量包网络建模
J. Fourneau, A. Marin, S. Balsamo
{"title":"Modeling Energy Packets Networks in the Presence of Failures","authors":"J. Fourneau, A. Marin, S. Balsamo","doi":"10.1109/MASCOTS.2016.44","DOIUrl":"https://doi.org/10.1109/MASCOTS.2016.44","url":null,"abstract":"We model networks of Energy Packets which have been previously introduced by Gelenbe and his colleagues to represent the interactions between communication units and energy units in data processing networks with energy harvesting. We consider failures of batteries and the network structure models the connectivity. The model explicitly represents the amount of Energy Packets needed to transfer a Data Packet. We consider both Data Packets and Jumbo Data Packets which require distinct amounts of energy to be transmitted. Unlike previous models, our approach is based on the assumption that the transmission time of a Data Packet can be neglected when we model Energy Packets harvesting and Leakage which are operating on a larger time scale. We prove that the network of queues associated with the batteries has a product form steady-state distribution under usual Markovian assumptions. An important feature of our model is the ability to study Data Packet losses due to the lack of energy at certain nodes or to the failure of the components which cannot be obtained in previous models with closed form solutions.","PeriodicalId":129389,"journal":{"name":"2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124776045","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}
引用次数: 20
Towards Systemic Risk Aware Engineering of Large-Scale Networks: Complex Systems Perspective 面向大规模网络系统风险感知工程:复杂系统视角
V. Marbukh
{"title":"Towards Systemic Risk Aware Engineering of Large-Scale Networks: Complex Systems Perspective","authors":"V. Marbukh","doi":"10.1109/MASCOTS.2016.20","DOIUrl":"https://doi.org/10.1109/MASCOTS.2016.20","url":null,"abstract":"This paper proposes a framework for systemic risk aware engineering of large-scale networks. Economics drives two major evolutionary trends in networked system design/operation: (a) towards the boundary of the system capacity/operational region, where all system resources are fully utilized, and (b) an increase in the system interconnectivity allowing enlargement of this region due to dynamic resource sharing. However, numerous recent systemic failures in various performance oriented networked systems demonstrated systemic risks associated with these trends. Using the \"Complex System\" perspective, we associate the systemic risks with a possibility of system phase transition to an undesirable persistent state. Specifically, we argue that while growing interconnectivity allows a system to accommodate \"small\" demand/capacity imbalances, sufficiently large imbalances may result in abrupt/discontinuous instabilities, which is a form of \"robust yet fragile\" phenomenon. Motivated by higher performance losses and lower predictability of abrupt/discontinuous vs. gradual/continuous systemic overload, the proposed \"systemic risk aware performance engineering,\" intends to enlarge the system capacity/operational region subject to ensuring gradual/continuous system performance deterioration once the boundary of the system operational region is breached.","PeriodicalId":129389,"journal":{"name":"2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS)","volume":"35 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134165774","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}
引用次数: 0
Robust Server Consolidation: Coping with Peak Demand Underestimation 稳健的服务器整合:应对峰值需求低估
Diarmuid Grimes, D. Mehta, B. O’Sullivan, R. Birke, L. Chen, T. Scherer, Ignacio Castiñeiras
{"title":"Robust Server Consolidation: Coping with Peak Demand Underestimation","authors":"Diarmuid Grimes, D. Mehta, B. O’Sullivan, R. Birke, L. Chen, T. Scherer, Ignacio Castiñeiras","doi":"10.1109/MASCOTS.2016.60","DOIUrl":"https://doi.org/10.1109/MASCOTS.2016.60","url":null,"abstract":"Energy consumption in data centres accounts for a significant proportion of national energy usage in many countries. One approach for reducing energy consumption is to improve the server usage efficiency via workload consolidation. However, there are two primary reasons why this is not done to a large extent. The first reason is that greater consolidation could result in violations of Service Level Agreements (SLAs) if resources are over-utilised. The second reason is that users specify the requirements of a virtual machine (VM) based on the maximum estimated usage for each resource over the whole life span of the VM, and usually over-estimate these maximum values to avoid possible contract violations. Typically, the VM will have significantly lower resource usage in most time periods. Recently, a number of methods have been proposed to predict resource usage of VMs. We show that although these prediction techniques are efficient when their performances are measured using well known metrics, a low prediction error can still result in significant violations of SLAs if not handled properly during workload allocation. Our results emphasise the importance of analysing workload prediction in conjunction with workload allocation techniques. We examine the impact of using predicted resource usage for optimal server consolidation. We investigate the occurrences of over-utilised resources on servers due to under-predicted resource usage. We propose methods to reduce the likelihood of such occurrences, both through the enforcement of safety capacities on the server side, and through biasing towards over-prediction on the VM side. The results indicate that an appropriate balance can be found between energy savings and non-violation of SLAs.","PeriodicalId":129389,"journal":{"name":"2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132218166","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
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信