2011 11th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing最新文献

Non-cooperative Scheduling Considered Harmful in Collaborative Volunteer Computing Environments 协同志愿计算环境中被认为有害的非合作调度

2011 11th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing Pub Date : 2011-05-23 DOI: 10.1109/CCGrid.2011.34

Bruno Donassolo, Arnaud Legrand, Cl'udio Geyer

{"title":"Non-cooperative Scheduling Considered Harmful in Collaborative Volunteer Computing Environments","authors":"Bruno Donassolo, Arnaud Legrand, Cl'udio Geyer","doi":"10.1109/CCGrid.2011.34","DOIUrl":"https://doi.org/10.1109/CCGrid.2011.34","url":null,"abstract":"Advances in inter-networking technology and computing components have enabled Volunteer Computing (VC) systems that allows volunteers to donate their computers' idle CPU cycles to a given project. BOINC is the most popular VC infrastructure today with over 580,000 hosts that deliver over 2,300 TeraFLOP per day. BOINC projects usually have hundreds of thousands of independent tasks and are interested in overall throughput. Each project has its own server which is responsible for distributing work units to clients, recovering results and validating them. The BOINC scheduling algorithms are complex and have been used for many years now. Their efficiency and fairness have been assessed in the context of throughput oriented projects. Yet, recently, burst projects, with fewer tasks and interested in response time, have emerged. Many works have proposed new scheduling algorithms to optimize individual response time but their use may be problematic in presence of other projects. In this article we show that the commonly used BOINC scheduling algorithms are unable to enforce fairness and project isolation. Burst projects may dramatically impact the performance of all other projects (burst or non-burst). To study such interactions, we perform a detailed, multi-player and multi-objective game theoretic study. Our analysis and experiments provide a good understanding on the impact of the different scheduling parameters and show that the non-cooperative optimization may result in inefficient and unfair share of the resources.","PeriodicalId":376385,"journal":{"name":"2011 11th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing","volume":"162 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115999148","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

Resource and Revenue Sharing with Coalition Formation of Cloud Providers: Game Theoretic Approach 云供应商联盟形成中的资源和收益共享:博弈论方法

2011 11th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing Pub Date : 2011-05-23 DOI: 10.1109/CCGrid.2011.30

D. Niyato, A. Vasilakos, K. Zhu

{"title":"Resource and Revenue Sharing with Coalition Formation of Cloud Providers: Game Theoretic Approach","authors":"D. Niyato, A. Vasilakos, K. Zhu","doi":"10.1109/CCGrid.2011.30","DOIUrl":"https://doi.org/10.1109/CCGrid.2011.30","url":null,"abstract":"In cloud computing, multiple cloud providers can cooperate to establish a resource pool to support internal users and to offer services to public cloud users. In this paper, we study the cooperative behavior of multiple cloud providers. The hierarchical cooperative game model is presented. First, given a group (i.e., coalition) of cloud providers, the resource and revenue sharing of a resource pool is presented. To obtain the solution, we develop the stochastic linear programming game model which takes the uncertainty of internal users from each provider into account. We show that the solution of the stochastic linear programming game is the core of cooperation. Second, we analyze the stability of the coalition formation among cloud providers based on coalitional game. The dynamic model of coalition formation is used to obtain stable coalitional structures. The resource and revenue sharing and coalition formation of cloud providers are intertwined in which the proposed hierarchical cooperative game model can be used to obtain the solution. An extensive performance evaluation is performed to investigate the decision making of cloud providers when cooperation can lead to the higher profit.","PeriodicalId":376385,"journal":{"name":"2011 11th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114418190","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}

引用次数: 157

A Robust Communication Framework for Parallel Execution on Volunteer PC Grids 志愿PC网格并行执行的鲁棒通信框架

2011 11th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing Pub Date : 2011-05-23 DOI: 10.1109/CCGrid.2011.72

Eshwar Rohit, Hien Nguyen, N. Kanna, J. Subhlok, E. Gabriel, Qian Wang, M. Cheung, David P. Anderson

{"title":"A Robust Communication Framework for Parallel Execution on Volunteer PC Grids","authors":"Eshwar Rohit, Hien Nguyen, N. Kanna, J. Subhlok, E. Gabriel, Qian Wang, M. Cheung, David P. Anderson","doi":"10.1109/CCGrid.2011.72","DOIUrl":"https://doi.org/10.1109/CCGrid.2011.72","url":null,"abstract":"Volunteer PC grids represent massive computation capacity at a low cost, but are challenging to employ for parallel computing because of variable and unpredictable performance and availability. A communicating parallel program must employ explicit redundancy, or implicit redundancy with uncoordinated checkpoint-restart to make continuous forward progress in such an unreliable environment. A communication model based on one-sided Put/Get calls to an abstract global shared space is a good match as processes can execute their communication operations independently and asynchronously. However, no existing system is designed for redundant communicating processes. The key problem is that a single logical operation that impacts the global program state may be executed by different instances of the same process at different times leading to semantic inconsistency. This paper presents the design, execution model, implementation, and usage of {em Volpex}, a communication layer for robust execution on volunteer PC grids. The research leads to a practical way to employ idle PCs for latency tolerant parallel computing applications.","PeriodicalId":376385,"journal":{"name":"2011 11th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125578717","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

Inferring Network Topologies in Infrastructure as a Service Cloud 基础设施即服务云中的网络拓扑推断

2011 11th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing Pub Date : 2011-05-23 DOI: 10.1109/CCGrid.2011.79

Dominic Battré, Natalia Frejnik, Siddhant Goel, O. Kao, Daniel Warneke

引用次数: 3

Utilizing "Opaque" Resources for Revenue Enhancement on Clouds and Grids 利用“不透明”资源在云和网格上提高收益

2011 11th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing Pub Date : 2011-05-23 DOI: 10.1109/CCGrid.2011.58

Jose Orlando Melendez, S. Majumdar

引用次数: 1

A Scalable Method for Signalling Dynamic Reconfiguration Events with OpenSM OpenSM动态重配置事件信令的可伸缩方法

2011 11th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing Pub Date : 2011-05-23 DOI: 10.1109/CCGrid.2011.48

Wei Lin Guay, Sven-Arne Reinemo

引用次数: 3

Autonomic SLA-Driven Provisioning for Cloud Applications 云应用程序的自主sla驱动配置

2011 11th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing Pub Date : 2011-05-23 DOI: 10.1109/CCGrid.2011.24

N. Bonvin, Thanasis G. Papaioannou, K. Aberer

{"title":"Autonomic SLA-Driven Provisioning for Cloud Applications","authors":"N. Bonvin, Thanasis G. Papaioannou, K. Aberer","doi":"10.1109/CCGrid.2011.24","DOIUrl":"https://doi.org/10.1109/CCGrid.2011.24","url":null,"abstract":"Significant achievements have been made for automated allocation of cloud resources. However, the performance of applications may be poor in peak load periods, unless their cloud resources are dynamically adjusted. Moreover, although cloud resources dedicated to different applications are virtually isolated, performance fluctuations do occur because of resource sharing, and software or hardware failures (e.g. unstable virtual machines, power outages, etc.). In this paper, we propose a decentralized economic approach for dynamically adapting the cloud resources of various applications, so as to statistically meet their SLA performance and availability goals in the presence of varying loads or failures. According to our approach, the dynamic economic fitness of a Web service determines whether it is replicated or migrated to another server, or deleted. The economic fitness of a Web service depends on its individual performance constraints, its load, and the utilization of the resources where it resides. Cascading performance objectives are dynamically calculated for individual tasks in the application workflow according to the user requirements. By fully implementing our framework, we experimentally proved that our adaptive approach statistically meets the performance objectives under peak load periods or failures, as opposed to static resource settings.","PeriodicalId":376385,"journal":{"name":"2011 11th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128236985","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}

引用次数: 98

On the Scheduling of Checkpoints in Desktop Grids 桌面网格中检查点的调度研究

2011 11th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing Pub Date : 2011-05-23 DOI: 10.1109/CCGrid.2011.63

M. Bouguerra, Derrick Kondo, D. Trystram

引用次数: 35

Self-Healing Distributed Scheduling Platform 自修复分布式调度平台

2011 11th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing Pub Date : 2011-05-23 DOI: 10.1109/CCGrid.2011.23

M. Frîncu, Norha M. Villegas, D. Petcu, H. Müller, Romain Rouvoy

引用次数: 18

Performance under Failures of MapReduce Applications MapReduce应用故障情况下的性能

2011 11th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing Pub Date : 2011-05-23 DOI: 10.1109/CCGrid.2011.84

Hui Jin, Kan Qiao, Xian-He Sun, Ying Li

引用次数: 32