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

筛选
英文 中文
Generating Optimal Thresholds in a Hysteresis Queue: Application to a Cloud Model 在迟滞队列中生成最佳阈值:在云模型中的应用
Thomas Tournaire, Hind Castel-Taleb, E. Hyon, Toussaint Hoché
{"title":"Generating Optimal Thresholds in a Hysteresis Queue: Application to a Cloud Model","authors":"Thomas Tournaire, Hind Castel-Taleb, E. Hyon, Toussaint Hoché","doi":"10.1109/MASCOTS.2019.00040","DOIUrl":"https://doi.org/10.1109/MASCOTS.2019.00040","url":null,"abstract":"Reducing the energy consumption of a cloud system while guaranteeing a given quality of service level is a crucial problem encountered today by cloud providers. We consider an auto-scaling model where virtual machines are turned on and off depending on the queue's occupation (or thresholds). This model represents the variability of allocated resources (Virtual Machines or VMs) according to user demands. It can be studied using an hysteresis queuing model, which is represented by a multidimensional Markov chain, whose calculation of the stationary distribution becomes complex when the number of VMs grows. We adopt a cost-aware approach and define a mean cost computed as a reward function on the stationary distribution. This cost takes into account both the performance (for Service Level Agreement: SLA) and the use of the resources (for Energy). We propose efficient optimisation methods to find threshold values minimising the global cost. Because this mean cost is a non-convex function, the research of the optimal value is complex. We propose different optimisation methods: the first one, based on heuristics, coupled with aggregation of the Markov Chain to reduce the execution time and the second one which is a meta heuristic: the Simulated Annealing. Finally, we present a real case of a cloud system that we model and set parameter values to test our optimisation algorithms and show their relevance.","PeriodicalId":149243,"journal":{"name":"2019 IEEE 27th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124456726","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
Benchmarking Parallel File System Sensitiveness to I/O patterns 基准测试并行文件系统对I/O模式的敏感性
Konstantinos Chasapis, Jean-Yves Vet, Jean-Thomas Acquaviva
{"title":"Benchmarking Parallel File System Sensitiveness to I/O patterns","authors":"Konstantinos Chasapis, Jean-Yves Vet, Jean-Thomas Acquaviva","doi":"10.1109/MASCOTS.2019.00054","DOIUrl":"https://doi.org/10.1109/MASCOTS.2019.00054","url":null,"abstract":"With the raise of data analytic and more generally data intensive computing, the traditional benchmarking of parallel file systems is stretched to its limits. While often promoted on their peak performance, most have difficulties to cope with the complex I/O patterns often observed in modern applications. This results in limited insights if not misleading information for end-users. The community has reacted by developing more sophisticated measurement tools and methodology, the most preeminent effort at the moment is the emerging IO500 benchmark. In this paper, we investigate the impact of the I/O access patterns on parallel file systems. Starting with the IO500 benchmark, the measurements demonstrate how specific patterns can be handled safely by some file systems, while at the opposite impact dramatically performance on others.","PeriodicalId":149243,"journal":{"name":"2019 IEEE 27th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115519097","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 Queuing Model of a Stream-Processing Server 流处理服务器的排队模型
Thomas Cooper, P. Ezhilchelvan, I. Mitrani
{"title":"A Queuing Model of a Stream-Processing Server","authors":"Thomas Cooper, P. Ezhilchelvan, I. Mitrani","doi":"10.1109/MASCOTS.2019.00014","DOIUrl":"https://doi.org/10.1109/MASCOTS.2019.00014","url":null,"abstract":"A stream-processing server model consisting of an external queue and an internal queue, with instantaneous or non-instantaneous transfers between the two, is analysed in the steady state. Jobs are collected into batches of fixed size prior to being transferred, but there is also a timer mechanism that may preempt such a collection. Exact and approximate solutions are obtained. These are used in order to evaluate the trade-offs between holding costs and transfer costs. The results of several numerical experiments are presented.","PeriodicalId":149243,"journal":{"name":"2019 IEEE 27th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116825794","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
Thing in, a research platform for the Web of Things Thing in,物联网研究平台
Sylvie Derrien, Pierre Meye, Phillippe Raipin
{"title":"Thing in, a research platform for the Web of Things","authors":"Sylvie Derrien, Pierre Meye, Phillippe Raipin","doi":"10.1109/MASCOTS.2019.00056","DOIUrl":"https://doi.org/10.1109/MASCOTS.2019.00056","url":null,"abstract":"Thing in is a research platform built by Orange to experiment the Web of Things. The heart of the platform consists of an object graph knowledge database. Each vertex of this graph is the representation of a connected object or an object giving information on the context in which a connected object evolves. Each edge gives information about the relation between two objects (e.g. within, owned by, adjacent to, etc.). This graph is not only shaped by the quantity but also to the diversity of information provided to the emerging IoT applications. In order to do so, Thing in relies on a strong coupling of graphbased database technologies with semantic technologies. Hence, the Thing in platform makes possible to cross heterogeneous information from billions of objects and to multiply the top use cases.","PeriodicalId":149243,"journal":{"name":"2019 IEEE 27th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116178920","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
Orchestrating Android Malware Experiments 策划Android恶意软件实验
Jean-François Lalande, Pierre Graux, Tomás Concepción Miranda
{"title":"Orchestrating Android Malware Experiments","authors":"Jean-François Lalande, Pierre Graux, Tomás Concepción Miranda","doi":"10.1109/MASCOTS.2019.00057","DOIUrl":"https://doi.org/10.1109/MASCOTS.2019.00057","url":null,"abstract":"Experimenting with Android malware requires to manipulate a large amount of samples and to chain multiple analyses. Scripting such a sequence of analyses on a large malware dataset becomes a challenge: the analysis has to handle fails on the computer and crashes on the used smartphone, in case of dynamic analyses. We present a new tool, PyMaO, for handling such experiments on a regular desktop PC with the highest performance throughput. PyMaO helps to write sequences of analyses and handle partial experiments that should be restarted after a crash or continued with new unknown analyses. The tool also offers a post processing capability for generating number tables or bar graphs from the analyzed datasets.","PeriodicalId":149243,"journal":{"name":"2019 IEEE 27th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133950905","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
Optimal Markovian Dynamic Control of Interference-Prone Server Farms 易受干扰服务器群的最优马尔可夫动态控制
Scott Votke, J. A. Jaleel, Amoghavarsha Suresh, Mohammad Delasay, Sherwin Doroudi, Anshul Gandhi
{"title":"Optimal Markovian Dynamic Control of Interference-Prone Server Farms","authors":"Scott Votke, J. A. Jaleel, Amoghavarsha Suresh, Mohammad Delasay, Sherwin Doroudi, Anshul Gandhi","doi":"10.1109/MASCOTS.2019.00041","DOIUrl":"https://doi.org/10.1109/MASCOTS.2019.00041","url":null,"abstract":"Interference is a key performance challenge faced by cloud users, and can significantly degrade application performance on virtual machines (VMs). For load-balanced cloud applications, a key question is how to distribute the load among VMs in the presence of interference. Using a Markov decision process (MDP) model, we investigate dynamic control polices to assign jobs among a cluster of VMs that are prone to interference in a system with a central queue and an arbitrary number of VMs. We characterize the structural properties of the MDP optimality equation, and we prove that the optimal control policy is a threshold policy based on the queue length. The optimal policy is characterized by multiple thresholds depending on the current conditions of the VMs, including the number of busy under-interference VMs. We discuss the existence of an ordering among such thresholds, and we prove the ordering for a two-VM system. Our numerical results show that the optimal dynamic policy can significantly improve performance compared to the the commonly employed non-idling policy. For low utilization systems, we observe improvements on the order of around 20%. We further implement the optimal policy in a real-world testbed using the HAProxy load balancer, and show that it can reduce web server response times by as much as 40%–60%, even for time-varying request rates.","PeriodicalId":149243,"journal":{"name":"2019 IEEE 27th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130825378","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
Profiling the Usage of an Extreme-Scale Archival Storage System 分析超大规模档案存储系统的使用情况
Hyogi Sim, Sudharshan S. Vazhkudai
{"title":"Profiling the Usage of an Extreme-Scale Archival Storage System","authors":"Hyogi Sim, Sudharshan S. Vazhkudai","doi":"10.1109/MASCOTS.2019.00050","DOIUrl":"https://doi.org/10.1109/MASCOTS.2019.00050","url":null,"abstract":"Profiling the archival storage system in scientific computing environments has received much less attention compared to the parallel file system, but is equally important since it stores the final data products safely, for a long duration. In this paper, we analyze eight years worth of data transfer logs for accessing the archival file system (HPSS) in the Oak Ridge Leadership Computing Facility (OLCF), which has been hosting the world's largest supercomputers and file systems. Our analysis encompasses about 135 million data transfer activities to the 80 PB High Performance Storage System (HPSS), between 2010 and 2017. We analyze the logs from several dimensions, including studying the workload characteristics (e.g., access patterns, frequency of accesses and temporal behavior), file system characteristics (e.g., directory depth, file system scaling trends, file types), and scientific user behavior (e.g., domain-specific usage and organization). Based on the analysis, we derive insights into the future evolution of the archive in terms of provisioning, desired features and functionality from the archive software, role and right sizing of the archive tiers, quota management, and the importance of smart and efficient metadata and storage management. We believe our study will prove useful for both operating current archival storage and better provisioning future systems.","PeriodicalId":149243,"journal":{"name":"2019 IEEE 27th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132890219","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
Application-Aware Adaptive Partitioning for Graph Processing Systems 面向应用的图形处理系统自适应分区
E. L. Merrer, Gilles Trédan
{"title":"Application-Aware Adaptive Partitioning for Graph Processing Systems","authors":"E. L. Merrer, Gilles Trédan","doi":"10.1109/MASCOTS.2019.00033","DOIUrl":"https://doi.org/10.1109/MASCOTS.2019.00033","url":null,"abstract":"Modern online applications value real-time queries over fresh data models. This is the case for graph-based applications, such as social networking or recommender systems, running on front-end servers in production. A core problem in graph processing systems is the efficient partitioning of the input graph over multiple workers. Recent advances over Bulk Synchronous Parallel processing systems (BSP) enabled computations over partitions on those workers, independently of global synchronization supersteps. A good objective partitioning makes the understanding of the load balancing and communication trade-off mandatory for performance improvement. This short paper addresses this trade-off through the proposal of an optimization problem, that is to be solved continuously to avoid performance degradation over time. Our simulations show that the design of the software module we propose yields significant performance improvements over the BSP processing model.","PeriodicalId":149243,"journal":{"name":"2019 IEEE 27th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127525530","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
Unicast Inference of Additive Metrics in General Network Topologies 一般网络拓扑中可加度量的单播推理
M. Rahali, Jean-Michel Sanner, G. Rubino
{"title":"Unicast Inference of Additive Metrics in General Network Topologies","authors":"M. Rahali, Jean-Michel Sanner, G. Rubino","doi":"10.1109/MASCOTS.2019.00021","DOIUrl":"https://doi.org/10.1109/MASCOTS.2019.00021","url":null,"abstract":"Internet tomography studies the inference of the internal network performances from end-to-end measurements. Unicast probing can be advantageous for such monitoring solutions due to the wide support of unicast and the easy deployment of unicast probing paths. In this work, we propose two statistical generic methods for the inference of additive metrics using unicast probing. Our solutions give more flexibility in the choice of the collection points placement, the probed paths and they are not limited to specific topologies. Firstly, we propose the k-paths method that extends the applicability of a previously proposed solution called Flexicast for tree topologies. It is based on the Expectation-Maximization (EM) algorithm which is characterized by high computational and memory complexities. Secondly, we propose the Evolutionary Sampling Algorithm (ESA) that enhances the accuracy and the computing time but following a different approach.","PeriodicalId":149243,"journal":{"name":"2019 IEEE 27th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127169918","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
HyperMapper: a Practical Design Space Exploration Framework HyperMapper:一个实用的设计空间探索框架
Luigi Nardi, Artur L. F. Souza, D. Koeplinger, K. Olukotun
{"title":"HyperMapper: a Practical Design Space Exploration Framework","authors":"Luigi Nardi, Artur L. F. Souza, D. Koeplinger, K. Olukotun","doi":"10.1109/MASCOTS.2019.00053","DOIUrl":"https://doi.org/10.1109/MASCOTS.2019.00053","url":null,"abstract":"Design problems are ubiquitous in scientific and industrial achievements. Scientists design experiments to gain insights into physical and social phenomena, and engineers design machines to execute tasks more efficiently. These design problems are fraught with choices which are often complex and highdimensional and which include interactions that make them difficult for individuals to reason about. In software/hardware co-design, for example, companies develop libraries with tens or hundreds of free choices and parameters that interact in complex ways. In fact, the level of complexity is often so high that it becomes impossible to find domain experts capable of tuning these libraries [1].","PeriodicalId":149243,"journal":{"name":"2019 IEEE 27th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132726419","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}
引用次数: 17
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学术官方微信
小红书