Holly Dail
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Holly Dail has a total of 79 co-authors. Here are the top co-authors by number of shared publications:
H. Casanova
University of California at San Diego
4 shared publicationsF. Berman
University of California at San Diego
3 shared publicationsA. Dasgupta
Rice University
2 shared publicationsA. Olugbile
University of California at San Diego
2 shared publicationsA. Su
LIP Laboratory (UMR CNRS, ENS Lyon, INRIA, UCBL 5668) / GRAAL Project
2 shared publicationsA. YarKhan
University of Tennessee
2 shared publications
Latest Publications
- 1 January 2012
- Published by MBLWHOI Library
Atlantic Ocean circulation at the Last Glacial Maximum : inferences from data and models
- 1 January 2012
- Published by MBLWHOI Library
Atlantic Ocean circulation at the Last Glacial Maximum : inferences from data and models
- 1 January 2010
- Published by Elsevier in Deep Sea Research Part II: Topical Studies in Oceanography
- Vol. 57 (1-2) , 5-26
Evolution and dynamics of the flow through Herald Canyon in the western Chukchi Sea
- 1 January 2010
- Published by Elsevier in Deep Sea Research Part II: Topical Studies in Oceanography
- Vol. 57 (1-2) , 5-26
Evolution and dynamics of the flow through Herald Canyon in the western Chukchi Sea
- 1 November 2006
- Published by SAGE Publications in The International Journal of High Performance Computing Applications
- Vol. 20 (4) , 517-530
Automatic Middleware Deployment Planning On Clusters
The use of remotely distributed computing resources as a single system offers great potential for compute-intensive applications. Increasingly, users have access to hundreds or thousands of machines at once and wish to utilize those resources concurrently. To provide a reasonable user experience, such systems must provide an effective, scalable scheduling system. Unfortunately, the great majority of job schedulers are centralized and many do not scale well to thousands or even hundreds of nodes. In this paper we study how distributed scheduling systems can be designed most effectively; we focus on the problem of selecting an optimal arrangement of schedulers, or a deployment, for hierarchically organized systems. We show that the optimal deployment is a complete spanning d-ary tree; this result conforms with results from the scheduling literature. More importantly, we present an approach for determining the optimal degree d for the tree. To test our approach, we use DIET, a middleware system that uses hierarchical schedulers. We develop detailed performance models for DIET and validate these models in a real-world environment. Finally, we demonstrate that our approach selects deployments that are near-optimal in practice.
- 1 November 2006
- Published by SAGE Publications in The International Journal of High Performance Computing Applications
- Vol. 20 (4) , 517-530
Automatic Middleware Deployment Planning On Clusters
The use of remotely distributed computing resources as a single system offers great potential for compute-intensive applications. Increasingly, users have access to hundreds or thousands of machines at once and wish to utilize those resources concurrently. To provide a reasonable user experience, such systems must provide an effective, scalable scheduling system. Unfortunately, the great majority of job schedulers are centralized and many do not scale well to thousands or even hundreds of nodes. In this paper we study how distributed scheduling systems can be designed most effectively; we focus on the problem of selecting an optimal arrangement of schedulers, or a deployment, for hierarchically organized systems. We show that the optimal deployment is a complete spanning d-ary tree; this result conforms with results from the scheduling literature. More importantly, we present an approach for determining the optimal degree d for the tree. To test our approach, we use DIET, a middleware system that uses hierarchical schedulers. We develop detailed performance models for DIET and validate these models in a real-world environment. Finally, we demonstrate that our approach selects deployments that are near-optimal in practice.
- 21 July 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 339-340
How should you structure your hierarchical scheduler?
In this paper we study how distributed scheduling systems can be designed most effectively; we focus on the problem of selecting an optimal arrangement of schedulers, or a deployment, for hierarchically organized systems. We show that the optimal deployment is a complete spanning d-ary tree; this result conforms with results from the scheduling literature. More importantly, we present an approach for determining the optimal degree d for the tree. We test our approach using DIET, a network-enabled server system that uses hierarchical schedulers. Finally, we demonstrate that our approach selects deployments that are near-optimal in practice.
- 21 July 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 339-340
How should you structure your hierarchical scheduler?
In this paper we study how distributed scheduling systems can be designed most effectively; we focus on the problem of selecting an optimal arrangement of schedulers, or a deployment, for hierarchically organized systems. We show that the optimal deployment is a complete spanning d-ary tree; this result conforms with results from the scheduling literature. More importantly, we present an approach for determining the optimal degree d for the tree. We test our approach using DIET, a network-enabled server system that uses hierarchical schedulers. Finally, we demonstrate that our approach selects deployments that are near-optimal in practice.
- 1 February 2006
- Published by SAGE Publications in The International Journal of High Performance Computing Applications
- Vol. 20 (1) , 143-157
Experiences with Hierarchical Request Flow Management for Network-Enabled Server Environments
The Distributed Interactive Engineering Toolbox (DIET) is a toolbox for the construction of network-enabled server systems. DIET servers provide transparent access to compute resources; resources can be either a single, interactive machine where the DIET server runs each request directly on its host, or batch-managed systems where the DIET server manages request submission and completion notification. A distributed hierarchy of scheduling agents connects the servers and is responsible for selecting servers appropriate to each client request. DIET seeks scalability by distributing the scheduling process and by keeping resource information measurement and performance prediction at the server level. DIET has traditionally offered an on-line scheduling model whereby all requests are scheduled immediately or refused. This approach can overload interactive servers in high-load conditions and does not allow adaptation of the schedule to task or data dependences. In this paper we consider an alternative model based on active management of the flow of requests throughout the system. We have added support for (1) limiting the number of concurrent requests on interactive servers, (2) server and agentlevel queues, and (3) window-based scheduling algorithms whereby the request release rate to servers can be controlled and some rearrangement of request to host mappings is possible. We present experiments demonstrating that these approaches can improve performance and that the overheads introduced are not significantly different from those of the standard DIET approach.
- 1 February 2006
- Published by SAGE Publications in The International Journal of High Performance Computing Applications
- Vol. 20 (1) , 143-157
Experiences with Hierarchical Request Flow Management for Network-Enabled Server Environments
The Distributed Interactive Engineering Toolbox (DIET) is a toolbox for the construction of network-enabled server systems. DIET servers provide transparent access to compute resources; resources can be either a single, interactive machine where the DIET server runs each request directly on its host, or batch-managed systems where the DIET server manages request submission and completion notification. A distributed hierarchy of scheduling agents connects the servers and is responsible for selecting servers appropriate to each client request. DIET seeks scalability by distributing the scheduling process and by keeping resource information measurement and performance prediction at the server level. DIET has traditionally offered an on-line scheduling model whereby all requests are scheduled immediately or refused. This approach can overload interactive servers in high-load conditions and does not allow adaptation of the schedule to task or data dependences. In this paper we consider an alternative model based on active management of the flow of requests throughout the system. We have added support for (1) limiting the number of concurrent requests on interactive servers, (2) server and agentlevel queues, and (3) window-based scheduling algorithms whereby the request release rate to servers can be controlled and some rearrangement of request to host mappings is possible. We present experiments demonstrating that these approaches can improve performance and that the overheads introduced are not significantly different from those of the standard DIET approach.
- 1 June 2005
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 33 (2-3) , 209-229
New Grid Scheduling and Rescheduling Methods in the GrADS Project
- 1 June 2005
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 33 (2-3) , 209-229
New Grid Scheduling and Rescheduling Methods in the GrADS Project
- 13 November 2004
- Published by Institute of Electrical and Electronics Engineers (IEEE)
The microgrid: using online simulation to predict application performance in diverse grid network environments
Improvements in networking and middleware technology are enabling large-scale grids that aggregate resources over wide-area networks to support applications at unprecedented levels of scale and performance. Unfortunately, existing middleware and tools provide little information to users as to the suitability of a given grid topology for a specific grid application. Instead, users generally use ad-hoc performance models to evaluate mappings of their applications to resource and network topologies. Grid application behavior alone is complex, and adding resource and network behavior makes the situation even worse. As a result, users typically employ nearly blind experimentation to find good deployments of their applications in each new grid environment. Only through actual deployment and execution can a user discovers if the mapping was a good one. Further, even after finding a good configuration, there is no basis to determine if a much better configuration has been missed. This approach slows effective grid application development and deployment. We present a richer methodology for evaluating grid software and diverse grid environments based on the MicroGrid grid online simulator. With the MicroGrid, users, grid researchers, or grid operators can define and simulate arbitrary collections of resources and networks. This allows study of an existing grid testbed under controlled conditions or even to study the efficacy of higher performance environments than are available today. Further, the MicroGrid supports direct execution of grid applications unchanged. These application can be written with MPI, C, C++, Perl, and/or Python and use the Globus middleware. This enables detailed and accurate study of application behavior. This work presents: (1) the first validation of the MicroGrid for studying whole-program performance of MPI grid applications and (2) a demonstration of the MicroGrid as a tool for predicting the performance of applications on a range of grid resources and novel network topologies.
- 13 November 2004
- Published by Institute of Electrical and Electronics Engineers (IEEE)
The microgrid: using online simulation to predict application performance in diverse grid network environments
Improvements in networking and middleware technology are enabling large-scale grids that aggregate resources over wide-area networks to support applications at unprecedented levels of scale and performance. Unfortunately, existing middleware and tools provide little information to users as to the suitability of a given grid topology for a specific grid application. Instead, users generally use ad-hoc performance models to evaluate mappings of their applications to resource and network topologies. Grid application behavior alone is complex, and adding resource and network behavior makes the situation even worse. As a result, users typically employ nearly blind experimentation to find good deployments of their applications in each new grid environment. Only through actual deployment and execution can a user discovers if the mapping was a good one. Further, even after finding a good configuration, there is no basis to determine if a much better configuration has been missed. This approach slows effective grid application development and deployment. We present a richer methodology for evaluating grid software and diverse grid environments based on the MicroGrid grid online simulator. With the MicroGrid, users, grid researchers, or grid operators can define and simulate arbitrary collections of resources and networks. This allows study of an existing grid testbed under controlled conditions or even to study the efficacy of higher performance environments than are available today. Further, the MicroGrid supports direct execution of grid applications unchanged. These application can be written with MPI, C, C++, Perl, and/or Python and use the Globus middleware. This enables detailed and accurate study of application behavior. This work presents: (1) the first validation of the MicroGrid for studying whole-program performance of MPI grid applications and (2) a demonstration of the MicroGrid as a tool for predicting the performance of applications on a range of grid resources and novel network topologies.
- 10 June 2004
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 199-206
New grid scheduling and rescheduling methods in the GrADS project
Summary form only given. The goal of the Grid Application Development Software (GrADS) project is to provide programming tools and an execution environment to ease program development for the grid. We present recent extensions to the GrADS software framework: 1. A new approach to scheduling workflow computations, applied to a 3D image reconstruction application; 2. A simple stop/migrate/restart approach to rescheduling grid applications, applied to a QR 3. A process-swapping approach to rescheduling, applied to an N-body simulation. Experiments validating these methods were carried out on both the GrADS MacroGrid (a small but functional grid) and the MicroGrid (a controlled emulation of the grid) and the results were demonstrated at the SC2003 conference.
- 10 June 2004
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 199-206
New grid scheduling and rescheduling methods in the GrADS project
Summary form only given. The goal of the Grid Application Development Software (GrADS) project is to provide programming tools and an execution environment to ease program development for the grid. We present recent extensions to the GrADS software framework: 1. A new approach to scheduling workflow computations, applied to a 3D image reconstruction application; 2. A simple stop/migrate/restart approach to rescheduling grid applications, applied to a QR 3. A process-swapping approach to rescheduling, applied to an N-body simulation. Experiments validating these methods were carried out on both the GrADS MacroGrid (a small but functional grid) and the MicroGrid (a controlled emulation of the grid) and the results were demonstrated at the SC2003 conference.
- 10 June 2004
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 276-283
Benchmark probes for grid assessment
- 10 June 2004
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 276-283
Benchmark probes for grid assessment