Resource Allocation for Steerable Parallel Parameter Searches: an Experimental Study
Skip to main content
eScholarship
Open Access Publications from the University of California

Resource Allocation for Steerable Parallel Parameter Searches: an Experimental Study

Abstract

Computational Grids lend themselves well to parameter sweep applications,which consist of independent tasks, each of which calculates results for a separate point in parameter space. However, it is possible for a parameter space to become so large as to pose prohibitive system requirements. In these cases, user-directed steering promises to reduce overall computation time. In this paper, we address an interesting challenge posed by these user-directed searches: how should compute resources be allocated to application tasks as the overall computation is being steered by the user? We present a model for user-directed searches, and then propose a number of resource allocation strategies and evaluate them in simulation. We find that prioritizing the assignments of tasks to compute resources throughout the search can lead to substantial performance improvements. We present experimental results obtained with software developed as part of the Virtual Instrument project, and discuss the impact of our findings on future Virtual Instrument implementations.

Pre-2018 CSE ID: CS2002-0720

Main Content
For improved accessibility of PDF content, download the file to your device.
Current View