L. Weng, Ümit V. Çatalyürek, T. Kurç, G. Agrawal, J. Saltz
{"title":"Optimizing multiple queries on scientific datasets with partial replicas","authors":"L. Weng, Ümit V. Çatalyürek, T. Kurç, G. Agrawal, J. Saltz","doi":"10.1109/GRID.2007.4354141","DOIUrl":"https://doi.org/10.1109/GRID.2007.4354141","url":null,"abstract":"We propose strategies to efficiently execute a query workload, which consists of multiple related queries submitted against a scientific dataset, on a distributed-memory system in the presence of partial dataset replicas. Partial replication re-organizes and re-distributes one or more subsets of a dataset across the storage system to reduce I/O overheads and increase I/O parallelism. Our work targets a class of queries, called range queries, in which the query predicate specifies lower and upper bounds on the values of all or a subset of attributes of a dataset. Data elements whose attribute values fall into the specified bounds are retrieved from the dataset. If we think of the attributes of a dataset forming multi-dimensional space, where each attribute corresponds to one of the dimensions, a range query defines a bounding box in this multidimensional space. We evaluate our strategies in two scenarios involving range queries. The first scenario represents the case in which queries have overlapping regions of interest, such as those arising from an exploratory analysis of the dataset by multiple users. In the second scenario, queries represent adjacent rectilinear sections that capture an irregular subregion in the multi-dimensional space. This scenario corresponds to a case where the user wants to query and retrieve a spatial feature from the dataset. We propose cost models and an algorithm for optimizing such queries. Our results using queries for subsetting and analysis of medical image datasets show that effective use of partial replicas can result in reduction in query execution times.","PeriodicalId":304508,"journal":{"name":"2007 8th IEEE/ACM International Conference on Grid Computing","volume":"38 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":"129499207","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":"Experiments with in-transit processing for data intensive grid workflows","authors":"V. Bhat, M. Parashar, S. Klasky","doi":"10.1109/GRID.2007.4354133","DOIUrl":"https://doi.org/10.1109/GRID.2007.4354133","url":null,"abstract":"Efficient and robust data streaming and in-transit data manipulations are critical requirements of emerging scientific and engineering application workflows, which are based on seamless interactions and coupling between geographically distributed application components. The overall goal of this research is to address these requirements and develop a data streaming and in-transit data manipulation service. In this paper, we experimentally investigate reactive management strategies for in-transit data manipulation, as well as cooperative end-to-end management for wide-area data-streaming and in-transit data manipulation for data-intensive scientific and engineering workflows.","PeriodicalId":304508,"journal":{"name":"2007 8th IEEE/ACM International Conference on Grid Computing","volume":"27 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":"132629995","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 highly available job execution service in computational service market","authors":"Woochul Kang, H. H. Huang, A. Grimshaw","doi":"10.1109/GRID.2007.4354143","DOIUrl":"https://doi.org/10.1109/GRID.2007.4354143","url":null,"abstract":"One of the major challenges in managing resources of computational Grids with diverse shared resources is how to meet users' QoS requirements and rationally distribute resources at the same time. In particular, even though less reliable desktop PCs are dominant resource providers of computational Grids, they are often underutilized because they do not exhibit qualities required by typical scientific and business applications targeting computational Grids. Economy-based markets are expected to foster the utilization of those underutilized low quality resource via supply-and-demand. However, our experiment shows that price has its limitation in controlling the supply-and-demand in computational markets. This situation necessitates Highly Available Job Execution Service (HA-JES) which fosters the balanced resource consumption by dynamically and transparently replicating jobs with underutilized and under-priced resources. In particular, the process of job replication in HA-JES occurs in market-driven efficient way; underutilized and therefore cheap resources are exploited to build a high quality resource and hence facilitate balanced resource usage. Our simulation results show that HA-JES benefits all actors in the Grid market in terms of resource utilization, market capacity, and market stability.","PeriodicalId":304508,"journal":{"name":"2007 8th IEEE/ACM International Conference on Grid Computing","volume":"651 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":"123972404","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. Riedel, T. Eickermann, W. Frings, S. Dominiczak, Daniel Mallmann, T. Düssel, A. Streit, P. Gibbon, F. Wolf, W. Schiffmann, T. Lippert
{"title":"Design and evaluation of a collaborative online visualization and steering framework implementation for computational grids","authors":"M. Riedel, T. Eickermann, W. Frings, S. Dominiczak, Daniel Mallmann, T. Düssel, A. Streit, P. Gibbon, F. Wolf, W. Schiffmann, T. Lippert","doi":"10.1109/GRID.2007.4354130","DOIUrl":"https://doi.org/10.1109/GRID.2007.4354130","url":null,"abstract":"Today's large-scale scientific research often relies on the collaborative use of a Grid or c-Science infrastructure (e.g. DEISA, EGEE, TeraGrid, OSG) with computational, storage, or other types of physical resources. One of the goals of these emerging infrastructures is to support the work of scientists with advanced problem-solving tools. Many e-Science applications within these infrastructures aim at simulations of a scientific problem on powerful parallel computing resources. Typically, a researcher first performs a simulation for some fixed amount of time and then analyses results in a separate post-processing step, for instance, by viewing results in visualizations. In earlier work we have described early prototypes of a Collaborative Online Visualization and Steering (COVS) Framework in Grids that performs both -simulation and visualization -at the same time (online) to increase the efficiency of e-Scientists. This paper evaluates the evolved mature reference implementation of the COVS framework design that is ready for production usage within Web service-based Grid and e-Science infrastructures.","PeriodicalId":304508,"journal":{"name":"2007 8th IEEE/ACM International Conference on Grid Computing","volume":"51 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":"126707687","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":"On the dynamic resource availability in grids","authors":"A. Iosup, M. Jan, Omer Ozan Sonmez, D. Epema","doi":"10.1109/GRID.2007.4354112","DOIUrl":"https://doi.org/10.1109/GRID.2007.4354112","url":null,"abstract":"Currently deployed grids gather together thousands of computational and storage resources for the benefit of a large community of scientists. However, the large scale, the wide geographical spread, and at times the decision of the rightful resource owners to commit the capacity elsewhere, raises serious resource availability issues. Little is known about the characteristics of the grid resource availability, and of the impact of resource unavailability on the performance of grids. In this work, we make first steps in addressing this twofold lack of information. First, we analyze a long-term availability trace and assess the resource availability characteristics of Grid'5000, an experimental grid environment of over 2,500 processors. The average utilization for the studied trace is increased by almost 5%, when availability is considered. Based on the results of the analysis, we further propose a model for grid resource availability. Our analysis and modeling results show that grid computational resources become unavailable at a high rate, negatively affecting the ability of grids to execute long jobs. Second, through trace-based simulation, we show evidence that resource availability can have a severe impact on the performance of the grid systems. The results of this step show evidence that the performance of a grid system can rise when availability is taken into consideration, and that human administration of availability change information results in 10-15 times more job failures than for an automated monitoring solution, even for a lowly utilized system.","PeriodicalId":304508,"journal":{"name":"2007 8th IEEE/ACM International Conference on Grid Computing","volume":"17 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":"114401128","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":"Supporting adaptable applications in grid resource management systems","authors":"J. Buisson, F. André, Jean-Louis Pazat","doi":"10.1109/GRID.2007.4354116","DOIUrl":"https://doi.org/10.1109/GRID.2007.4354116","url":null,"abstract":"Grid computing promises to bring the resources to satisfy the increasing requirements of scientific applications. As grids result from several organizations that pool their computational resources, resource availability varies frequently inside grids. Relying on autonomous dynamic adaptability and managing dynamic collections of resources, technologies have been proposed in order to handle those variations at the level of applications. However, despite applications have evolved in order to fit better dynamic grid environments, grid resource managers still restrict to rigid jobs, thus inhibiting application adaptability and malleability. This paper discusses 3 options to overcome that restriction. Malleable job management can be built on top of existing unmodified infrastructures. It can also be implemented as a modification of the infrastructure. At last, we propose an intermediate approach that fosters the cooperation between the infrastructure and its users. Requiring an initial modification of the infrastructure, the latter design combines cost efficiency with possibility to further extend the job model without any additional modification of the infrastructure. In the discussion, qualitative arguments arc supported by some experimental results.","PeriodicalId":304508,"journal":{"name":"2007 8th IEEE/ACM International Conference on Grid Computing","volume":"41 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":"127574480","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":"Eliciting honest value information in a batch-queue environment","authors":"A. Mutz, R. Wolski, J. Brevik","doi":"10.1109/GRID.2007.4354145","DOIUrl":"https://doi.org/10.1109/GRID.2007.4354145","url":null,"abstract":"Markets and auctions have been proposed as mechanisms lor efficiently and fairly allocating resources in a number of different computational settings. Economic approaches to resource allocation in batch-controlled systems, however, have proved difficult due to the fact that, unlike reservation systems, every resource allocation decision made by the scheduler affects the turnaround time of all jobs in the queue. Economists refer to this characteristic as an \"externality\", where a transaction affects more than just the immediate resource consumer and producer. The problem is particularly acute for computational grid systems where organizations wish to engage in service-level agreements but are not at liberty to abandon completely the use of space-sharing and batch scheduling as the local control policies. Grid administrators desire the ability to make these agreements based on anticipated user demand, but eliciting truthful reportage of job importance and priority has proved difficult due to the externalities present when resources are batch controlled. In this paper we propose and evaluate the application of the Expected Externality Mechanism as an approach to solving this problem that is based on economic principles. In particular, this mechanism provides incentives for users to reveal information honestly about job importance and priority in an environment where batch-scheduler resource allocation decisions introduce \"externalities\" that affect all users. Our tests indicate that the mechanism meets its theoretical predictions in practice and can be implemented in a computationally tractable manner.","PeriodicalId":304508,"journal":{"name":"2007 8th IEEE/ACM International Conference on Grid Computing","volume":"281 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":"128578072","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":"Dynamic, context-aware, least-privilege grid delegation","authors":"Mehran Ahsant, J. Basney, Lennart Johnsson","doi":"10.1109/GRID.2007.4354135","DOIUrl":"https://doi.org/10.1109/GRID.2007.4354135","url":null,"abstract":"Performing delegation in large scale, dynamic and distributed environments with large numbers of shared resources is more challenging than inside local administrative domains. In dynamic environments like Grids, on one hand, delegating a restricted set of rights reduces exposure to attack but also limits the flexibility and dynamism of the application; on the other hand, delegating all rights provides maximum flexibility but increases exposure. This issue has not yet been adequately addressed by current Grid security mechanisms and is becoming a very challenging and crucial issue for future Grid development. Therefore, providing an effective delegation mechanism which meets the requirements of the least privilege principle is becoming an essential need. Furthermore, we are witnessing a phenomenal increase in the automation of organizational tasks and decision making, as well as the computerization of information related services, requiring automated delegation mechanisms. In order to meet these requirements we introduce an Active Delegation Framework which extends our previous work on on-demand delegation, making it context-aware. The framework provides a just-in-time, restricted and dynamic delegation mechanism for Grids. In this paper we describe the development of this framework and its implementation and integration with the Globus Toolkit.","PeriodicalId":304508,"journal":{"name":"2007 8th IEEE/ACM International Conference on Grid Computing","volume":"8 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":"124491899","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":"Grid 3.0: Services, semantics and society","authors":"C. Goble, D. D. Roure","doi":"10.1109/GRID.2007.4354108","DOIUrl":"https://doi.org/10.1109/GRID.2007.4354108","url":null,"abstract":"The trend in recent years in distributed computing and distributed information systems has been to open up: to expose interfaces and content outside the bounds of the originating application, resource or middleware; to simplify access to third party resources, data and capability; and to actively encourage and support creativity through the reuse and combination of already available components and content, be they ours or others. The ubiquity of the Service Oriented Architecture (SOA) is testament to the driver, in both industry and scientific research, for more agile solutions, more rapid development, more flexibility and more opportunity for effective use of what has gone before. The rise of the web service and its adoption for Grids are examples. In the sciences the web service has become established as the delivery mechanism for publicly available data sets and tools. Designing reusable components and enabling content to be reusable is tough; finding it. and correctly understanding and using it is even tougher, especially when the consumer is not the producer. Another concern is the gap between the infrastructure and resource provider and the application developer and user. Infrastructure has no value other than to enable applications. In the Grid we seem to have done a good job enabling Virtual Organisations of resource providers through virtualisation and provisioning.","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":"128746126","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":"Market-based grid resource allocation using a stable continuous double auction","authors":"Zhuo Tan, J. Gurd","doi":"10.1109/GRID.2007.4354144","DOIUrl":"https://doi.org/10.1109/GRID.2007.4354144","url":null,"abstract":"A market-based grid resource allocation mechanism is presented and evaluated. It takes into account the architectural features and special requirements of computational grids while ensuring economic efficiency, even when the underlying resources are being used by self-interested and uncooperative participants. A novel stable continuous double auction (SCDA), based on the more conventional continuous double auction (CDA), is proposed for Grid resource allocation. It alleviates the unnecessarily volatile behaviour of the CDA, while maintaining other beneficial features. Experimental results show that the SCDA is superior to the CDA in terms of both economic efficiency and scheduling efficiency. The SCDA delivers continuous matching, high efficiency and low cost, allied with low price volatility and low bidding complexity. Its ability to deliver immediate allocation and its stable prices facilitate co-allocation of resources and it also enables incremental evolution towards a full grid resource market. Effective market-based Grid resource allocation is thus shown to be feasible.","PeriodicalId":304508,"journal":{"name":"2007 8th IEEE/ACM International Conference on Grid Computing","volume":"51 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":"128587524","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}