Results 1 - 10
of
39
The AppLeS Parameter Sweep Template: User-Level Middleware for the Grid
, 2000
"... The Computational Grid is a promising platform for the efficient execution of parameter sweep applications over large parameter spaces. To achieve performance on the Grid, such applications must be scheduled so that shared data files are strategically placed to maximize reuse, and so that the applic ..."
Abstract
-
Cited by 181 (25 self)
- Add to MetaCart
The Computational Grid is a promising platform for the efficient execution of parameter sweep applications over large parameter spaces. To achieve performance on the Grid, such applications must be scheduled so that shared data files are strategically placed to maximize reuse, and so that the application execution can adapt to the deliverable performance potential of target heterogeneous, distributed and shared resources. Parameter sweep applications are an important class of applications and would greatly benefit from the development of Grid middleware that embeds a scheduler for performance and targets Grid resources transparently. In this paper we describe a user-level Grid middleware project, the AppLeS Parameter Sweep Template (APST), that uses application-level scheduling techniques [1] and various Grid technologies to allow the efficient deployment of parameter sweep applications over the Grid. We discuss...
Heuristics for Scheduling Parameter Sweep Applications in Grid Environments
, 2000
"... The Computational Grid provides a promising platform for the efficient execution of parameter sweep applications over very large parameter spaces. Scheduling such applications is challenging because target resources are heterogeneous, because their load and availability varies dynamically, and becau ..."
Abstract
-
Cited by 136 (22 self)
- Add to MetaCart
The Computational Grid provides a promising platform for the efficient execution of parameter sweep applications over very large parameter spaces. Scheduling such applications is challenging because target resources are heterogeneous, because their load and availability varies dynamically, and because independent tasks may share common data files. In this paper, we propose an adaptive scheduling algorithm for parameter sweep applications on the Grid. We modify standard heuristics for task/host assignment in perfectly predictable environments (Max-min, Min-min, Sufferage), and we propose an extension of Sufferage called XSufferage. Using simulation, we demonstrate that XSufferage can take advantage of file sharing to achieve better performance than the other heuristics. We also study the impact of inaccurate performance prediction on scheduling. Our study shows that: (i) different heuristics behave differently when predictions are inaccurate; (ii) increased adaptivity leads to better performance.
Adaptive Computing on the Grid Using AppLeS
, 2003
"... Ensembles of distributed, heterogeneous resources, also known as Computational Grids are emerging as critical platforms for high-performance and resource-intensive applications. Such platforms provide the potential for applications to aggregate enormous bandwidth, computational power, memory, second ..."
Abstract
-
Cited by 90 (7 self)
- Add to MetaCart
Ensembles of distributed, heterogeneous resources, also known as Computational Grids are emerging as critical platforms for high-performance and resource-intensive applications. Such platforms provide the potential for applications to aggregate enormous bandwidth, computational power, memory, secondary storage, and other resources during a single execution. However, achieving this performance potential in dynamic, heterogeneous environments is challenging. Recent experience with distributed applications indicates that adaptivity is fundamental to achieving application performance in dynamic Grid environments. The AppLeS (Application Level Scheduling) project provides a methodology, application software, and software environments for adaptively scheduling and deploying applications in dynamic, heterogeneous, multi-user Grid environments. In this paper, we discuss the AppLeS project and outline our results.
Analyzing Market-Based Resource Allocation Strategies for the Computational Grid
- International Journal of High Performance Computing Applications
, 2001
"... In this paper, we investigate G-commerce — computational economies for controlling resource allocation in Computational Grid settings. We define hypothetical resource consumers (representing users and Grid-aware applications) and resource producers (representing resource owners who “sell ” their res ..."
Abstract
-
Cited by 79 (2 self)
- Add to MetaCart
In this paper, we investigate G-commerce — computational economies for controlling resource allocation in Computational Grid settings. We define hypothetical resource consumers (representing users and Grid-aware applications) and resource producers (representing resource owners who “sell ” their resources to the Grid). We then measure the efficiency of resource allocation under two different market conditions: commodities markets and auctions. We compare both market strategies in terms of price stability, market equilibrium, consumer efficiency, and producer efficiency. Our results indicate that commodities markets are a better choice for controlling Grid resources than previously defined auction strategies. 1
Modeling Machine Availability in Enterprise and Wide-area Distributed Computing Environments
- In Euro-Par’05
, 2003
"... In this paper, we consider the problem of modeling machine availability in enterprise-area and wide-area distributed computing settings. Using availability data gathered from three different environments, we detail the suitability of four potential statistical distributions for each data set: expone ..."
Abstract
-
Cited by 51 (7 self)
- Add to MetaCart
In this paper, we consider the problem of modeling machine availability in enterprise-area and wide-area distributed computing settings. Using availability data gathered from three different environments, we detail the suitability of four potential statistical distributions for each data set: exponential, Pareto, Weibull, and hyperexponential. In each case, we use software we have developed to determine the necessary parameters automatically from each data collection.
PARDIS: A Parallel Approach to CORBA
- In 6th IEEE International Symposium on High Performance Distributed Computation
, 1997
"... This paper describes PARDIS, a system carrying explicit support for interoperability of PARallel DIStributed applications. PARDIS is closely based on the Common Object Request Broker Architecture (CORBA) [OMG95]. Like CORBA, it provides interoperability between heterogeneous components by specifying ..."
Abstract
-
Cited by 40 (10 self)
- Add to MetaCart
This paper describes PARDIS, a system carrying explicit support for interoperability of PARallel DIStributed applications. PARDIS is closely based on the Common Object Request Broker Architecture (CORBA) [OMG95]. Like CORBA, it provides interoperability between heterogeneous components by specifying their interfaces in a meta-language, the CORBA IDL, which can be translated into the language of interacting components, also providing interaction in a distributed domain. In order to provide support for interacting parallel applications, PARDIS extends the CORBA object model by a notion of an SPMD object. SPMD objects allow the request broker to interact directly with the distributed resources of a parallel application. To support distributed argument transfer, PARDIS introduces the notion of a distributed sequence --- a generalization of a CORBA sequence representing distributed data structures of parallel applications. In this report we will give a brief description of basic component i...
Grid Resource Allocation and Control Using Computational Economies
- Grid Computing: Making the Global Infrastructure a Reality
, 2003
"... In this chapter, we describe the use of economic principles as the basis for Grid resource allocation policies and mechanisms. A computational economy in which users “buy ” resources from their owners is an attractive method of controlling Grid resource allocation for several reasons. Economies are ..."
Abstract
-
Cited by 39 (0 self)
- Add to MetaCart
In this chapter, we describe the use of economic principles as the basis for Grid resource allocation policies and mechanisms. A computational economy in which users “buy ” resources from their owners is an attractive method of controlling Grid resource allocation for several reasons. Economies are intuitively easy to understand, they fit the model of flexible resource usage under local control (which is fundamental to Grid computing), and they can be analyzed through a considerable body of extant theory. We discuss many of the fundamental characteristics of computational economies, particularly as they pertain to Grid computing. We also present G-commerce — a framework that we have used to investigate Grid resource economies — as an example of the type of results that are possible. Finally, we discuss several of the issues associated with empirical investigation of Grid economies as a motivation for future work. 1
Adaptive Scheduling for Task Farming with Grid Middleware
, 1999
"... Scheduling in metacomputing environments is an active field of research as the vision of a Computational Grid becomes more concrete. An important class of Grid applications are long-running parallel computations with large numbers of somewhat independent tasks (Monte-Carlo simulations, parameter- ..."
Abstract
-
Cited by 29 (5 self)
- Add to MetaCart
Scheduling in metacomputing environments is an active field of research as the vision of a Computational Grid becomes more concrete. An important class of Grid applications are long-running parallel computations with large numbers of somewhat independent tasks (Monte-Carlo simulations, parameter-space searches, etc.). A number of Grid middleware projects are available to implement such applications but scheduling strategies are still open research issues. This is mainly due to the diversity of both Grid resource types and of their availability patterns. The purpose of this work is to develop and validate a general adaptive scheduling algorithm for task farming applications along with a user interface that makes the algorithm accessible to domain scientists. Our algorithm is general in that it is not tailored to a particular Grid middleware and that it requires very few assumptions concerning the nature of the resources. Our first testbed is NetSolve as it allows quick and ea...
Applying scheduling and tuning to on-line parallel tomography
- In Supercomputing 2001
, 2001
"... Tomography is a popular technique to reconstruct the three-dimensional structure of an object from a series of two-dimensional projections. Tomography is resource-intensive and deployment of a parallel implementation onto Computational Grid platforms has been studied in previous work. In this work, ..."
Abstract
-
Cited by 24 (2 self)
- Add to MetaCart
Tomography is a popular technique to reconstruct the three-dimensional structure of an object from a series of two-dimensional projections. Tomography is resource-intensive and deployment of a parallel implementation onto Computational Grid platforms has been studied in previous work. In this work, we address on-line execution of the application where computation is performed as data is collected from an on-line instrument. The goal is to compute incremental 3-D reconstructions that provide quasi-real-time feedback to the user. We model on-line parallel tomography as a tunable application: trade-offs between resolution of the reconstruction and frequency of feedback can be used to accommodate various resource
Self-adapting numerical software for next generation applications
- Int. J. High Perf. Comput. Appl
, 2002
"... The challenge for the development of next generation software is the successful management of the complex grid environment while delivering to the scientist the full power of flexible compositions of the available algorithmic alternatives. Self-Adapting Numerical Software (SANS) systems are intended ..."
Abstract
-
Cited by 23 (7 self)
- Add to MetaCart
The challenge for the development of next generation software is the successful management of the complex grid environment while delivering to the scientist the full power of flexible compositions of the available algorithmic alternatives. Self-Adapting Numerical Software (SANS) systems are intended to meet this significant challenge. A SANS system comprises intelligent next generation numerical software that domain scientists – with disparate levels of knowledge of algorithmic and programmatic complexities of the underlying numerical software – can use to easily express and efficiently solve their problem. The components of a SANS system are: • A SANS agent with: – An intelligent component that automates method selection based on data, algorithm and system attributes. – A system component that provides intelligent management of and access to the computational grid. – A history database that records relevant information generated by the intelligent component and maintains past performance data of the interaction (e.g., algorithmic, hardware specific, etc.) between SANS components. • A simple scripting language that allows a structured multilayered implementation of the SANS while ensuring portability and extensibility of the user interface and underlying libraries. • An XML/CCA-based vocabulary of metadata to describe behavioural properties of both data and algorithms. • System components, including a runtime adaptive scheduler, and prototype libraries that automate the process of architecture-dependent tuning to optimize performance on different platforms. A SANS system can dramatically improve the ability of computational scientists to model complex, interdisciplinary phenomena with maximum efficiency and a minimum of extra-domain expertise. SANS innovations (and their generalizations) will provide to the scientific and engineering community a dynamic computational environment in which the most effective library components are automatically selected based on the problem characteristics, data attributes, and the state of the grid. 1

