2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid最新文献_第2页

PAIS: A Proximity-Aware Interest-Clustered P2P File Sharing System 一个邻近感知的兴趣集群P2P文件共享系统

2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid Pub Date : 2009-05-18 DOI: 10.1109/CCGRID.2009.17

Haiying Shen

引用次数: 3

The Eucalyptus Open-Source Cloud-Computing System Eucalyptus开源云计算系统

2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid Pub Date : 2009-05-18 DOI: 10.1109/CCGRID.2009.93

Daniel Nurmi, R. Wolski, Chris Grzegorczyk, Graziano Obertelli, Sunil Soman, Lamia Youseff, D. Zagorodnov

{"title":"The Eucalyptus Open-Source Cloud-Computing System","authors":"Daniel Nurmi, R. Wolski, Chris Grzegorczyk, Graziano Obertelli, Sunil Soman, Lamia Youseff, D. Zagorodnov","doi":"10.1109/CCGRID.2009.93","DOIUrl":"https://doi.org/10.1109/CCGRID.2009.93","url":null,"abstract":"Cloud computing systems fundamentally provide access to large pools of data and computational resources through a variety of interfaces similar in spirit to existing grid and HPC resource management and programming systems. These types of systems offer a new programming target for scalable application developers and have gained popularity over the past few years. However, most cloud computing systems in operation today are proprietary, rely upon infrastructure that is invisible to the research community, or are not explicitly designed to be instrumented and modified by systems researchers. In this work, we present Eucalyptus -- an open-source software framework for cloud computing that implements what is commonly referred to as Infrastructure as a Service (IaaS); systems that give users the ability to run and control entire virtual machine instances deployed across a variety physical resources. We outline the basic principles of the Eucalyptus design, detail important operational aspects of the system, and discuss architectural trade-offs that we have made in order to allow Eucalyptus to be portable, modular and simple to use on infrastructure commonly found within academic settings. Finally, we provide evidence that Eucalyptus enables users familiar with existing Grid and HPC systems to explore new cloud computing functionality while maintaining access to existing, familiar application development software and Grid middle-ware.","PeriodicalId":118263,"journal":{"name":"2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133979204","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}

引用次数: 2069

Collusion Detection for Grid Computing 网格计算中的合谋检测

2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid Pub Date : 2009-05-18 DOI: 10.1109/CCGRID.2009.12

Eugen Staab, T. Engel

引用次数: 31

Using Templates to Predict Execution Time of Scientific Workflow Applications in the Grid 用模板预测网格中科学工作流应用程序的执行时间

2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid Pub Date : 2009-05-18 DOI: 10.1109/CCGRID.2009.77

F. Nadeem, T. Fahringer

引用次数: 46

Resource Allocation Using Virtual Clusters 使用虚拟集群分配资源

2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid Pub Date : 2009-05-18 DOI: 10.1109/CCGRID.2009.23

Mark Stillwell, D. Schanzenbach, F. Vivien, H. Casanova

引用次数: 86

Efficient Grid Task-Bundle Allocation Using Bargaining Based Self-Adaptive Auction 基于议价自适应拍卖的高效网格任务包分配

2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid Pub Date : 2009-05-18 DOI: 10.1109/CCGRID.2009.86

Han Zhao, Xiaolin Li

引用次数: 22

Flexible and Efficient In-Vivo Enhancement for Grid Applications 网格应用灵活高效的活体增强

2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid Pub Date : 2009-05-18 DOI: 10.1109/CCGRID.2009.61

Dong Kwan Kim, Yang Jiao, E. Tilevich

{"title":"Flexible and Efficient In-Vivo Enhancement for Grid Applications","authors":"Dong Kwan Kim, Yang Jiao, E. Tilevich","doi":"10.1109/CCGRID.2009.61","DOIUrl":"https://doi.org/10.1109/CCGRID.2009.61","url":null,"abstract":"In a grid application, some requirements may change while the execution is in progress. This paper presents in-vivo enhancement--updating running grid applications to facilitate their perfective maintenance. Because applications in this domain are not only typically long-running, but also time-consuming to deploy, we propose a dynamic update technique that can change a running application flexibly and efficiently. Specifically, this paper presents a novel technique for dynamically updating grid applications deployed on the Java Virtual Machine (JVM). Our technique overcomes constraints of JVM HotSwap, a facility for replacing classes at runtime. While HotSwap precludes the programmer from adding new methods and fields, changing the signatures of existing methods, and has no support for transferring state between old and new objects, our approach effectively removes these constraints by rewriting program bytecode. Further, the rewritten programs incur only minimal performance overhead (less than 2% on average). We demonstrate the efficiency and extensibility of our approach through micro and macro benchmarks, as well as through a case study of dynamically updating a parallel bioinformatics application.","PeriodicalId":118263,"journal":{"name":"2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126071526","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}

引用次数: 7

Performance Issues in Parallelizing Data-Intensive Applications on a Multi-core Cluster 在多核集群上并行处理数据密集型应用程序的性能问题

2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid Pub Date : 2009-05-18 DOI: 10.1109/CCGRID.2009.83

Vignesh T. Ravi, G. Agrawal

引用次数: 23

BloomCast: Efficient Full-Text Retrieval over Unstructured P2Ps with Guaranteed Recall 高效全文检索与保证召回的非结构化p2p

2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid Pub Date : 2009-05-18 DOI: 10.1109/CCGRID.2009.50

Hanhua Chen, Hai Jin, Xucheng Luo, Yunhao Liu, L. Ni

{"title":"BloomCast: Efficient Full-Text Retrieval over Unstructured P2Ps with Guaranteed Recall","authors":"Hanhua Chen, Hai Jin, Xucheng Luo, Yunhao Liu, L. Ni","doi":"10.1109/CCGRID.2009.50","DOIUrl":"https://doi.org/10.1109/CCGRID.2009.50","url":null,"abstract":"Efficient and effective full-text retrieval in unstructured peer-to-peer networks remains a challenge in the research community. First, it is difficult, if not impossible, for unstructured P2P search protocols to effectively locate items with guaranteed recall rate. Second, existing schemes to improve search successful rate often rely on replicating a large number of item replicas across the wide area network, incurring a large amount of communication and storage cost. In this paper we propose BloomCast, an efficient and effective full-text retrieval scheme, in unstructured P2P networks. BloomCast is effective because it guarantees perfect recall rate with high probability. It is efficient because the overall communication cost of full-text search is reduced below a formal bound. Furthermore, by casting Bloom Filters instead of the raw documents across the network, BloomCast significantly reduces the communication cost and storage cost for replication. We demonstrate the power of BloomCast design through both mathematical proof and comprehensive simulations. Results show that BloomCast outperforms existing schemes in terms of both recall rate and communication cost.","PeriodicalId":118263,"journal":{"name":"2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127214586","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}

引用次数: 3

Modeling Job Arrival Process with Long Range Dependence and Burstiness Characteristics 具有长距离依赖性和突发性特征的工作到达过程建模

2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid Pub Date : 2009-05-18 DOI: 10.1109/CCGRID.2009.35

T. Minh, L. Wolters

{"title":"Modeling Job Arrival Process with Long Range Dependence and Burstiness Characteristics","authors":"T. Minh, L. Wolters","doi":"10.1109/CCGRID.2009.35","DOIUrl":"https://doi.org/10.1109/CCGRID.2009.35","url":null,"abstract":"Workload modeling plays a significant role in performance evaluation of large-scale parallel systems such as clusters and grids. It helps to generate synthetic workloads which capture some dominant characteristics of traces (real workloads). Modeling job arrival process is an essential part of workload modeling. Although a job arrival process has many important characteristics such as long range dependence (LRD) and burstiness, most researchers, for simplicity, assume it as a poisson process in their evaluation work. Furthermore, there is currently almost no research focusing on both LRD and burstiness at the same time according to our investigation. With respect to this research trend, the multifractal wavelet model (MWM) recently has been introduced as a good choice to yield LRD for a job arrival process. Though LRD is well controlled, we observe that a job arrival process produced by MWM does not keep burstiness. In this paper, we present our study on modifying MWM so that not only LRD but also burstiness are kept in the job arrival process. In addition, our modification also fits the marginal distribution better than MWM.","PeriodicalId":118263,"journal":{"name":"2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125971624","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}

引用次数: 13