{"title":"Automatic clustering of grid nodes","authors":"Qiang Xu, J. Subhlok","doi":"10.1109/GRID.2005.1542746","DOIUrl":"https://doi.org/10.1109/GRID.2005.1542746","url":null,"abstract":"In a grid-computing environment, resource selection and scheduling depend on the network topology connecting the computation nodes. This paper presents a method to hierarchically group compute nodes distributed across the Internet into logical clusters, and determine the relative location of the clusters. At inter-domain level, distance from landmarks (a small group of distributed reference nodes) is the basis for converting the location of nodes inside a complex network structure onto a simple geometric space. The position of compute nodes in this geometric space is the basis for partitioning nodes into clusters. For compute nodes within an administrative domain, minimum RTT is used as the metric to partition nodes into clusters. This approach leads to an efficient, scalable and portable method of clustering grid nodes and building a distance map among clusters. We demonstrate the system for automatic clustering by applying it to computation nodes distributed across five universities in Texas.","PeriodicalId":347929,"journal":{"name":"The 6th IEEE/ACM International Workshop on Grid Computing, 2005.","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124648637","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}
G. Aydin, M. Aktaş, G. Fox, H. Gadgil, M. Pierce, A. Sayar
{"title":"SERVOGrid complexity computational environments (CCE) integrated performance analysis","authors":"G. Aydin, M. Aktaş, G. Fox, H. Gadgil, M. Pierce, A. Sayar","doi":"10.1109/GRID.2005.1542750","DOIUrl":"https://doi.org/10.1109/GRID.2005.1542750","url":null,"abstract":"In this paper we describe the architecture and initial performance analysis results of the SERVOGrid complexity computational environments (CCE). The CCE architecture is based on a lightly coupled, service oriented architecture approach that is suitable for distributed applications that are tolerant of Internet latencies. CCE focuses on integrating diverse Web and grid services for coupling scientific applications to geographical information systems. The services and coupling/orchestrating infrastructure are mapped to problems in geophysical data mining, pattern informatics, and multiscale geophysical simulation.","PeriodicalId":347929,"journal":{"name":"The 6th IEEE/ACM International Workshop on Grid Computing, 2005.","volume":"281 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121358499","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}
David J. Garcia Aristegui, P. M. Lorenzo, J. R. Valverde
{"title":"GROCK: high-throughput docking using LCG grid tools","authors":"David J. Garcia Aristegui, P. M. Lorenzo, J. R. Valverde","doi":"10.1109/GRID.2005.1542728","DOIUrl":"https://doi.org/10.1109/GRID.2005.1542728","url":null,"abstract":"The study of interactions of proteins with other molecules is a major task to understand living organisms and design new drugs. GROCK is a portal that facilitates mass screening of potential molecular interactions in the life sciences. The main purpose for developing GROCK has been to facilitate users the performance of huge amounts of computational tasks using the power of the grid. In GROCK we have considered issues of high availability, redundancy, failure recovery and maximal exploitation of available grid resources. After trying various approaches we have settled for LCG-submitter, a tool developed for the physics LHC project to solve some of our goals. In this paper we introduce GROCK and analyze its design goals, the challenges found and the solutions we came up with to overcome them.","PeriodicalId":347929,"journal":{"name":"The 6th IEEE/ACM International Workshop on Grid Computing, 2005.","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126703694","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}
Kaizar Amin, G. Laszewski, Mikhail Sosonkin, Armin R. Mikler, M. Hategan
{"title":"Ad hoc grid security infrastructure","authors":"Kaizar Amin, G. Laszewski, Mikhail Sosonkin, Armin R. Mikler, M. Hategan","doi":"10.1109/GRID.2005.1542726","DOIUrl":"https://doi.org/10.1109/GRID.2005.1542726","url":null,"abstract":"This paper describes an ad hoc grid security infrastructure developed as a part of the Java CoG Kit project. It supports several requirements specific to the sporadic nature of ad hoc grids. It focuses on identity management, identity verification, and authorization control in spontaneous grid collaborations without pre-established policies or environments. It adopts established community standards, with modifications where needed. This paper also discusses the integration of the ad hoc grid security infrastructure in an ad hoc grid implementation. The implementation supports secure collaboration in ad hoc grids using commodity technologies such as the Java CoG Kit, JXTA, GSI, and XACML.","PeriodicalId":347929,"journal":{"name":"The 6th IEEE/ACM International Workshop on Grid Computing, 2005.","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116767249","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}
L. Seitz, E. Rissanen, Thomas Sandholm, B. S. Firozabadi, Olle Mulmo
{"title":"Policy administration control and delegation using XACML and Delegent","authors":"L. Seitz, E. Rissanen, Thomas Sandholm, B. S. Firozabadi, Olle Mulmo","doi":"10.1109/GRID.2005.1542723","DOIUrl":"https://doi.org/10.1109/GRID.2005.1542723","url":null,"abstract":"In this paper we present a system permitting controlled policy administration and delegation using the XACML access control system. The need for these capabilities stems from the use of XACML in the SweGrid Accounting System, which is used to enforce resource allocations to Swedish research projects. Our solution uses a second access control system Delegent, which has powerful delegation capabilities. We have implemented limited XML access control in Delegent, in order to supervise modifications of the XML-encoded XACML policies. This allows us to use the delegation capabilities of Delegent together with the expressive access level permissions of XACML.","PeriodicalId":347929,"journal":{"name":"The 6th IEEE/ACM International Workshop on Grid Computing, 2005.","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124555284","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}
Ariel Oleksiak, Alisdair Tullo, Paul Graham, T. Kuczynski, J. Nabrzyski, D. Szejnfeld, Terry Sloan
{"title":"HPC-Europa: towards uniform access to European HPC infrastructures","authors":"Ariel Oleksiak, Alisdair Tullo, Paul Graham, T. Kuczynski, J. Nabrzyski, D. Szejnfeld, Terry Sloan","doi":"10.1109/GRID.2005.1542761","DOIUrl":"https://doi.org/10.1109/GRID.2005.1542761","url":null,"abstract":"One of the goals of the HPC-Europa project is to provide users with a Single Point of Access (SPA) to the resources of HPC centers in Europe. To this end, the HPC-Europa Portal is being built to provide transparent, uniform, flexible and intuitive user access to HPC-Europa resources. In this paper, we present a mechanism that enables end-users to transparently access the diverse services available in the HPC-Europa environment. The uniform job submission interface that uses this mechanism, utilizing the job specification description language (JSDL), is described. We also present the architecture of the SPA, based on the GridSphere portal framework. Finally, we discuss the various interoperability problems encountered, in particular those concerning job submission, security and accounting.","PeriodicalId":347929,"journal":{"name":"The 6th IEEE/ACM International Workshop on Grid Computing, 2005.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132030849","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}
{"title":"Semantic overlay network for grid resource discovery","authors":"Juan Li, S. Vuong","doi":"10.1109/GRID.2005.1542756","DOIUrl":"https://doi.org/10.1109/GRID.2005.1542756","url":null,"abstract":"This paper presents a new approach to grid-resource discovery by using semantic peer-to-peer (P2P) overlays. The framework is based on the RDF metadata infrastructure, allowing a rich and extensible description of resources and queries. To avoid flooding the network with a query, we propose a comprehensive semantics-based query forwarding strategy, which only forwards queries to semantically related nodes. After the related nodes have been located, the original RDF query is used to do the final query and retrieval. Results from simulation experiments demonstrate that this architecture is scalable and efficient.","PeriodicalId":347929,"journal":{"name":"The 6th IEEE/ACM International Workshop on Grid Computing, 2005.","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122079421","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}
A. Khan, T. Adye, C. Brew, F. Wilson, B. Bense, R. Cowles, D. Smith, Daniele Adreotti, C. Bozzi, E. Luppi, P. Veronesi, R. Barlow, M. Kelly, J. C. Werner, A. Forti, G. Grosdidier, E. Feltresi, A. Petzold, H. Lacker, J. Sundermann
{"title":"Grid applications for high energy physics experiments","authors":"A. Khan, T. Adye, C. Brew, F. Wilson, B. Bense, R. Cowles, D. Smith, Daniele Adreotti, C. Bozzi, E. Luppi, P. Veronesi, R. Barlow, M. Kelly, J. C. Werner, A. Forti, G. Grosdidier, E. Feltresi, A. Petzold, H. Lacker, J. Sundermann","doi":"10.1109/GRID.2005.1542753","DOIUrl":"https://doi.org/10.1109/GRID.2005.1542753","url":null,"abstract":"This paper discusses the use of e-science grid in providing computational resources for modern international high energy physics (HEP) experiments. We investigate the suitability of the current generation of grid software to provide the necessary resources to perform large-scale simulation of the experiment and analysis of data in the context of multinational collaboration.","PeriodicalId":347929,"journal":{"name":"The 6th IEEE/ACM International Workshop on Grid Computing, 2005.","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123095626","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}
{"title":"Differential checkpointing for reducing memory requirements in optimized SOAP deserialization","authors":"N. Abu-Ghazaleh, M. Lewis","doi":"10.1109/GRID.2005.1542749","DOIUrl":"https://doi.org/10.1109/GRID.2005.1542749","url":null,"abstract":"Differential serialization (DDS) is a SOAP optimization technique wherein servers save checkpoints and parser states associated with portions of previously received messages, and use them to avoid full parsing and deserialization of similar new messages. In this paper, we characterize DDS's memory requirements and memory overhead, introduce a new technique for storing only the differences between successive parser states for a message, and demonstrate how this optimization, which we call differential checkpointing, speeds up the DDS optimization and reduces its memory requirements.","PeriodicalId":347929,"journal":{"name":"The 6th IEEE/ACM International Workshop on Grid Computing, 2005.","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131241288","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}
{"title":"A quantitative comparison of reputation systems in the grid","authors":"Jason D. Sonnek, J. Weissman","doi":"10.1109/GRID.2005.1542748","DOIUrl":"https://doi.org/10.1109/GRID.2005.1542748","url":null,"abstract":"Reputation systems have been a hot topic in the peer-to-peer community for several years. In a services-oriented distributed computing environment like the grid, reputation systems can be utilized by clients to select between competing service providers. In this paper, we selected several existing reputation algorithms and adapted them to the problem of service selection in a grid-like environment. We performed a quantitative comparison of both the accuracy and overhead associated with these techniques under common scenarios. The results indicate that using a reputation system to guide service selection can significantly improve client satisfaction with minimal overhead. In addition, we show that the most appropriate algorithm depends on the kinds of anticipated attacks. A new algorithm we've proposed appears to be the approach of choice if clients can misreport service ratings.","PeriodicalId":347929,"journal":{"name":"The 6th IEEE/ACM International Workshop on Grid Computing, 2005.","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132283831","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}