2011 31st International Conference on Distributed Computing Systems Workshops最新文献_第3页

A Geometric Approach to Robustness in Complex Networks 复杂网络鲁棒性的几何方法

2011 31st International Conference on Distributed Computing Systems Workshops Pub Date : 2011-06-20 DOI: 10.1109/ICDCSW.2011.18

Gyan Ranjan, Zhi-Li Zhang

引用次数: 7

Multi-dimensional Resource Integrated Scheduling in a Shared Data Center 共享数据中心的多维资源集成调度

2011 31st International Conference on Distributed Computing Systems Workshops Pub Date : 2011-06-20 DOI: 10.1109/ICDCSW.2011.27

Xin Sun, Sen Su, Peng Xu, S. Chi, Yan Luo

引用次数: 18

Exploiting Resource Usage Patterns for Better Utilization Prediction 利用资源使用模式进行更好的利用预测

2011 31st International Conference on Distributed Computing Systems Workshops Pub Date : 2011-06-20 DOI: 10.1109/ICDCSW.2011.53

Jian Tan, Parijat Dube, Xiaoqiao Meng, Li Zhang

{"title":"Exploiting Resource Usage Patterns for Better Utilization Prediction","authors":"Jian Tan, Parijat Dube, Xiaoqiao Meng, Li Zhang","doi":"10.1109/ICDCSW.2011.53","DOIUrl":"https://doi.org/10.1109/ICDCSW.2011.53","url":null,"abstract":"Understanding the resource utilization in computing clouds is critical for efficient resource planning and better operational performance. In this paper, we propose two ways, from microscopic and macroscopic perspectives, to predict the resource consumption for data centers by statistically characterizing resource usage patterns. The first approach focuses on the usage prediction for a specific node. Compared to the basic method of calibrating AR models for CPU usages separately, we find that using both CPU and memory usage data can improve the forecasting performance. The second approach is based on Principal Component Analysis (PCA) to identify resource usage patterns across different nodes. Using the identified patterns, we can reduce the number of parameters for predicting the resource usage on multiple nodes. In addition, using the principal components obtained from PCA, we propose an optimization framework to optimally consolidate VMs into a number of physical servers and in the meanwhile reduce the resource usage variability. The evaluation of the proposed approaches is based on traces collected from a production cloud environment.","PeriodicalId":133514,"journal":{"name":"2011 31st International Conference on Distributed Computing Systems Workshops","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125694031","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}

引用次数: 34

k-clique Communities in the Internet AS-level Topology Graph Internet as级拓扑图中的k-clique团体

2011 31st International Conference on Distributed Computing Systems Workshops Pub Date : 2011-06-20 DOI: 10.1109/ICDCSW.2011.17

E. Gregori, L. Lenzini, Chiara Orsini

{"title":"k-clique Communities in the Internet AS-level Topology Graph","authors":"E. Gregori, L. Lenzini, Chiara Orsini","doi":"10.1109/ICDCSW.2011.17","DOIUrl":"https://doi.org/10.1109/ICDCSW.2011.17","url":null,"abstract":"A significant challenge for researchers analysing the Internet AS-level topology graph is how to interpret the global organization of the graph as the coexistence of its structural blocks (communities) associated with more highly interconnected parts. While a huge number of papers have already been published on the issue of community detection, very little attention has so far been devoted to the discovery and interpretation of Internet communities at the various levels of abstractions (e.g. Autonomous System level, Point of Presence level). We believe that by discovering and interpreting a priori these unknown building blocks (i.e. communities), this will then pave the way for new types of analysis which are crucial in understanding of the structural and functional properties of the Internet at least at the AS level of abstraction. We thus propose a novel type of analysis of the Internet AS-level topology graph by exploiting the k-clique community definition. First, we show that detected communities can be described by a tree representation. Then we show the presence of two classes of k-clique communities: those that are strictly affected by the nesting process which is embedded in the k-clique community definition, and, on the other hand, those that appear as branches in the tree. We conclude our analysis by highlighting the properties that characterize k-clique communities with different k values by exploiting both geographical data and information related to Internet exchange Points (IXPs).","PeriodicalId":133514,"journal":{"name":"2011 31st International Conference on Distributed Computing Systems Workshops","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131654018","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}

引用次数: 15

An Efficient Multi-path Data Collection Scheme in Wireless Sensor Networks 无线传感器网络中一种高效的多路径数据采集方案

2011 31st International Conference on Distributed Computing Systems Workshops Pub Date : 2011-06-20 DOI: 10.1109/ICDCSW.2011.22

H. V. Luu, Xueyan Tang

引用次数: 9

DC-PET: A System for Data Center Performance Estimation DC-PET:数据中心性能评估系统

2011 31st International Conference on Distributed Computing Systems Workshops Pub Date : 2011-06-20 DOI: 10.1109/ICDCSW.2011.28

P. Hasselmeyer, Nico d'Heureuse

引用次数: 0

Transmission Rate Enhancement of Cooperative Communications in Wireless Networks 无线网络中协同通信传输速率的提高

2011 31st International Conference on Distributed Computing Systems Workshops Pub Date : 2011-06-20 DOI: 10.1109/ICDCSW.2011.56

Xiaoyan Wang, Jie Li, Kui Wu

引用次数: 3

Maximizing Profit in Cloud Computing System via Resource Allocation 通过资源分配实现云计算系统利润最大化

2011 31st International Conference on Distributed Computing Systems Workshops Pub Date : 2011-06-20 DOI: 10.1109/ICDCSW.2011.52

H. Goudarzi, Massoud Pedram

引用次数: 91

SHHC: A Scalable Hybrid Hash Cluster for Cloud Backup Services in Data Centers SHHC:用于数据中心云备份服务的可扩展混合哈希集群

2011 31st International Conference on Distributed Computing Systems Workshops Pub Date : 2011-06-20 DOI: 10.1109/ICDCSW.2011.31

Lei Xu, Jian Hu, S. Mkandawire, Hong Jiang

引用次数: 20

PARSE 2.0: A Tool for Parallel Application Run Time Behavior Evaluation PARSE 2.0:一个并行应用程序运行时行为评估工具

2011 31st International Conference on Distributed Computing Systems Workshops Pub Date : 2011-06-20 DOI: 10.1109/ICDCSW.2011.37

Jeffrey J. Evans, C. E. Lucas

{"title":"PARSE 2.0: A Tool for Parallel Application Run Time Behavior Evaluation","authors":"Jeffrey J. Evans, C. E. Lucas","doi":"10.1109/ICDCSW.2011.37","DOIUrl":"https://doi.org/10.1109/ICDCSW.2011.37","url":null,"abstract":"Run time variability of parallel applications continues to be a significant challenge in high performance computing (HPC) systems. We are currently studying run time variability in the context of both systemic performance and energy management. Our perspective is from that of the application, focusing on the interactions of the inter-process communication system on the set of concurrently executing parallel applications. In such a scenario, application run time can be extended and become highly variable. While some applications may be more sensitive to these interactions, others may in fact be generating the interactions that cause inconsistent run time, thus forming the notion of application-level behavioral attributes. To gain insight into this problem, our earlier work developed a framework that emulates parallel applications, called PACE. We also introduced a Parallel Application Run time Sensitivity Evaluation (PARSE) function that uses the PACE framework to study the run time effects of controlled network performance degradation on applications. Inter-process communication has evolved over the last decade from network communication between single-processor, single-core nodes to hybrid systems whose compute nodes contain several multi-core processor units. Motivated by the evolution of compute hardware and systems software, this work introduces PARSE 2.0, which is a nearly complete re-write that extends PARSE capabilities to include fully automating the processes of evaluating and quantifying run time critical parallel application-level behavioral attributes. We present an overview of the tool and the attributes being evaluated, and present experimental results from tests conducted on several widely used parallel benchmarks and application code fragments. The results re-enforce our earlier work, demonstrating that parallel applications can be classified according to their behavioral attributes, in the context of communication system resources.","PeriodicalId":133514,"journal":{"name":"2011 31st International Conference on Distributed Computing Systems Workshops","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114122798","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