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

MPICH/MADIII : a cluster of clusters enabled MPI implementation MPICH/MADIII:启用MPI实现的集群的集群

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.1199349

Olivier Aumage, Guillaume Mercier

引用次数: 66

Using grid technologies to face medical image analysis challenges 利用网格技术应对医学图像分析的挑战

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.1199418

J. Montagnat, V. Breton, I. Magnin

引用次数: 56

Grid-based nonequilibrium multiple-time scale molecular dynamics/Brownian dynamics simulations of ligand-receptor interactions in structured protein systems 结构蛋白系统中配体-受体相互作用的网格非平衡多时间尺度分子动力学/布朗动力学模拟

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.1199415

Yaohang Li, M. Mascagni, Michael H. Peter

{"title":"Grid-based nonequilibrium multiple-time scale molecular dynamics/Brownian dynamics simulations of ligand-receptor interactions in structured protein systems","authors":"Yaohang Li, M. Mascagni, Michael H. Peter","doi":"10.1109/CCGRID.2003.1199415","DOIUrl":"https://doi.org/10.1109/CCGRID.2003.1199415","url":null,"abstract":"In the hybrid Molecular Dynamics (MD)/Brownian Dynamics (BD) algorithm for simulating the long-time, nonequilibrium dynamics of receptor-ligand interactions, the evaluation of the force autocorrelation function can be computationally costly but fortunately is highly amenable to multimode processing methods. In this paper, taking advantage of the computational grid's large-scale computational resources and the nice characteristics of grid-based Monte Carlo applications, we developed a grid-based receptor-ligand interactions simulation application using the MD/BD algorithm. We expect to provide high-performance and trustworthy computing for analyzing long-time dynamics of proteins and protein-protein interaction to predict and understand cell signaling processes and small molecule drug efficacies. Our preliminary results showed that our grid-based application could provide a faster and more accurate computation for the force autocorrelation function in our MD/BD simulation than previous parallel implementations.","PeriodicalId":433323,"journal":{"name":"CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings.","volume":"25 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":"132849127","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}

引用次数: 4

Can the Grid help to solve the data integration problems in molecular biology? 网格能帮助解决分子生物学中的数据集成问题吗?

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.1199419

Brian Sturgeon, Damian McCourt, J. Cowper, Fiona Palmer, S. McClean, W. Dubitzky

引用次数: 4

A row-permutated data reorganization algorithm for growing server-less video-on-demand systems 面向无服务器视频点播系统的行置换数据重组算法

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.1199351

T. Ho, Jack Y. B. Lee

引用次数: 4

DKS(N, k, f): a family of low communication, scalable and fault-tolerant infrastructures for P2P applications DKS(N, k, f):一组用于P2P应用的低通信、可扩展和容错基础架构

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.1199386

L. O. Alima, Sameh El-Ansary, P. Brand, Seif Haridi

{"title":"DKS(N, k, f): a family of low communication, scalable and fault-tolerant infrastructures for P2P applications","authors":"L. O. Alima, Sameh El-Ansary, P. Brand, Seif Haridi","doi":"10.1109/CCGRID.2003.1199386","DOIUrl":"https://doi.org/10.1109/CCGRID.2003.1199386","url":null,"abstract":"In this paper, we present DKS(N, k, f), a family of infrastructures for building Peer-To-Peer applications. Each instance of DKS(N, k, f) is a fully decentralized overlay network characterized by three parameters: N the maximum number of nodes that can be in the network; k the search arity within the network and f the degree of fault-tolerance. Once these parameters are instantiated, the resulting network has several desirable properties. The first property, which is the main contribution of this paper, is that there is no separate procedure for maintaining routing tables; instead, any out-of-date or erroneous routing entry is eventually corrected on-the-fly thereby, eliminating unnecessary bandwidth consumption. The second property is that each lookup request is resolved in at most log/sub k/(N) overlay hops under normal operations. Third, each node maintains only (k-1) log/sub k/(N) + 1 addresses of other nodes for routing purposes. Fourth, new nodes can join and existing nodes can leave at will with a negligible disturbance to the ability to resolve lookups in logk(N) hops in average. Fifth, any pair key/value that is inserted into the system is guaranteed to be located even in the presence of concurrent joins. Sixth, even if f consecutive nodes fail simultaneously, correct lookup is still guaranteed.","PeriodicalId":433323,"journal":{"name":"CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings.","volume":"36 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":"114829962","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}

引用次数: 159

PM/Ethernet-kRMA: a high performance remote memory access facility using multiple gigabit ethernet cards PM/ ethernet - krma:使用多个千兆以太网卡的高性能远程存储器访问设施

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.1199384

S. Sumimoto, K. Kumon

{"title":"PM/Ethernet-kRMA: a high performance remote memory access facility using multiple gigabit ethernet cards","authors":"S. Sumimoto, K. Kumon","doi":"10.1109/CCGRID.2003.1199384","DOIUrl":"https://doi.org/10.1109/CCGRID.2003.1199384","url":null,"abstract":"This paper proposes a high performance communication facility using multiple commodity network interface cards (NICs). Called PM/Ethernet-kRMA, it is NIC-hardware-independent and provides (k)ernel-level Remote Memory Access (kRMA) on multiple NICs. The PM/Ethernet-kRMA communication protocol is processed on the host processor, and the protocol handler accesses user data space directly from the kernel, and then transfers the data to network using existing network device drivers. This protocol provides one-copy communication between user memory spaces on kernel. The PM/Ethernet-kRMA is implemented using the PM/Ethernet, one of the communication facilities of the SCore Cluster system software on Linux. The PM/Ethernet uses the Network Trunking technique, which provides message communication using multiple NICs. Existing protocols, such as TCP/IP, can be used on the PM/Ethernet-kRMA as well as the PM/Ethernet. We have evaluated the PM/Ethernet-kRMA using 2-node single Xeon 2.4GHz processor machines with three Intel PRO/ 1000 XTs and one Broadcom 5701 based Gigabit Ethernet NICs on each node. Network Trunking provides 420 MB/s of communication bandwidth using four Gigabit Ethernet NICs. PM/Ethernet-kRMA using four Gigabit Ethernet NICs, in contrast, provides 487 MB/s of bandwidth which is 97.4% of hardware-level bandwidth (500 MB/s).","PeriodicalId":433323,"journal":{"name":"CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings.","volume":"73 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":"121946952","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}

引用次数: 10

Improved read performance in a cost-effective, fault-tolerant parallel virtual file system (CEFT-PVFS) 在经济高效、容错的并行虚拟文件系统(CEFT-PVFS)中提高了读性能

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.1199440

Yifeng Zhu, Hong Jiang, X. Qin, D. Feng, D. Swanson

{"title":"Improved read performance in a cost-effective, fault-tolerant parallel virtual file system (CEFT-PVFS)","authors":"Yifeng Zhu, Hong Jiang, X. Qin, D. Feng, D. Swanson","doi":"10.1109/CCGRID.2003.1199440","DOIUrl":"https://doi.org/10.1109/CCGRID.2003.1199440","url":null,"abstract":"Due to the ever-widening performance gap between processors and disks, I/O operations tend to become the major performance bottleneck of data-intensive applications on modern clusters. If all the existing disks on the nodes of a cluster are connected together to establish high performance parallel storage systems, the cluster's overall performance can be boosted at no additional cost. CEFT-PVFS (a RAID 10 style parallel file system that extends the original PVFS), as one such system, divides the cluster nodes into two groups, stripes the data across one group in a round-robin fashion, and then duplicates the same data to the other group to provide storage service of high performance and high reliability. Previous research has shown that the system reliability is improved by a factor of more than 40 with mirroring while maintaining a comparable write performance. This paper presents another benefit of CEFT-PVFS in which the aggregate peak read performance can be improved by as much as 100% over that of the original PVFS by exploiting the increased parallelism. Additionally, when the data servers, which typically are also computational nodes in a cluster environment, are loaded in an unbalanced way by applications running in the cluster, the read performance of PVFS will be degraded significantly. On the contrary, in the CEFT-PVFS, a heavily loaded data server can be skipped and all the desired data is read from its mirroring node. Thus the performance will not be affected unless both the server node and its mirroring node are heavily loaded.","PeriodicalId":433323,"journal":{"name":"CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings.","volume":"56 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":"116588785","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}

引用次数: 30

Scheduling distributed applications: the SimGrid simulation framework 调度分布式应用程序:SimGrid模拟框架

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.1199362

Arnaud Legrand, L. Marchal, H. Casanova

{"title":"Scheduling distributed applications: the SimGrid simulation framework","authors":"Arnaud Legrand, L. Marchal, H. Casanova","doi":"10.1109/CCGRID.2003.1199362","DOIUrl":"https://doi.org/10.1109/CCGRID.2003.1199362","url":null,"abstract":"Since the advent of distributed computer systems an active field of research has been the investigation of scheduling strategies for parallel applications. The common approach is to employ scheduling heuristics that approximate an optimal schedule. Unfortunately, it is often impossible to obtain analytical results to compare the efficacy of these heuristics. One possibility is to conducts large numbers of back-to-back experiments on real platforms. While this is possible on tightly-coupled platforms, it is infeasible on modern distributed platforms (i.e. Grids) as it is labor-intensive and does not enable repeatable results. The solution is to resort to simulations. Simulations not only enables repeatable results but also make it possible to explore wide ranges of platform and application scenarios. In this paper we present the SimGrid framework which enables the simulation of distributed applications in distributed computing environments for the specific purpose of developing and evaluating scheduling algorithms. This paper focuses on SimGrid v2, which greatly improves on the first version of the software with more realistic network models and topologies. SimGrid v2 also enables the simulation of distributed scheduling agents, which has become critical for current scheduling research in large-scale platforms. After describing and validating these features, we present a case study by which we demonstrate the usefulness of SimGrid for conducting scheduling research.","PeriodicalId":433323,"journal":{"name":"CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings.","volume":"121 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":"128380060","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}

引用次数: 396

On the use of agents in a BioInformatics 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.1199429

L. Moreau, S. Miles, C. Goble, R. Greenwood, V. Dialani, M. Addis, M. Alpdemir, Rich Cawley, D. D. Roure, Justin Ferris, R. Gaizauskas, Kevin Glover, C. Greenhalgh, P. Li, Xiaojian Liu, P. Lord, Michael Luck, D. Marvin, T. Oinn, N. Paton, S. Pettifer, M. Radenkovic, A. Roberts, A. Robinson, T. Rodden, M. Senger, N. Sharman, R. Stevens, B. Warboys, A. Wipat, C. Wroe

引用次数: 56