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

PortalLab: a web services toolkit for building semantic grid portals PortalLab:用于构建语义网格门户的web服务工具包

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

Maozhen Li, P. V. Santen, D. Walker, O. Rana, M. Baker

{"title":"PortalLab: a web services toolkit for building semantic grid portals","authors":"Maozhen Li, P. V. Santen, D. Walker, O. Rana, M. Baker","doi":"10.1109/CCGRID.2003.1199368","DOIUrl":"https://doi.org/10.1109/CCGRID.2003.1199368","url":null,"abstract":"Grid is computer-based infrastructure that provides dependable, consistent, pervasive access to distributed resources. Built on top of a Grid, a Semantic Grid is a service-oriented infrastructure that provides a range of computation, information and knowledge services. A purpose of a Grid portal is to provide easy and seamless access to Grid heterogeneous resources and services through a Web-based user interface. This paper presents PortalLab, a Web Services oriented toolkit for designing, integrating and building Semantic Grid portals. Portals built from PortalLab are composed from a collection of reusable Web Services oriented portlets that are themselves semantic Grid services. Each portlet has a WSDL interface and a semantic registry defined in a domain ontology repository. The use of software agents assists end users in formulating domain problems, searching possible solutions (solvers) and submitting user tasks to the Grid. Multiple agents work in a peer-to-peer environment to allow users to access federated Grid services across different domains to improve fault tolerance and quality of service in user job submission and execution on the Grid. Since portlets are context independent, a PortalLab portal provides the ability to interoperate with different Grid systems at a portal level.","PeriodicalId":433323,"journal":{"name":"CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings.","volume":"PP 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":"126354267","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}

引用次数: 14

MONET: service discovery and composition for mathematical problems 数学问题的服务发现和组合

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

Marc-Laurent Aird, Walter Barbera-Medina, J. Padget

引用次数: 11

Network QoS management framework for server clusters an end-host retrofitting event-handler approach using netnice 服务器集群的网络QoS管理框架是一个使用netnice的终端主机改进事件处理程序方法

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

T. Okumura, D. Mossé, M. Minami, O. Nakamura

引用次数: 4

The performance model of SilkRoad - a multithreaded DSM system for clusters 丝路的性能模型——面向集群的多线程DSM系统

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

Liang Peng, W. Wong, C. Yuen

引用次数: 3

Parallel multi-dimensional ROLAP indexing 并行多维ROLAP索引

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

F. Dehne, Todd Eavis, A. Rau-Chaplin

引用次数: 30

A-peer: an agent platform integrating peer-to-peer network A-peer:集成点对点网络的代理平台

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

Tieyan Li, Zhi-Gang Zhao, Siting Yo

引用次数: 11

RelayCast: a middleware for application-level multicast services RelayCast:用于应用级多播服务的中间件

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

Nodoka Mimura, K. Nakauchi, H. Morikawa, T. Aoyama

引用次数: 22

Kernel level speculative DSM 内核级推测性DSM

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

Cristian Tapus

引用次数: 15

A parallel FPT application for clusters 集群并行 FPT 应用程序

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

James Cheetham, F. Dehne, A. Rau-Chaplin, U. Stege, Peter J. Taillon

{"title":"A parallel FPT application for clusters","authors":"James Cheetham, F. Dehne, A. Rau-Chaplin, U. Stege, Peter J. Taillon","doi":"10.1109/CCGRID.2003.1199354","DOIUrl":"https://doi.org/10.1109/CCGRID.2003.1199354","url":null,"abstract":"Fixed-parameter tractability (FPT) techniques have recently been successful in solving NP-complete problem instances of practical importance which were too large to be solved with previous methods. In this paper we show how to enhance this approach through the addition of parallelism, thereby allowing even larger problem instances to be solved in practice. More precisely, we demonstrate the potential of parallelism when applied to the bounded-tree search phase of FPT algorithms. We apply our methodology to the k-VERTEX COVER problem which has important applications, e.g., in multiple sequence alignments for computational biochemistry. We have implemented our parallel FPT method for the k-VERTEX COVER problem using C and the MPI communication library, and tested it on a PC cluster. This is the first experimental examination of parallel FPT techniques. We have tested our parallel k-VERTEX COVER method on protein sequences obtained from the National Center for Biotechnology Information. As part of our experiments, we solved larger instances of k-VERTEX COVER than in any previously reported implementations. For example, our code can solve problem instances with k /spl ges/ 400 in less than 1.5 hours. Since our parallel FPT algorithm requires only very little communication between processors, we expect our method to also perform well on Grids.","PeriodicalId":433323,"journal":{"name":"CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings.","volume":"66 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":"126034900","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

READ/sup 2/: Put disks at network level READ/sup 2/:将磁盘置于网络级别

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

Olivier Cozette, Cyril Randriamaro, G. Utard

{"title":"READ/sup 2/: Put disks at network level","authors":"Olivier Cozette, Cyril Randriamaro, G. Utard","doi":"10.1109/CCGRID.2003.1199435","DOIUrl":"https://doi.org/10.1109/CCGRID.2003.1199435","url":null,"abstract":"Grand challenge applications have to process large amounts of data, and then require high performance IO systems. Cluster computing is a good alternative to proprietary system for building cost effective IO intensive platform: some cluster architectures won sorting benchmark (MinuteSort, Datamation)! Recent advances in IO component technologies (disk, controller and network) let us expect higher IO performance for data intensive applications on cluster. The counterpart of this evolution is that much stress is put on the different buses (memory, IO) of each node which cannot be scaled. In this paper we investigate a strategy we called READ/sup 2/ (Remote Efficient Access to Distant Device) to reduce this stress. With READ/sup 2/ any cluster node accesses directly to remote disk: the remote processor and the remote memory are removed from the control and data path: Inputs/Outputs don't interfere with the host processor and the host memory activity. With READ/sup 2/ strategy, a cluster can be considered as a shared disk architecture instead of a shared nothing one. This papers describes an implementation of READ/sup 2/ on Myrinet Networks. First experimental results show IO performance improvement.","PeriodicalId":433323,"journal":{"name":"CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings.","volume":"21 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":"116843077","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