M. Govindaraju, Aleksander Slominski, K. Chiu, Pu Liu, R. Engelen, M. Lewis
{"title":"Toward characterizing the performance of SOAP toolkits","authors":"M. Govindaraju, Aleksander Slominski, K. Chiu, Pu Liu, R. Engelen, M. Lewis","doi":"10.1109/GRID.2004.60","DOIUrl":"https://doi.org/10.1109/GRID.2004.60","url":null,"abstract":"The SOAP protocol underpins Web services as the standard mechanism for exchanging information in a distributed environment. The XML-based protocol offers advantages including extensibility, interoperability, and robustness. The merger of Web services and grid computing promotes SOAP into a standard protocol for the large-scale scientific applications that computational grids promise to support, further elevating the protocol's importance and requiring high-performance implementations. Various SOAP implementations differ in their implementation language, invocation model and API, and supported performance optimizations. In this paper we compare and contrast the performance of widely used SOAP toolkits and draw conclusions about their current performance characteristics. We also provide insights into various design features that can lead to optimized SOAP implementations. The SOAP implementations included in our study are gSOAP 2.4, AxisC++ CVS May 28, AxisJava 1.2, .NET 1.1.4322 and XS0AP4/XSUL 1.1.","PeriodicalId":335281,"journal":{"name":"Fifth IEEE/ACM International Workshop on Grid Computing","volume":"25 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":"115141149","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":"RDF-based schema mediation for database grid","authors":"Huajun Chen, Zhaohui Wu, Guozhou Zheng, Yuxin Mao","doi":"10.1109/GRID.2004.53","DOIUrl":"https://doi.org/10.1109/GRID.2004.53","url":null,"abstract":"In presence of grid where a huge amount of databases can be involved in sharing cycle, database tools and middlewares should be well suited for schema mediation and query processing in a semantically meaningful way. Dart is an implemented prototype system whose goal is to provide a semantic solution for database resource sharing capable of deployment in grid settings. This paper particularly concerns the problems of schema mediation in DartGrid. Our approach mainly involves the following notions: a) we use RDF/OWL to define the mediated ontologies for integration, b) we devise a set of rules for automatically converting the relational schema to RDF/OWL description called source data semantic, c) we define the source data semantic (source schema) as the view of shared ontologies (mediated schema), d) query is formulated and posed on the shared ontologies. A set of grid services is developed for the implementation of above functionalities.","PeriodicalId":335281,"journal":{"name":"Fifth IEEE/ACM International Workshop on Grid Computing","volume":"121 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":"128376827","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":"Parallel and Distributed Astronomical Data Analysis on Grid Datafarm","authors":"N. Yamamoto, O. Tatebe, S. Sekiguchi","doi":"10.1109/GRID.2004.47","DOIUrl":"https://doi.org/10.1109/GRID.2004.47","url":null,"abstract":"A comprehensive study of the whole petabyte-scale archival data of astronomical observatories has a possibility of new science and new knowledge in the field, while it was not feasible so far due to lack of enough data analysis environment. The Grid Datafarm architecture is designed for global petabyte-scale data-intensive computing, which provides a Grid file system with file replica management for fault tolerance and load balancing, and parallel and distributed data computing support for a set of files, to meet with the requirements of the comprehensive study of the whole archival data. In the paper, we discuss about worldwide parallel and distributed data analysis in the observational astronomical field. The archival data is stored, replicated and dispersed in a Gfarm file system. All the astronomical data analysis tools successfully access files in Gfarm file system without any code modification, using a syscall hooking library regardless of file replica locations. Performance evaluation of the parallel data analysis in several ways shows file-affinity process scheduling plays an essential role for scalable and efficient parallel file I/O performance. A data calibration tools shows scalable file I/O performance, and achieved the file I/O performance of 5.9 GB/sec and 4.0 GB/sec for reading and writing FITS files, respectively, using 30 cluster nodes (60 CPUs). On-demandfile replica creation mitigates the overhead of access concentration. Another tool shows the performance improvement at a factor of six for reading a shared file by creating file replicas","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":"124625868","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":"Resource management and knapsack formulations on the grid","authors":"R. Parra-Hernandez, D. Vanderster, N. Dimopoulos","doi":"10.1109/GRID.2004.54","DOIUrl":"https://doi.org/10.1109/GRID.2004.54","url":null,"abstract":"This work formulates the resource allocation problem on grids as a knapsack problem. The notion of utility is introduced, and it is used to effect allocation policies. Simulation results using a variety of allocation policies are presented and show that knapsack formulations optimally allocate resources congruent with the chosen policies.","PeriodicalId":335281,"journal":{"name":"Fifth IEEE/ACM International Workshop on Grid Computing","volume":"103 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":"124633873","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":"From sandbox to playground: dynamic virtual environments in the grid","authors":"K. Keahey, K. Doering, Ian T Foster","doi":"10.1109/GRID.2004.32","DOIUrl":"https://doi.org/10.1109/GRID.2004.32","url":null,"abstract":"Much experience has been gained with the protocols and mechanisms needed for discovery and allocation of remote computational resources. However, the preparation of a remote computer for use by a distributed application also requires the creation of an appropriate execution environment, which remains an ad hoc and often clumsy process. We propose here a codification of the interactions required to negotiate the creation of new execution environments. In brief we model dynamic virtual environments (DVEs) as first-class entities in a distributed environment, with grid service interfaces defined to negotiate creation, monitor properties, and manage lifetime. We also show how such DVEs can be implemented in a variety of technologies - sandboxes, virtual machines, or simply Unix accounts - and evaluate costs associated with these different approaches. DVEs provide a basis for both customization of a remote computer to meet user needs and also enforcement of resource usage and security policies. They can also simplify the administration of virtual organizations (VOs), by allowing new environments to be created automatically, subject to local and VO policy. Thus, DVEs have the potential to relieve much of the current administrative burden involved in providing and using grid resources.","PeriodicalId":335281,"journal":{"name":"Fifth IEEE/ACM International Workshop on Grid Computing","volume":"103 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":"116838416","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":"Distributed Ant: a system to support application deployment in the grid","authors":"W. Goscinski, D. Abramson","doi":"10.1109/GRID.2004.23","DOIUrl":"https://doi.org/10.1109/GRID.2004.23","url":null,"abstract":"e-Science has much to benefit from the emerging field of grid computing. However, construction of e-science grids is a complex and inefficient undertaking. In particular, deployment of user applications can present a major challenge due to the scale and heterogeneity of the grid. In spite of this, deployment is not supported by current grid computing middleware or configuration management systems, which focus on a super-user approach to application management. Hence, individual users with limited resource control deploy applications manually, which is not a grid scalable solution. This paper presents our motivation, design and implementation of a grid scalable, user-oriented, secure application deployment system, Distributed Ant (DistAnt). DistAnt extends the Ant build file environment to provide a flexible procedural deployment description and implements a set of deployment services.","PeriodicalId":335281,"journal":{"name":"Fifth IEEE/ACM International Workshop on Grid Computing","volume":"233 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":"121869016","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":"Failure detection and membership management in grid environments","authors":"Amit Jain, R. Shyamasundar","doi":"10.1109/GRID.2004.30","DOIUrl":"https://doi.org/10.1109/GRID.2004.30","url":null,"abstract":"Failure detectors are an integral part of any fault tolerant distributed system and hence have been a well-studied area. However, earlier proposed failure detectors fail to perform efficiently when applied to grid environments. Most of the earlier proposed detectors were either designed for local area networks or to handle small number of nodes and hence lack in areas such as scalability, efficiency, running times etc. In this paper we propose a highly scalable failure detector protocol that is aided by a membership management service. The membership management service is essential to make the failure detector transparent to changes in the system. Using a distributed heartbeat mechanism, for an unreliable failure detector, we have overcome the shortcomings of similar schemes proposed earlier. It realizes scalability by reducing context switching requirements and achieves faster failure detection. The membership management protocol handles membership issues with a worst case complexity of O(n) where n is the number of heartbeat groups. Note that n is much smaller than the total number of nodes in the grid. The algorithm is also shown to be failure resilient and scalable.","PeriodicalId":335281,"journal":{"name":"Fifth IEEE/ACM International Workshop on Grid Computing","volume":"44 8 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":"123077964","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}
M. Lawenda, N. Meyer, Marcin Okon, T. Rajtar, D. Stoklosa, D. Kaliszan, M. Stroinski
{"title":"Dynamic measurement scenarios in the virtual laboratory system","authors":"M. Lawenda, N. Meyer, Marcin Okon, T. Rajtar, D. Stoklosa, D. Kaliszan, M. Stroinski","doi":"10.1109/GRID.2004.25","DOIUrl":"https://doi.org/10.1109/GRID.2004.25","url":null,"abstract":"In the paper some dynamic measurement scenarios conception is presented. The dynamic measurement scenarios (DMS) are used for advanced workflow control in the virtual laboratory system. It facilitates defining and monitoring the measurement process from the preparation stage through experimental and computational processes to results analysis (based on the achieved visualization data). DMS often consists of many different tasks connected by links with specified conditions. To execute DMS we need a special application (during the definition process) on the one hand and on the other hand a sophisticated (and complex) module is needed for manage and control specified workflow. The described issues are illustrated by nuclear magnetic resonance (NMR) laboratory examples.","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":"114180274","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":"An efficient anonymity protocol for grid computing","authors":"Souvik Ray, Zhao Zhang","doi":"10.1109/GRID.2004.9","DOIUrl":"https://doi.org/10.1109/GRID.2004.9","url":null,"abstract":"As grid computing scales up in size and diversity, anonymous communications are desirable, and sometimes vital, for certain applications. However, existing anonymity protocols, when being applied to grid applications, either dramatically degrade system efficiency or cause severe performance bottlenecks. We found that a distributed and highly efficient anonymity protocol can be designed if one considers the existing trust in grids. We have designed such a protocol based on controlled anonymity, which maintains an entity's anonymity against untrustable entities. To our best knowledge, this protocol is the first one of its kind. Using the existing methods from anonymity studies, we quantitatively analyze the degree of anonymity that could be offered by this protocol, and use a simulator to confirm its efficiency advantage over the existing protocols.","PeriodicalId":335281,"journal":{"name":"Fifth IEEE/ACM International Workshop on Grid Computing","volume":"39 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":"123486038","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":"User-driven scheduling of interactive virtual machines","authors":"Bin Lin, P. Dinda, Dong Lu","doi":"10.1109/GRID.2004.64","DOIUrl":"https://doi.org/10.1109/GRID.2004.64","url":null,"abstract":"We are developing a distributed computing system, Virtuoso, which presents virtual machines (VMs) as its fundamental abstraction to end users. Long-running noninteractive VMs may coexist on the same host used to support VMs being used by highly interactive users. We must simultaneously provide high average computation rates to the noninteractive VMs while keeping the users of the interactive VMs happy. We report here an initial work on using direct user feedback to achieve this balance. The user is provided with a (physical or logical) button that can be pressed when he feels his machine is responding inadequately. In response, the scheduler boosts the priority of his VMs relative to the other VMs in the system. The priority then declines with time. The goal of the control algorithm driven by this mechanism is to maintain a targeted average time between button presses while simultaneously delivering a high compute rate to the other VMs.","PeriodicalId":335281,"journal":{"name":"Fifth IEEE/ACM International Workshop on Grid Computing","volume":"42 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":"127853276","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}