发布求助
文献互助 智能选刊 最新文献

Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)最新文献

筛选
英文 中文
Toward an International "Computer Science Grid" 迈向国际“计算机科学网格”
Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07) Pub Date : 2007-06-18 DOI: 10.1109/WETICE.2007.181
F. Cappello
{"title":"Toward an International \"Computer Science Grid\"","authors":"F. Cappello","doi":"10.1109/WETICE.2007.181","DOIUrl":"https://doi.org/10.1109/WETICE.2007.181","url":null,"abstract":"The computer science discipline, especially in large scale distributed systems like grids and P2P systems and in high performance computing areas, tends to address issues related to increasingly complex systems, gathering thousands to millions of non trivial components. Theoretical analysis, simulation and even emulation are reaching their limits. Like in other scientific disciplines such as physics, chemistry and life science, there is a need to develop, run and maintain generations of scientific instruments for the observation of complex distributed systems running at real scale and under reproducible experimental conditions. Grid'5000 and DAS3 are two large scale systems designed as scientific instruments for researchers in the domains of grid, P2P and networking. More than testbeds, Grid'5000 and DAS3 have been designed as \"computer science grids\", where researchers share experimental resources spanning over large geographical distances, are able to reserve resources, configure them, run their experiments, realize precise measurements and replay the same experiments with the same experimental conditions. Computer scientists use these two platforms to address issues in the different software layers between the hardware and the users: networking protocols, OS, middleware, parallel and distributed application runtimes, and applications. In this paper, we will present two computer science grids: Grid '5000 and DAS3. We will describe the motivations, design and current status of these two systems. We will also present some of their key results, not only in terms of scientific results in computer science, but also the impact of these two systems as research tools. The success of the Grid'5000 and DAS platforms is the basis of an international initiative, having the objective to deploy a European level \"computer science grid\".","PeriodicalId":278535,"journal":{"name":"Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124374002","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}
引用次数: 12
A Hierarchical Two-Tier Information Management Architecture for Mobile Ad-Hoc Grid Environments 面向移动自组织网格环境的分层两层信息管理体系结构
Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07) Pub Date : 2007-05-14 DOI: 10.1109/CCGRID.2007.4
Joachim Zottl, W. Gansterer, H. Hlavacs
{"title":"A Hierarchical Two-Tier Information Management Architecture for Mobile Ad-Hoc Grid Environments","authors":"Joachim Zottl, W. Gansterer, H. Hlavacs","doi":"10.1109/CCGRID.2007.4","DOIUrl":"https://doi.org/10.1109/CCGRID.2007.4","url":null,"abstract":"A novel management layer architecture for mobile grid environments and ad-hoc networks is presented. We address a key challenge in dynamic mobile environments with a high degree of fluctuation in the hardware infrastructure: how to store information persistently and at the same time efficiently. Most currently available approaches are based on replication strategies. These strategies achieve persistency even in highly dynamic environments, but have to pay a high price in terms of redundancy. Our proposed architecture is based on the adaptation of fault-tolerant data distribution strategies utilizing erasure codes, such as RAID or Reed-Solomon, and thus combines persistency with high storage efficiency.","PeriodicalId":278535,"journal":{"name":"Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)","volume":"36 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120983267","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 Predictive Technique for Replica Selection in Grid Environment 网格环境下副本选择的预测技术
Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07) Pub Date : 2007-05-14 DOI: 10.1109/CCGRID.2007.8
R. Rahman, K. Barker, R. Alhajj
{"title":"A Predictive Technique for Replica Selection in Grid Environment","authors":"R. Rahman, K. Barker, R. Alhajj","doi":"10.1109/CCGRID.2007.8","DOIUrl":"https://doi.org/10.1109/CCGRID.2007.8","url":null,"abstract":"Replication in a data grid reduces access latency and bandwidth consumption. However, when different sites hold replicas of a particular file, there is a significant benefit realized by selecting the best replica from among them. The best replica is the one that optimizes the desired performance criterion such as absolute performance (i.e. speed), cost, security or transfer time. By selecting the best replica, the access latency can be minimized. We develop a predictive framework that uses data from various sources and predicts transfer times of the sites that host replicas. With this estimate, one site can request the replica from the site that has the lowest transfer time. We use a neural network (NN) for transfer time prediction of different sites that currently hold file replicas. We compare the results with a multi-regression model and the simulation results demonstrate that the neural network technique is capable of predicting transfer time more accurately than the regression based model.","PeriodicalId":278535,"journal":{"name":"Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114896357","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}
引用次数: 24
Impact of Adaptive Resource Allocation Requests in Utility Cluster Computing Environments 公用事业集群计算环境下自适应资源分配请求的影响
Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07) Pub Date : 2007-05-14 DOI: 10.1109/CCGRID.2007.61
M. Netto, R. Buyya
{"title":"Impact of Adaptive Resource Allocation Requests in Utility Cluster Computing Environments","authors":"M. Netto, R. Buyya","doi":"10.1109/CCGRID.2007.61","DOIUrl":"https://doi.org/10.1109/CCGRID.2007.61","url":null,"abstract":"Maximizing resource provider profit and satisfying user requirements at the same time is a challenging problem in utility computing environments. In this paper, we introduce adaptive resource allocation requests and investigate the impact of using them in utility cluster computing environments. The Service Level Agreements established between users and resource providers rely not only on fixed values, but also on functions that associate allocation parameters. In addition, the resource provider scheduler can automatically modify the number of resources and usage time of allocation requests, as well as split them into subre- quests. Users may receive incentives for supplying flexible requests which produce more scheduling options. By using rescheduling, resource providers are able to prioritize the most profitable requests dynamically and still satisfy the requirements of the already accepted user requests. From our experimental results we observed an increase of 14% in the resource provider profit and a reduction of 20% in the average response time of user requests when compared to traditional approaches.","PeriodicalId":278535,"journal":{"name":"Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116233327","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
Performance Analysis of Updating Mechanisms for Dynamic Content in Peer-to-Peer Networks 对等网络中动态内容更新机制的性能分析
Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07) Pub Date : 2007-05-14 DOI: 10.1109/CCGRID.2007.83
D. Villela
{"title":"Performance Analysis of Updating Mechanisms for Dynamic Content in Peer-to-Peer Networks","authors":"D. Villela","doi":"10.1109/CCGRID.2007.83","DOIUrl":"https://doi.org/10.1109/CCGRID.2007.83","url":null,"abstract":"In current peer-to-peer applications content is generally static, i.e. it does not change over time. In the case of content that is modified over time, peers that host such dynamic content are required to have a mechanism that refreshes content hosted by them. In unstructured peer-to- peer networks this is challenging because of its decentralized nature. In this paper we develop a model that captures for dynamic content in a peer-to-peer network the impact of its refreshing rate and its popularity to the bandwidth required from the network. We compare four simple mechanisms for updating peers that can be used in a protocol devised to work in this kind of scenario. We find that there is an optimal number of updates to proactively push into the network in order to minimize the bandwidth consumption. Since unstructured peer-to-peer networks offer little guarantees of reliability, the use of one of the mechanisms studied here is highly recommended.","PeriodicalId":278535,"journal":{"name":"Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122173768","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
Dynamic Scheduling with Process Migration 动态调度与进程迁移
Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07) Pub Date : 2007-05-14 DOI: 10.1109/CCGRID.2007.46
C. Du, Xian-He Sun, Ming Wu
{"title":"Dynamic Scheduling with Process Migration","authors":"C. Du, Xian-He Sun, Ming Wu","doi":"10.1109/CCGRID.2007.46","DOIUrl":"https://doi.org/10.1109/CCGRID.2007.46","url":null,"abstract":"Process migration is essential for runtime load balancing. In Grid and shared networked environments, load imbalance is not only caused by the dynamic nature of underlying applications, but also by the fluctuation of resource availability. In a shared environment, tasks need to be rescheduled frequently to adapt the variation of resources availability. Unlike conventional task scheduling, dynamic rescheduling has to consider process migration costs in its formulation. In this study, we first model the migration cost and introduce an effective method to predict the cost. We then introduce a dynamic scheduling mechanism that considers migration cost as well as other conventional influential factors for performance optimization in a shared, heterogeneous environment. Finally we present experimental testing to verify the analytical results. Experimental results show that the proposed dynamic scheduling system is feasible and improves the system performance considerably.","PeriodicalId":278535,"journal":{"name":"Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116845283","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}
引用次数: 40
Characterizing and Classifying Desktop Grid 桌面网格的特征与分类
Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07) Pub Date : 2007-05-14 DOI: 10.1109/CCGRID.2007.31
SungJin Choi, Hongsoo Kim, EunJoung Byun, MaengSoon Baik, Sungsuk Kim, Chan Yeol Park, C. Hwang
{"title":"Characterizing and Classifying Desktop Grid","authors":"SungJin Choi, Hongsoo Kim, EunJoung Byun, MaengSoon Baik, Sungsuk Kim, Chan Yeol Park, C. Hwang","doi":"10.1109/CCGRID.2007.31","DOIUrl":"https://doi.org/10.1109/CCGRID.2007.31","url":null,"abstract":"Desktop Grid has recently received the strong attraction for executing high throughput applications as CPU, storage and network capacities improve and become cheaper. Desktop Grid is different from Grid in many respects, but there is no general survey or taxonomy for desktop Grid. Therefore, we propose a new comprehensive taxonomy and survey of desktop Grid in order to characterize and categorize desktop Grid.","PeriodicalId":278535,"journal":{"name":"Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124678133","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}
引用次数: 82
An Accounting Model for Dynamic Virtual Organizations 动态虚拟组织的会计模型
Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07) Pub Date : 2007-05-14 DOI: 10.1109/CCGRID.2007.18
M. Göhner, M. Waldburger, F. Gubler, G. Rodosek, B. Stiller
{"title":"An Accounting Model for Dynamic Virtual Organizations","authors":"M. Göhner, M. Waldburger, F. Gubler, G. Rodosek, B. Stiller","doi":"10.1109/CCGRID.2007.18","DOIUrl":"https://doi.org/10.1109/CCGRID.2007.18","url":null,"abstract":"The provisioning of remote and composed services in support of various application areas has dramatically increased over recent times. Thus, the concept of Grids has evolved, in the sense of a common platform for electronic service provisioning in multi-domain environments. While, traditionally, Grids have seen a quite static existence, many new service compositions have to take place on-demand and for certain periods of time only. To tackle those issues the concept of Virtual Organizations (VO) delivers a highly suitable representation of such dynamic Grids. However, one important open problem at this stage is the lack of applicable, distributed, and efficient accounting schemes for commercial resource and service consumptions. Even for simple management purposes, e.g., sampling or archiving, this functionality is essential. Therefore, a comprehensive model for Grid accounting has been developed and suitable accountable units have been defined, in which an underlying activity- and resource-based accounting model covers economic cost theory. Furthermore, this work is based on a service model proposed for service provisioning in dynamic VOs, overcoming the typically static nature of traditional Grids.","PeriodicalId":278535,"journal":{"name":"Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130374695","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}
引用次数: 18
Resolution of large symmetric eigenproblems on a world wide grid 世界性网格上大型对称本征问题的求解
Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07) Pub Date : 2007-05-14 DOI: 10.1504/IJGUC.2009.022024
L. Choy, S. Petiton, M. Sato
{"title":"Resolution of large symmetric eigenproblems on a world wide grid","authors":"L. Choy, S. Petiton, M. Sato","doi":"10.1504/IJGUC.2009.022024","DOIUrl":"https://doi.org/10.1504/IJGUC.2009.022024","url":null,"abstract":"We propose an explicit restarted Lanczos algorithm on a world-wide heterogeneous grid platform. This method computes one or few eigenpairs of a large sparse real symmetric matrix. We take the specificities of computational resources into account and deal with communications over the Internet by means of techniques such as out-of-core and data persistence. We also show that a restarted algorithm and the combination of several paradigms of parallelism are interesting in this context. We perform many experimentations using several parameters related to the Lanczos method and the configuration of the platform. Depending on the number of computed Ritz eigenpairs, the results underline how critical the choice of the dimension of the working subspace is. Moreover, the size of platform has to be scaled to the order of the eigenproblem because of communications over the Internet.","PeriodicalId":278535,"journal":{"name":"Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127034429","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
Executing Large Parameter Sweep Applications on a Multi-VO Testbed 在多vo测试台上执行大参数扫描应用程序
Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07) Pub Date : 2007-05-14 DOI: 10.1109/CCGRID.2007.49
Shahaan Ayyub, D. Abramson, C. Enticott, S. Garic, Jefferson Tan
{"title":"Executing Large Parameter Sweep Applications on a Multi-VO Testbed","authors":"Shahaan Ayyub, D. Abramson, C. Enticott, S. Garic, Jefferson Tan","doi":"10.1109/CCGRID.2007.49","DOIUrl":"https://doi.org/10.1109/CCGRID.2007.49","url":null,"abstract":"Applications that span multiple virtual organizations (VOs) are of great interest to the eScience community. However, recent attempts to execute large-scale parameter sweep applications (PSAs) with the Nimrod/G tool have exposed problems in the areas of fault tolerance, data storage and trust management. In response, we have implemented a task-splitting approach, which breaks up large PSAs into a sequence of dependent subtasks, improving fault tolerance; provides a garbage collection technique, which deletes unnecessary data; and employs a trust delegation technique that facilitates flexible third party data transfers across different VOs.","PeriodicalId":278535,"journal":{"name":"Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121398752","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
下一页 尾页
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学术官方微信