Showing papers by "Carl Kesselman published in 2009"
01 Jul 2009
TL;DR: Montage as discussed by the authors is a portable software toolkit to construct custom, science-grade mosaics that preserve the astrometry and photometry of astronomical sources, which can be run on both single and multi-processor computers, including clusters and grids.
Abstract: Montage is a portable software toolkit to construct custom, science-grade mosaics that preserve the astrometry and photometry of astronomical sources. The user specifies the dataset, wavelength, sky location, mosaic size, coordinate system, projection, and spatial sampling. Montage supports massive astronomical datasets that may be stored in distributed archives. Montage can be run on both single- and multi-processor computers, including clusters and grids. Standard grid tools are used to access remote data or run Montage on remote computers. This paper describes the architecture, algorithms, performance, and usage of Montage as both a software toolkit and a grid portal.
165 citations
TL;DR: This paper defines a design framework for RLSs that supports a variety of deployment options and describes the RLS implementation that is distributed with the Globus toolkit and is in production use in several grid deployments.
Abstract: Distributed computing systems employ replication to improve overall system robustness, scalability, and performance. A replica location service (RLS) offers a mechanism to maintain and provide information about physical locations of replicas. This paper defines a design framework for RLSs that supports a variety of deployment options. We describe the RLS implementation that is distributed with the Globus toolkit and is in production use in several grid deployments. Features of our modular implementation include the use of soft-state protocols to populate a distributed index and Bloom filter compression to reduce overheads for distribution of index information. Our performance evaluation demonstrates that the RLS implementation scales well for individual servers with millions of entries and up to 100 clients. We describe the characteristics of existing RLS deployments and discuss how RLS has been integrated with higher-level data management services.
64 citations
TL;DR: This paper examines two strategies for integrating reservations within the resource management fabric that address concerns by either minimizing the adverse impact of a reservation on the other users or enabling a resource provider to recoup losses through a differentiated pricing mechanism.
Abstract: Resources in distributed infrastructure such as the grid are typically autonomously managed and shared across a distributed set of end users. These characteristics result in a fundamental conflict: resource providers optimize for throughput and utilization which coupled with a stochastic multiuser workload results in nondeterministic best effort service for any one application. This conflicts with the user who wants to optimize end-to-end application performance but is constrained by the best effort service offering. Resource reservations can be used to obtain more predictable application behaviors but they are generally not allowed due to perceived impact on the other users and overall resource utilization. In this paper, we examine two strategies for integrating reservations within the resource management fabric that address these concerns by either minimizing the adverse impact of a reservation on the other users or enabling a resource provider to recoup losses through a differentiated pricing mechanism. Correspondingly, we also present algorithms for optimizing the application performance when resources provide automated reservations using the previously developed strategies. These algorithms use a cost based model to identify the set of reservations to be made for the application in order to optimize performance while minimizing the cost for the reservations. The cost based model allows the users to do a tradeoff between the application performance and resulting resource costs. Using trace-based simulations and task graph structured applications, we compare the application performance and resource cost when it is executed using reservations to that when only best effort service is available. We show the approach incorporating reservations can provide superior performance for the application at a price that the user can predetermine. Also, the benefits of using the reservation-based approach become more pronounced when the resources are under high utilization and/or the applications have significant resource requirements.
6 citations