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

Fifth IEEE/ACM International Workshop on Grid Computing最新文献

筛选
英文 中文
Integration of NetSolve with Globus-based grids NetSolve与基于globus的网格的集成
Fifth IEEE/ACM International Workshop on Grid Computing Pub Date : 2004-11-08 DOI: 10.1109/GRID.2004.41
M. Brzezniak, Tomasz Makiela, N. Meyer
{"title":"Integration of NetSolve with Globus-based grids","authors":"M. Brzezniak, Tomasz Makiela, N. Meyer","doi":"10.1109/GRID.2004.41","DOIUrl":"https://doi.org/10.1109/GRID.2004.41","url":null,"abstract":"The paper describes the techniques for integrating NetSolve, a client-server system for solving complex scientific problems, with the Globus-based grid environments. The integration includes applying the Globus identification and authorisation techniques to the NetSolve modules and adapting the communication and computation control mechanism in NetSolve to operate in the Globus-based grids. The control communication in NetSolve is modified to use the Globus-IO. Large input and output data are transmitted through the grid FTP protocol. Computations on the remote resources are run through Globus GRAM services. The paper presents the idea and technical details of the integration. It discusses advantages and disadvantages of the modified system in comparison to the original NetSolve and provides preliminary experimental results.","PeriodicalId":335281,"journal":{"name":"Fifth IEEE/ACM International Workshop on Grid Computing","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125854157","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}
引用次数: 2
Hybrid preemptive scheduling of MPI applications on the grids 网格上MPI应用的混合抢占调度
Fifth IEEE/ACM International Workshop on Grid Computing Pub Date : 2004-11-08 DOI: 10.1109/GRID.2004.39
Aurélien Bouteiller, Hinde-Lilia Bouziane, T. Hérault, Pierre Lemarinier, F. Cappello
{"title":"Hybrid preemptive scheduling of MPI applications on the grids","authors":"Aurélien Bouteiller, Hinde-Lilia Bouziane, T. Hérault, Pierre Lemarinier, F. Cappello","doi":"10.1109/GRID.2004.39","DOIUrl":"https://doi.org/10.1109/GRID.2004.39","url":null,"abstract":"Time sharing between cluster resources in grid is a major issue in cluster and grid integration. Classical grid architecture involves a higher level scheduler which submits nonoverlapping jobs to the independent batch schedulers of each cluster of the grid. The sequentiality induced by this approach does not fit with the expected number of users and job heterogeneity of the grids. Time sharing techniques address this issue by allowing simultaneous executions of many applications on the same resources. Co-scheduling and gang scheduling are the two best known techniques for time sharing cluster resources. Co-scheduling relies on the operating system of each node to schedule the processes of every application. Gang scheduling ensures that the same application is scheduled on all nodes simultaneously. Previous work has proven that co-scheduling techniques outperforms gang scheduling when physical memory is not exhausted. In this paper, we introduce a new hybrid sharing technique providing checkpoint based explicit memory management. It consists in co-scheduling parallel applications within a set, until the memory capacity of the node is reached, and using gang scheduling related techniques to switch from one set to another one. We compare experimentally the merits of the three solutions: co, gang and hybrid scheduling, in the context of out-of-core computing, which is likely to occur in the grid context, where many users share the same resources. The experiments show that the hybrid solution is as efficient as the co-scheduling technique when the physical memory is not exhausted, and is more efficient than gang scheduling and co-scheduling when physical memory is exhausted.","PeriodicalId":335281,"journal":{"name":"Fifth IEEE/ACM International Workshop on Grid Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130293096","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
On the feasibility of running entity-level simulations on grid platforms 论在网格平台上运行实体级仿真的可行性
Fifth IEEE/ACM International Workshop on Grid Computing Pub Date : 2004-11-08 DOI: 10.1109/GRID.2004.45
Alan Su, F. Berman, H. Casanova
{"title":"On the feasibility of running entity-level simulations on grid platforms","authors":"Alan Su, F. Berman, H. Casanova","doi":"10.1109/GRID.2004.45","DOIUrl":"https://doi.org/10.1109/GRID.2004.45","url":null,"abstract":"Scientists have long relied on abstract models to study phenomena that are too complex for direct observation and experimentation. As new scientific modeling methodologies emerge, new computing technologies must be developed. In this paper, we focus on entity-level modeling, a modeling approach that is gaining prevalence in many scientific fields. Although the principles of entity-level modeling are straightforward, entity-level simulations require a large amount of compute resource and grid platforms can meet such resource needs. Unfortunately, efficient large-scale distributed entity-level simulations have proven elusive, typically due to nondeterminism that renders classical distributed application deployment strategies ineffective. In this work, we propose a method for dynamically remapping application tasks to cope with this inherent nondeterminism. We evaluate the efficacy of this method in a simulated grid computing environment and discuss the feasibility of executing entity-level applications on grids.","PeriodicalId":335281,"journal":{"name":"Fifth IEEE/ACM International Workshop on Grid Computing","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115198337","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}
引用次数: 2
Design, implementation and performance evaluation of GridRPC programming middleware for a large-scale computational grid 面向大规模计算网格的GridRPC编程中间件的设计、实现与性能评价
Fifth IEEE/ACM International Workshop on Grid Computing Pub Date : 2004-11-08 DOI: 10.1109/GRID.2004.20
Yoshio Tanaka, H. Takemiya, H. Nakada, S. Sekiguchi
{"title":"Design, implementation and performance evaluation of GridRPC programming middleware for a large-scale computational grid","authors":"Yoshio Tanaka, H. Takemiya, H. Nakada, S. Sekiguchi","doi":"10.1109/GRID.2004.20","DOIUrl":"https://doi.org/10.1109/GRID.2004.20","url":null,"abstract":"This paper reports on the design, implementation and performance evaluation of a suite of GridRPC programming middleware called Ninf-G Version 2 (Ninf-G2). Ninf-G2 is a reference implementation of the GridRPC API, a proposed GGF standard. Ninf-G2 has been designed so that it provides 1) high performance in a large-scale computational Grid, 2) the rich functionalities which are required to adapt to compensate for the heterogeneity and unreliability of a Grid environment, and 3) an API which supports easy development and execution of Grid applications. Ninf-G2 is implemented to work with basic Grid services, such as GSI, GRAM, and MDS in the Globus Toolkit version 2. The performance ofNinf-G2 was evaluated using a weather forecasting system which was developed using Ninf-G2. The experimental results indicate that high performance can be attained even in relatively fine-grained task-parallel applications on hundreds of processors in a Grid environment.","PeriodicalId":335281,"journal":{"name":"Fifth IEEE/ACM International Workshop on Grid Computing","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126683157","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}
引用次数: 49
Towards ontology-driven P2P grid resource discovery 面向本体驱动的P2P网格资源发现
Fifth IEEE/ACM International Workshop on Grid Computing Pub Date : 2004-11-08 DOI: 10.1109/GRID.2004.61
Felix Heine, M. Hovestadt, O. Kao
{"title":"Towards ontology-driven P2P grid resource discovery","authors":"Felix Heine, M. Hovestadt, O. Kao","doi":"10.1109/GRID.2004.61","DOIUrl":"https://doi.org/10.1109/GRID.2004.61","url":null,"abstract":"In this paper we present a new approach to semantic resource discovery in the grid. A peer-to-peer network is used to distribute and query the resource catalogue. Each peer can provide resource descriptions and background knowledge, and each peer can query the network for existing resources. We do not require a central ontology for resource description and matching. Each peer has its own, possibly incomplete, ontology, which is completed by the knowledge distributed over the network. This allows to find matching resources even if the concepts used to describe the resources are unknown to the provider, as the network supplies the missing parts of the ontology.","PeriodicalId":335281,"journal":{"name":"Fifth IEEE/ACM International Workshop on Grid Computing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116844933","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}
引用次数: 76
Partitioning and mapping of mesh-based applications onto computational grids 基于网格的应用程序到计算网格的划分和映射
Fifth IEEE/ACM International Workshop on Grid Computing Pub Date : 2004-11-08 DOI: 10.1109/GRID.2004.48
Renaud Wanschoor, E. Aubanel
{"title":"Partitioning and mapping of mesh-based applications onto computational grids","authors":"Renaud Wanschoor, E. Aubanel","doi":"10.1109/GRID.2004.48","DOIUrl":"https://doi.org/10.1109/GRID.2004.48","url":null,"abstract":"Mesh-based applications, such as those that involve the numerical solution of partial differential equations, may be able to take advantage of the performance of computational grids. We require mesh partitioners that take the heterogeneity of the computational platform into account. Recent work in our group led to the creation of a heterogeneous mesh partitioner, PaGrid. We present a redesigned version of PaGrid, which uses estimated execution time as a cost function in all levels of multilevel refinement. It takes into account the characteristics of the application (computational complexity and size of messages) and of the computing platform (processor and network speeds), and balances the estimated execution time of processors. This results in partitions with up to 60% lower estimated execution times than METIS, a homogeneous partitioner, and similar improvements over JOSTLE, a heterogeneous partitioner. PaGrid achieves this in a reasonable amount of time, taking only two to three times longer than METIS.","PeriodicalId":335281,"journal":{"name":"Fifth IEEE/ACM International Workshop on Grid Computing","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124467405","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}
引用次数: 7
Grid-based indexing of a newswire corpus 基于网格的新闻语料库索引
Fifth IEEE/ACM International Workshop on Grid Computing Pub Date : 2004-11-08 DOI: 10.1109/GRID.2004.34
B. Hughes, S. Venugopal, R. Buyya
{"title":"Grid-based indexing of a newswire corpus","authors":"B. Hughes, S. Venugopal, R. Buyya","doi":"10.1109/GRID.2004.34","DOIUrl":"https://doi.org/10.1109/GRID.2004.34","url":null,"abstract":"In this paper we report experience in the use of computational grids in the domain of natural language processing, particularly in the area of information extraction, to create query indices for information retrieval tasks. Given the prevalence of large corpora in the natural language processing domain, computational grids offer significant utility to researchers in the domain who are reaching the bounds of computational efficiency. We leverage the affinities between the segmented data sources prevalent in natural language processing and the parallelisation model from the grid domain. The experiment reported here is a large-scale newswire corpus indexing task, with the goal to efficiently create a queryable index of the entire corpus. By parallelising the indexing task and executing it on an Australian computational grid, we observe overall performance improvement of a 2.26x speedup over the same experiment on a single computational node. In addition to reporting the raw performance impact, we reflect on a number of interesting points discovered during the execution of the experiments and propose a number of new requirements for grid middleware.","PeriodicalId":335281,"journal":{"name":"Fifth IEEE/ACM International Workshop on Grid Computing","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117215488","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
A novel architecture for realizing grid workflow using tuple spaces 一种利用元组空间实现网格工作流的新架构
Fifth IEEE/ACM International Workshop on Grid Computing Pub Date : 2004-11-08 DOI: 10.1109/GRID.2004.3
Jia Yu, R. Buyya
{"title":"A novel architecture for realizing grid workflow using tuple spaces","authors":"Jia Yu, R. Buyya","doi":"10.1109/GRID.2004.3","DOIUrl":"https://doi.org/10.1109/GRID.2004.3","url":null,"abstract":"Grid workflow can be defined as the composition of grid application services which execute on heterogeneous and distributed resources in a well-defined order to accomplish a specific goal. Uncertainties within grid environments pose new challenges for grid workflow management systems such as lacking central control and undedicated resource sharing. In this paper, we provide a workflow enactment engine together with an XML-based workflow language (xWFL). The workflow engine supports a just in-time scheduling system, thus allowing the resource allocation decision to be made at the time of task execution and hence adapt to changing grid environments. We also show that an event-driven scheduling architecture using tuple spaces provides a highly flexible approach for executing large scale complex grid workflows.","PeriodicalId":335281,"journal":{"name":"Fifth IEEE/ACM International Workshop on Grid Computing","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133572623","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}
引用次数: 176
Flexible control of data transfers between parallel programs 灵活控制并行程序之间的数据传输
Fifth IEEE/ACM International Workshop on Grid Computing Pub Date : 2004-11-08 DOI: 10.1109/GRID.2004.31
Joe Shang-Chieh Wu, A. Sussman
{"title":"Flexible control of data transfers between parallel programs","authors":"Joe Shang-Chieh Wu, A. Sussman","doi":"10.1109/GRID.2004.31","DOIUrl":"https://doi.org/10.1109/GRID.2004.31","url":null,"abstract":"Allowing loose coupling between complex e-science applications has many advantages, such as being able to easily incorporate new applications and to flexibly specify how the applications are connected to transfer data between them. To facilitate efficient, flexible data transfers between applications, in this paper we describe methods for making decisions at runtime about when such transfers occur, and for flexibly specifying when data transfers are desired. We also present preliminary experimental results that measure the overheads incurred by our approach.","PeriodicalId":335281,"journal":{"name":"Fifth IEEE/ACM International Workshop on Grid Computing","volume":"13 29","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132748044","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
Usage policy-based CPU sharing in virtual organizations 在虚拟组织中使用基于策略的CPU共享
Fifth IEEE/ACM International Workshop on Grid Computing Pub Date : 2004-11-08 DOI: 10.1109/GRID.2004.62
C. Dumitrescu, Ian T Foster
{"title":"Usage policy-based CPU sharing in virtual organizations","authors":"C. Dumitrescu, Ian T Foster","doi":"10.1109/GRID.2004.62","DOIUrl":"https://doi.org/10.1109/GRID.2004.62","url":null,"abstract":"Resource sharing within grid collaborations usually implies specific sharing mechanisms at participating sites. Challenging policy issues can arise within virtual organizations (VOs) that integrate participants and resources spanning multiple physical institutions. Resource owners may wish to grant to one or more VOs the right to use certain resources subject to local policy and service level agreements, and each VO may then wish to use those resources subject to VO policy. Thus, we must address the question of what usage policies (UPs) should be considered for resource sharing in VOs. As a first step in addressing this question, we develop and evaluate different UP scenarios within a specialized context that mimics scientific grids within which the resources to be shared are computers. We also present a UP architecture and define roles and functions for scheduling resources in such grid environments while satisfying resource owner policies.","PeriodicalId":335281,"journal":{"name":"Fifth IEEE/ACM International Workshop on Grid Computing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114993689","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}
引用次数: 51
首页 上一页 下一页 尾页
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学术官方微信