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

筛选
英文 中文
Online Storage and Content Distribution System at a Large Scale: Peer-Assistance and Beyond 大规模在线存储和内容分发系统:同侪协助及超越
2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid Pub Date : 2009-05-18 DOI: 10.1109/CCGRID.2009.99
B. Li
{"title":"Online Storage and Content Distribution System at a Large Scale: Peer-Assistance and Beyond","authors":"B. Li","doi":"10.1109/CCGRID.2009.99","DOIUrl":"https://doi.org/10.1109/CCGRID.2009.99","url":null,"abstract":"Online storage and content distribution systems within the “cloud” of the Internet have provided a wide variety of services ranging from file sharing, software downloads, to stored or live video streaming, to a large community. With the increasing popularity of such systems, however, server and bandwidth costs have become prohibitively expensive, as files are hosted in either content distribution networks or dedicated large data centers. Rapidshare, one of the most well-known one-click hosting systems, deployed a total of 1500 Terabytes of online storage in its data centers, in Asia alone. Skyrocketing bandwidth costs from server-based architectures have made it necessary for all online content distribution systems that remain free of charge to impose certain restrictions, including download bandwidth limits per day, file size limitations, as well as maximum file online available time. Though it seems natural to take advantage of peer bandwidth contributions to mitigate server bandwidth costs, it is nevertheless non-trivial to design a completely new system that utilizes peer bandwidth contributions in a complementary fashion without sacrificing the ease of use, reliability, and performance of one-click hosting.","PeriodicalId":118263,"journal":{"name":"2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid","volume":"13 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":"134401741","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 Skyline Approach to the Matchmaking Web Service 婚介网络服务的Skyline方法
2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid Pub Date : 2009-05-18 DOI: 10.1109/CCGRID.2009.62
Hyuck Han, Hyungsoo Jung, Shin-gyu Kim, H. Yeom
{"title":"A Skyline Approach to the Matchmaking Web Service","authors":"Hyuck Han, Hyungsoo Jung, Shin-gyu Kim, H. Yeom","doi":"10.1109/CCGRID.2009.62","DOIUrl":"https://doi.org/10.1109/CCGRID.2009.62","url":null,"abstract":"Item matchmaking that finds items for users is an essential service framework in the web service infrastructure. The current way of carrying out the matchmaking procedure is the selection of items based on a user's specifications. We rethink the item matchmaking framework in such a way that a matchmaker can find items that can satisfy a specific computing demand from a user and recommend a collection of better items candidates among the identified items. This endows a user with the right of choice on deciding best-possible items. We approach the problem in the view of skyline query processing that has become one of the major topics in the database community, and present the efficient skyline algorithm that gathers interesting item candidates efficiently. To this end, we adopt (i) lattice-based indexing using a lattice composition technique,and (ii) an optimized dominance-check algorithm. Our extensive experimental results show that our algorithm outperforms the current state-of-the-art algorithm.","PeriodicalId":118263,"journal":{"name":"2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid","volume":"13 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":"117110099","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
A Live Storage Migration Mechanism over WAN for Relocatable Virtual Machine Services on Clouds 云上可重定位虚拟机服务的WAN热存储迁移机制
2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid Pub Date : 2009-05-18 DOI: 10.1109/CCGRID.2009.44
Takahiro Hirofuchi, Hirotaka Ogawa, H. Nakada, S. Itoh, S. Sekiguchi
{"title":"A Live Storage Migration Mechanism over WAN for Relocatable Virtual Machine Services on Clouds","authors":"Takahiro Hirofuchi, Hirotaka Ogawa, H. Nakada, S. Itoh, S. Sekiguchi","doi":"10.1109/CCGRID.2009.44","DOIUrl":"https://doi.org/10.1109/CCGRID.2009.44","url":null,"abstract":"IaaS (Infrastructure-as-a-Service) is an emerging concept of cloud computing, which allows users to obtain hardware resources from virtualized data centers. Although many commercial IaaS clouds have recently been launched, dynamic virtual machine (VM) migration is not possible among service providers; users are locked into a particular provider, and cannot transparently relocate their VMs to another one for the best cost-effectiveness. In this paper, we propose an advanced storage access mechanism that strongly supports live VM migration over WAN. It rapidly relocates VM disks between source and destination sites with the minimum impact on I/O performance. The proposed mechanism addresses I/O consistency of virtual disks before/after migration, which is the major issue regarding wide-area live migration. The proposed mechanism works as a storage server of a block-level storage I/O protocol (e.g.,iSCSI and NBD). Two key techniques (on-demand fetching and background copying) move on-line virtual disks among remote sites, transparently and efficiently. Our prototype system works perfectly for Xen and KVM without any modification tothem. Experiments showed the prototype system also worked successfully for an emulated WAN environment.","PeriodicalId":118263,"journal":{"name":"2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid","volume":"113 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":"123958489","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}
引用次数: 113
GMount: An Ad Hoc and Locality-Aware Distributed File System by Using SSH and FUSE GMount:一个使用SSH和FUSE的Ad Hoc和位置感知分布式文件系统
2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid Pub Date : 2009-05-18 DOI: 10.1109/CCGRID.2009.72
N. Dun, K. Taura, A. Yonezawa
{"title":"GMount: An Ad Hoc and Locality-Aware Distributed File System by Using SSH and FUSE","authors":"N. Dun, K. Taura, A. Yonezawa","doi":"10.1109/CCGRID.2009.72","DOIUrl":"https://doi.org/10.1109/CCGRID.2009.72","url":null,"abstract":"Developing and deploying distributed file system has been important for the Grid computing. By GMount, non-privileged users can instantaneously and effortlessly build a distributed file system on arbitrary machines that are reachable via SSH. It is scalable to hundreds of nodes in the wide-area Grid environments and adapts to NAT/Firewall. Unlike conventional distributed file systems, GMount can directly harness local file systems of each node without importing/exporting application data and utilize the network topology to make the metadata operations locality-aware. In this paper, we present the design and implementation of GMount by using two popular modules: SSH and FUSE. We demonstrate its viability and locality-aware metadata operation performance in a large scale Grid with over 320 nodes spreading across 12 clusters that are connected by heterogeneous wide-area links.","PeriodicalId":118263,"journal":{"name":"2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid","volume":"32 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":"123981505","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
Dynamic and Distributed Multipath Routing Policy for High-Speed Cluster Networks 高速集群网络的动态分布式多路径路由策略
2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid Pub Date : 2009-05-18 DOI: 10.1109/CCGRID.2009.13
D. Lugones, Daniel Franco, E. Luque
{"title":"Dynamic and Distributed Multipath Routing Policy for High-Speed Cluster Networks","authors":"D. Lugones, Daniel Franco, E. Luque","doi":"10.1109/CCGRID.2009.13","DOIUrl":"https://doi.org/10.1109/CCGRID.2009.13","url":null,"abstract":"The increasing demand of parallel applications in Cluster Computing requires the use of Interconnection Networksto provide low and bounded communication delays. However, message congestion appears when communication load between nodes is not fairly distributed over the network. Congestion spreading increases latency and reduces network throughput causing important performance degradation. In this paper we present Dynamic Routing Balancing with Multipath Distribution (DRB-MD), a new method developed to control network congestion based on a uniform balancing of communication load. DRB-MD distributes the traffic load according to a gradual and load-controlled path expansion. It monitors message latency in network switches, makes decisions about how many alternative paths should be used, and finally decides which path (or paths) to use between each source-destination pair. Experiments with permutation patterns and hotspot traffic were conducted to evaluate DRB-MD performance under conditions commonly created by parallel scientific applications.","PeriodicalId":118263,"journal":{"name":"2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid","volume":"63 11 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":"116444442","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
Latency Hiding File I/O for Blue Gene Systems 延迟隐藏文件I/O的蓝色基因系统
2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid Pub Date : 2009-05-18 DOI: 10.1109/CCGRID.2009.49
Florin Isaila, Francisco Javier García Blas, J. Carretero, R. Latham, S. Lang, R. Ross
{"title":"Latency Hiding File I/O for Blue Gene Systems","authors":"Florin Isaila, Francisco Javier García Blas, J. Carretero, R. Latham, S. Lang, R. Ross","doi":"10.1109/CCGRID.2009.49","DOIUrl":"https://doi.org/10.1109/CCGRID.2009.49","url":null,"abstract":"This paper presents the design and implementation of a novel file I/O solution for Blue Gene systems. We propose a hierarchical I/O cache architecture based on open source software. Our solution is based on an asynchronous data staging strategy, which hides the latency of file system access from compute nodes. The performance results demonstrate the high scalability and significant performance improvements of our architecture over existing solutions.","PeriodicalId":118263,"journal":{"name":"2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid","volume":"185 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":"123009475","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
Towards a Virtual Research Environment for Paediatric Endocrinology across Europe 迈向整个欧洲儿科内分泌学的虚拟研究环境
2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid Pub Date : 2009-05-18 DOI: 10.1109/CCGRID.2009.68
Jipu Jiang, R. Sinnott, A. Stell, J. Watt, Faisal Ahmed
{"title":"Towards a Virtual Research Environment for Paediatric Endocrinology across Europe","authors":"Jipu Jiang, R. Sinnott, A. Stell, J. Watt, Faisal Ahmed","doi":"10.1109/CCGRID.2009.68","DOIUrl":"https://doi.org/10.1109/CCGRID.2009.68","url":null,"abstract":"Paediatric endocrinology is a medical specialty dealing with variations of physical growth and sexual development in childhood. Genetic anomalies that can cause disorders of sexual development in children are rare. Given this, sharing and collaboration on the small number of cases that occur is needed by clinical experts in the field. The EU-funded EuroDSD project (www.eurodsd.eu) is one such collaboration involving clinical centres and clinical and genetic experts across Europe. Through the establishment of a virtual research environment (VRE) supporting sharing of data and a variety of clinical and bioinformatics analysis tools, EuroDSD aims to provide a research infrastructure for research into disorders of sex development. Security, ethics and information governance are at the heart of this infrastructure. This paper describes the infrastructure that is being built and the inherent challenges in security, availability and dependability that must be overcome for the enterprise to succeed.","PeriodicalId":118263,"journal":{"name":"2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid","volume":"1 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":"129049145","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
A Scalable Security Model for Enabling Dynamic Virtual Private Execution Infrastructures on the Internet
2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid Pub Date : 2009-05-18 DOI: 10.1109/CCGRID.2009.76
P. Primet, Jean-Patrick Gelas, Olivier Mornard, G. Koslovski, V. Roca, L. Giraud, J. Montagnat, Tram Truong Huu
{"title":"A Scalable Security Model for Enabling Dynamic Virtual Private Execution Infrastructures on the Internet","authors":"P. Primet, Jean-Patrick Gelas, Olivier Mornard, G. Koslovski, V. Roca, L. Giraud, J. Montagnat, Tram Truong Huu","doi":"10.1109/CCGRID.2009.76","DOIUrl":"https://doi.org/10.1109/CCGRID.2009.76","url":null,"abstract":"With the expansion and the convergence of computing and communication, the dynamic provisioning of customized processing and networking infrastructures as well as resource virtualization are appealing concepts and technologies. Therefore, new models and tools are needed to allow users to create, trust and exploit such on-demand virtual infrastructures within wide area distributed environments. This paper proposes to combine network and system virtualization with cryptographic identification and SPKI/HIP principles to help the user communities to build and share their own resource reservoirs. These ideas are implemented in the HIPerNet framework enabling the creation and the management of customized confined execution environments in a large scale context. Based on the example of biomedical applications, the paper focuses on the security model of the HIPerNet system and develops the key aspects of our distributed security approach. Then the paper discusses and illustrates how HIPerNet solutions fulfill the security requirements of applications through different scenarios.","PeriodicalId":118263,"journal":{"name":"2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid","volume":"117 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":"129359375","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
An Agent-Based Approach for Autonomic Web Service Workflow Model 基于代理的自主Web服务工作流模型研究
2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid Pub Date : 2009-05-18 DOI: 10.1109/CCGRID.2009.95
H. Tong, Jian Cao, Shensheng Zhang
{"title":"An Agent-Based Approach for Autonomic Web Service Workflow Model","authors":"H. Tong, Jian Cao, Shensheng Zhang","doi":"10.1109/CCGRID.2009.95","DOIUrl":"https://doi.org/10.1109/CCGRID.2009.95","url":null,"abstract":"An agent-based web service workflow model is presented in this paper to facilitate the autonomic Web service composition, which contains three layers. The top is the user layer which represents the service requirements as goal workflow, the bottom service layer denotes the distributed Web services, and the middle is the agent layer. Each service agent in the agent layer abstracts the features of a group of actual operations with similar functions as operation template and models the process of using operation templates to achieve a certain goal as plan. The proposed model has great flexibility and extensibility and provides the guidance for the development of Web service integration tools.","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":"132068008","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
Multi-Tiered On-Demand Resource Scheduling for VM-Based Data Center 基于虚拟机的数据中心资源分级按需调度
2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid Pub Date : 2009-05-18 DOI: 10.1109/CCGRID.2009.11
Ying Song, Hui Wang, Yaqiong Li, B. Feng, Yuzhong Sun
{"title":"Multi-Tiered On-Demand Resource Scheduling for VM-Based Data Center","authors":"Ying Song, Hui Wang, Yaqiong Li, B. Feng, Yuzhong Sun","doi":"10.1109/CCGRID.2009.11","DOIUrl":"https://doi.org/10.1109/CCGRID.2009.11","url":null,"abstract":"The trend of using virtualization for server consolidation is more and more popular in enterprise data center. However, on-demand resource allocation among the concurrent hosted services in such a virtualized environment is still a challenge. In order to optimize resource allocation among services in data center, this paper proposes a multi-tiered resource scheduling scheme which automatically provides on-demand capacities to the hosted services via resources flowing among VMs. We model the resource flowing using optimiza-tion theory. Based on this model, we present a global re-source flowing algorithm in the multi-tiered resource scheduling scheme. This algorithm preferentially ensures performance of some critical services by degrading of others to some extent when resource competition arises. Using our RAINBOW prototype, we evaluate the multi-tiered resource scheduling scheme with the performance improvements for the most critical services up to 9%~16%, which are 75% of the maximum improvement margin, while performance degradation of others is up to 2%, and leads to 1%~5% im-provements in resource utilization than RAINBOW without resource flowing. Compared with the existent scheme, our work leads to 9% less improvements for critical services, while introduces 39% less degradation to low priority ser-vices.","PeriodicalId":118263,"journal":{"name":"2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid","volume":"1 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":"128714736","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}
引用次数: 191
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学术文献互助群
群 号:481959085
Book学术官方微信