{"title":"Efficient access to many small files in a filesystem for grid computing","authors":"D. Thain, Christopher Moretti","doi":"10.1109/GRID.2007.4354139","DOIUrl":"https://doi.org/10.1109/GRID.2007.4354139","url":null,"abstract":"Many potential users of grid computing systems have a need to manage large numbers of small files. However, computing and storage grids are generally optimized for the management of large files. As a result, users with small files achieve performance several orders of magnitude worse than possible. Archival tools and custom storage structures can be used to improve small-file performance, but this requires the end user to change the behavior of the application, which is not always practical. To address this problem, we augment the protocol of the Chirp filesystem for grid computing to improve small file performance. We describe in detail how this protocol compares to FTP and NFS, which are widely used in similar situations. In addition, we observe that changes to the system call interface are necessary to invoke the protocol properly. We demonstrate an order-of-magnitude performance improvement over existing protocols for copying files and manipulating large directory trees.","PeriodicalId":304508,"journal":{"name":"2007 8th IEEE/ACM International Conference on Grid Computing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130581053","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":"Fair resource sharing in hierarchical virtual organizations for global grids","authors":"K. Kim, R. Buyya","doi":"10.1109/GRID.2007.4354115","DOIUrl":"https://doi.org/10.1109/GRID.2007.4354115","url":null,"abstract":"In global grid computing, users and resource providers organize various virtual organizations (VOs) to share resources and services. A VO organizes other sub-VOs for the purpose of achieving the VO goal, which forms hierarchical VO environments. Resource providers and VOs agree upon VO resource sharing policies, such as resource sharing amount. Thus, users in lower-layer VOs can access resources in higher-layer VOs to accomplish their common goals. In this paper, we deal with fair resource allocation problem in hierarchical VOs, so that an appropriate proportion of a VO resource for each lower-layer VO is analyzed. In addition, we provide a resource allocation scheme based on these predefined proportions. Simulation results show that the proposed approach gives better fairness as well as performance compared with other schemes.","PeriodicalId":304508,"journal":{"name":"2007 8th IEEE/ACM International Conference on Grid Computing","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130091809","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. Humphrey, Sang-Min Park, Jun Feng, N. Beekwilder, G. Wasson, J. Hogg, Brian A. LaMacchia, B. Dillaway
{"title":"Fine-grained access control for GridFTP using SecPAL","authors":"M. Humphrey, Sang-Min Park, Jun Feng, N. Beekwilder, G. Wasson, J. Hogg, Brian A. LaMacchia, B. Dillaway","doi":"10.1109/GRID.2007.4354136","DOIUrl":"https://doi.org/10.1109/GRID.2007.4354136","url":null,"abstract":"Grid access control policy languages today are generally one of two extremes: either extremely simplistic, or overly complex and challenging for even security experts to use. In this paper, we explicitly identify requirements for an access control policy language for grid data and then consider six specific data access use-cases that have been problematic in today's grids: attribute-based access, role-based access, \"role-deny\" access, impersonation-based access, delegation-based access, and capability-based access. We evaluate the security policy assertion language (SecPAL) against those requirements, specifically in the context of these six use-cases involving GridFTP.NET. We find that while some of these six use-cases are individually possible via existing Grid authorization systems, we believe that SecPAL uniquely offers a single approach that meets the requirements of a grid access control policy language, thereby creating support for a wide range of expanded scenarios for grid data access.","PeriodicalId":304508,"journal":{"name":"2007 8th IEEE/ACM International Conference on Grid Computing","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134387738","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":"Multi-state grid resource availability characterization","authors":"Brent Rood, M. Lewis","doi":"10.1109/GRID.2007.4354114","DOIUrl":"https://doi.org/10.1109/GRID.2007.4354114","url":null,"abstract":"The functional heterogeneity of non-dedicated computational grids will increase with the inclusion of resources from desktop grids, P2P systems, and even mobile grids. Machine failure characteristics, as well as individual and organizational policies for resource usage by the grid, will increasingly vary even more than they already do. Since grid applications also vary as to how well they tolerate the failure of the host on which they run, grid schedulers must begin to predict and consider how resources will transition between availability modes. Toward this goal, this paper introduces five availability states, and characterizes a Condor pool trace that uncovers when, how, and why its resources reside in, and transition between, these states. This characterization suggests resource categories that schedulers can use to make better mapping decisions. Simulations that characterize how a variety of jobs would run on the traced resources demonstrate this approach's potential for performance improvement. A simple predictor based on the previous day's behavior indicates that the states and categories arc somewhat predictable, thereby supporting the potential usefulness of multi-state grid resource availability characterization.","PeriodicalId":304508,"journal":{"name":"2007 8th IEEE/ACM International Conference on Grid Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130824475","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":"Adaptive pricing for resource reservations in Shared environments","authors":"Gurmeet Singh, C. Kesselman, E. Deelman","doi":"10.1109/GRID.2007.4354118","DOIUrl":"https://doi.org/10.1109/GRID.2007.4354118","url":null,"abstract":"Application scheduling studies on large-scale shared resources have advocated the use of resource provisioning in the form of advance reservations for providing predictable and deterministic quality of service to applications. Resource scheduling studies however have shown the adverse impact of advance reservations in the form of reduced utilization and increased response time of the resources. Thus, resource providers either disallow reservations or impose restrictions such as minimum notice periods and this reduces the effectiveness of reservations as the means of allocating desired resources at a desired time. In this paper, we suggest adaptive pricing as an alternative for allowing reservation of resources. The price charged for allowing a reservation is based directly on the impact that the reservation has on other users sharing the resource. Using trace-based simulations, we show that adaptive pricing allows users to make reservations at the desired time while making it more expensive than best effort service. Thus, users arc induced to make the correct choice between reservations and best-effort service based on their real needs. Moreover, this pricing scheme is more cost effective and sensitive to the system load as compared to a flat pricing scheme and encourages load balancing across resources.","PeriodicalId":304508,"journal":{"name":"2007 8th IEEE/ACM International Conference on Grid Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123757004","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 ActOn-based semantic information service for EGEE","authors":"W. Xing, Óscar Corcho, C. Goble, M. Dikaiakos","doi":"10.1109/GRID.2007.4354119","DOIUrl":"https://doi.org/10.1109/GRID.2007.4354119","url":null,"abstract":"We describe an information service that aggregates metadata available in hundreds of information sources of the EGEE Grid infrastructure. It uses an ontology-based information integration architecture (ActOn), which is suitable the highly dynamic distributed information sources available in Grid systems, where information changes frequently and where the information of distributed sources has to be aggregated in order to solve complex queries. These two challenges are addressed by a metadata cache that works with an update-on-demand policy and by an information source selection module that selects the most suitable source at a given point in time, respectively. We have evaluated the quality of this information service, and compared it with other similar services from the EGEE production testbed, with promising results.","PeriodicalId":304508,"journal":{"name":"2007 8th IEEE/ACM International Conference on Grid Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131378444","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":"Multi-objective planning for workflow execution on Grids","authors":"Jia Yu, M. Kirley, R. Buyya","doi":"10.1109/GRID.2007.4354110","DOIUrl":"https://doi.org/10.1109/GRID.2007.4354110","url":null,"abstract":"Utility grids create an infrastructure for enabling users to consume services transparently over a global network. When optimizing workflow execution on utility grids, we need to consider multiple quality of service (QoS) parameters including service prices and execution time. These optimization objectives may be in conflict. In this paper, we have proposed a workflow execution planning approach using multi-objective evolutionary algorithms (MOEAs). Our goal was to generate a set of trade-off scheduling solutions according to the users QoS requirements. The alternative trade-off solutions offer more flexibility to users when estimating their QoS requirements of workflow executions. Simulation results show that MOEAs are able to find a range of compromise solutions in a short computational time.","PeriodicalId":304508,"journal":{"name":"2007 8th IEEE/ACM International Conference on Grid Computing","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132630572","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":"Pluggable grid services","authors":"J. Sobral","doi":"10.1109/GRID.2007.4354123","DOIUrl":"https://doi.org/10.1109/GRID.2007.4354123","url":null,"abstract":"This paper introduces a new concept of pluggable grill service, that provides seamless access to computational grids, based on aspect-oriented techniques. Pluggable grid services avoid explicit calls to grid services in scientific codes, localize grid-specific concerns into well defined modules and can be (un)plugged from scientific codes. Domain specific code becomes oblivious of grid issues, allowing scientists to concentrate on domain specific issues, and to manage grid issues by composing grid-specific modules. This paper presents a collection of pluggable grid services that illustrates the idea and shows how pluggable grid services can grid-enable a skeleton framework.","PeriodicalId":304508,"journal":{"name":"2007 8th IEEE/ACM International Conference on Grid Computing","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126886850","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 cost-based multi-unit resource auction for service-oriented grid computing","authors":"M. Schwind, O. Hinz, R. Beck","doi":"10.1109/GRID.2007.4354126","DOIUrl":"https://doi.org/10.1109/GRID.2007.4354126","url":null,"abstract":"The application of Grid technology is at the transition from engineering and natural science-related industrial sectors to other industries that have a high demand for computing resources. However, the diffusion of Grid technology within industrial sectors which are not naturally engineering and natural science-related is often hindered by a lack of incentives to share the computational resources. A promising way to overcome these barriers is the introduction of economically inspired mechanisms for the use of Grid-based resources. Our work introduces a iterated cost-based multi-unit resource auction (CMRA) and compares a traditional cost-based accounting approach with dedicated servers as well as a pooling approach with regard to service quality and total costs. The cost-calculus used in our model is based on costs for the delayed processing of jobs and costs for the cancellation of these jobs if the job cannot be provided at a certain time span in the worst case. The simulation results indicate that pooling of IT resources by Grid technology can produce a reduction of 20.3% in cost within this model compared to dedicated servers in the computing centers. However, with the CMRA-based allocation of computing resources, a further 1.4% of cost reduction can be achieved while the achieved quality-of-service (QoS) can be significantly increased. Finally we think that there must be a further cost reduction potential for Grid solutions beyond these savings that can be achieved by using economically inspired allocation methods that are combined with advanced refining and learning methods.","PeriodicalId":304508,"journal":{"name":"2007 8th IEEE/ACM International Conference on Grid Computing","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130415395","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 scalable framework for parallel discrete event simulations on desktop grids","authors":"Alfred Park, R. Fujimoto","doi":"10.1109/GRID.2007.4354132","DOIUrl":"https://doi.org/10.1109/GRID.2007.4354132","url":null,"abstract":"Utilizing desktop grid infrastructures is challenging for parallel discrete event simulation (POES) codes due to characteristics such as inter-process messaging, restricted execution, and overall lower concurrency than typical volunteer computing projects. The Aurora2 system uses an approach that simultaneously provides both replicated execution support and scalable performance of PDES applications through public resource computing. This is accomplished through a multithreaded distributed back-end system, low overhead communications middleware, and an efficient client implementation. This paper describes the Aurora2 architecture and issues pertinent to PDES executions in a desktop grid environment that must be addressed when distributing back-end services across multiple machines. We quantify improvement over the first generation Aurora system through a comparative performance study detailing PDES programs with various scalability characteristics for execution over desktop grids.","PeriodicalId":304508,"journal":{"name":"2007 8th IEEE/ACM International Conference on Grid Computing","volume":"622 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131993911","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}