CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings.最新文献_第3页

Evaluation of an economy-based file replication strategy for a data grid 基于经济的数据网格文件复制策略的评估

CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings. Pub Date : 2003-05-12 DOI: 10.1109/CCGRID.2003.1199430

William H. Bell, D. G. Cameron, R. Carvajal-Schiaffino, A. P. Millar, K. Stockinger, F. Zini

引用次数: 152

Design and implementation of PVFS-PM: a cluster file system on SCore 基于SCore的集群文件系统PVFS-PM的设计与实现

CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings. Pub Date : 2003-05-12 DOI: 10.1109/CCGRID.2003.1199436

Koji Segawa, O. Tatebe, Yuetsu Kodama, T. Kudoh, T. Shimizu

引用次数: 0

Evaluation of the inter-cluster data transfer on Grid environment 网格环境下集群间数据传输的评估

CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings. Pub Date : 2003-05-12 DOI: 10.1109/CCGRID.2003.1199390

Shoji Ogura, S. Matsuoka, H. Nakada

{"title":"Evaluation of the inter-cluster data transfer on Grid environment","authors":"Shoji Ogura, S. Matsuoka, H. Nakada","doi":"10.1109/CCGRID.2003.1199390","DOIUrl":"https://doi.org/10.1109/CCGRID.2003.1199390","url":null,"abstract":"High-performance peer-to-peer transfer between clusters will be fundamental technology base for various Grid middleware, such as large-scale data transfer in DataGrid settings, or collective communication in Grid-wide MPIs. There, two major factors are involved: on one hand network pipes with large RTT /spl times/ bandwidth typically become data-starved, resulting in bandwidth loss; on the other hand when multiple nodes on the clusters attempt simultaneous transfer, the network pipe could become saturated, resulting in packet loss which again may result in bandwidth degradation in large RTT /spl times/ bandwidth networks. By dynamically and automatically adjusting transfer parameters between the two clusters, such as the number of network nodes, number of socket stripes, we could achieve optimal bandwidth even when the network is under heavy contention. In order to arrive at a proper performance model for automated adjustment, we have conducted several simulations by which we have discovered that such automatic tuning would beneficial, but the ideal number of network pipes does not exactly match the simple transfer model of traditional peer-to-peer settings between single nodes.","PeriodicalId":433323,"journal":{"name":"CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings.","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123644639","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}

引用次数: 9

Combining task- and data parallelism to speed up protein folding on a desktop grid platform 结合任务和数据并行性来加速桌面网格平台上的蛋白质折叠

CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings. Pub Date : 2003-05-12 DOI: 10.1109/CCGRID.2003.1199374

Bennet Uk, M. Taufer, T. Stricker, G. Settanni, A. Cavalli, A. Caflisch

{"title":"Combining task- and data parallelism to speed up protein folding on a desktop grid platform","authors":"Bennet Uk, M. Taufer, T. Stricker, G. Settanni, A. Cavalli, A. Caflisch","doi":"10.1109/CCGRID.2003.1199374","DOIUrl":"https://doi.org/10.1109/CCGRID.2003.1199374","url":null,"abstract":"The steady increase of computing power at lower and lower cost enables molecular dynamics simulations to investigate the process of protein folding with an explicit treatment of water molecules. Such simulations are typically done with well known computational chemistry codes like CHARMM. Desktop grids such as the United Devices MetaProcessor are highly attractive platforms, since scavenging for unused machines on Intra- and Internet delivers compute power that is almost free. However, the predominant programming paradigm for current desktop grids is pure task parallelism and might not fit the needs for protein folding simulations with explicit water molecules. A short overall turn-around time of a simulation remains highly important for research productivity, but the need for an accurate model and long simulation time-scales leads to tasks that are too large for optimal scheduling on a desktop grid. To address this problem, we introduce a combination of task- and data parallelism as a well suitable computing paradigm for protein folding investigations on grid platforms. As a proof of concept, we design and implement a simple system for protein folding simulations based on the notion of combined task and data parallelism with clustered workers. Clustered workers are machines grouped into small clusters according to network and CPU performance criteria and act as super-nodes within a desktop grid, permitting the utilization of data parallelism in addition to the task parallelism. We integrate our new paradigm into the existing software environment of the United Devices MetaProcessor. For a test protein, we reach a better quality of the folding calculations than we reached using just task parallelism on distributed systems.","PeriodicalId":433323,"journal":{"name":"CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129852937","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}

引用次数: 11

Towards a framework for collaborative peer groups 建立协作同伴小组的框架

CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings. Pub Date : 2003-05-12 DOI: 10.1109/CCGRID.2003.1199397

V. Sunderam, James S. Pascoe, R. Loader

{"title":"Towards a framework for collaborative peer groups","authors":"V. Sunderam, James S. Pascoe, R. Loader","doi":"10.1109/CCGRID.2003.1199397","DOIUrl":"https://doi.org/10.1109/CCGRID.2003.1199397","url":null,"abstract":"We propose the notion of 'collaborative peer groups', defined as peer-to-peer overlay networks with controlled membership and multiway communication primitives that offer well-defined semantics. Peers join such groups subject to symmetric acceptance, typically based on functional commonalities and, optionally, group-specific authentication. Collaborative peer group networks share the same properties as other peer-to-peer networks, including full decentralization, symmetric abilities, and dynamism. In addition, however, an extensible set of multiway communication primitives, especially appropriate for such peer groups, is provided and supports operations such as reliable message delivery to proximal group members or a subset thereof, message aggregation from peers, and discovery of peers supporting specific functional attributes. Based on several current and emerging application scenarios, we motivate and present the proposed collaborative peer group model, outline the group management architecture, and describe the initial set of communication primitives to be supported. A discussion of the toolkit development methodology and preliminary experiences concludes the paper.","PeriodicalId":433323,"journal":{"name":"CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings.","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122140486","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

Building a performance model of streaming media applications in utility data center environment 建立了公用事业数据中心环境下流媒体应用的性能模型

CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings. Pub Date : 2003-05-12 DOI: 10.1109/CCGRID.2003.1199352

L. Cherkasova, Loren Staley

引用次数: 26

P2P-RPC: programming scientific applications on peer-to-peer systems with remote procedure call P2P-RPC:在具有远程过程调用的对等系统上编程科学应用程序

CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings. Pub Date : 2003-05-12 DOI: 10.1109/CCGRID.2003.1199394

Samir Djilali

引用次数: 25

Improving performance via computational replication on a large-scale computational grid 通过大规模计算网格上的计算复制提高性能

CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings. Pub Date : 2003-05-12 DOI: 10.1109/CCGRID.2003.1199399

Yaohang Li, M. Mascagni

{"title":"Improving performance via computational replication on a large-scale computational grid","authors":"Yaohang Li, M. Mascagni","doi":"10.1109/CCGRID.2003.1199399","DOIUrl":"https://doi.org/10.1109/CCGRID.2003.1199399","url":null,"abstract":"High performance computing on a large-scale computational grid is complicated by the heterogeneous computational capabilities of each node, node unavailability, and unreliable network connectivity. Replicating computation on multiple nodes can significantly improve performance by reducing task completion time on a grid's dynamic environment. We develop an analytical model to determine the number of task replicas to meet the performance goals in different computational grid configurations. Furthermore, taking advantage of the statistical nature of grid-based Monte Carlo applications, we extend the computational replication technique to an N-out-of-M scheduling strategy for grid-based Monte Carlo applications, which can potentially form a large category of grid-computing applications. In addition, we establish a corresponding model for the N-out-of-M scheduling mechanism. Simulations are used to validate the computational replication models. Our preliminary results show that the models we use are effective in predicting the required number of replicas to achieve short task completion time with a given high probability.","PeriodicalId":433323,"journal":{"name":"CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings.","volume":"317 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116363978","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}

引用次数: 58

Secure communication in a distributed system using identity based encryption 在分布式系统中使用基于身份的加密保护通信

CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings. Pub Date : 2003-05-12 DOI: 10.1109/CCGRID.2003.1199395

Tyron Stading

引用次数: 23

Fault tolerance in scalable agent support systems: integrating DARX in the AgentScape framework 可伸缩代理支持系统中的容错:在AgentScape框架中集成DARX

CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings. Pub Date : 2003-05-12 DOI: 10.1109/CCGRID.2003.1199434

B. Overeinder, F. Brazier, O. Marin

引用次数: 18