Conference Paper

Applying Advance Reservation to Increase Predictability of Workflow Execution on the Grid

University of Innsbruck, Austria
DOI: 10.1109/E-SCIENCE.2006.261166 Conference: e-Science and Grid Computing, 2006. e-Science '06. Second IEEE International Conference on
Source: IEEE Xplore

ABSTRACT In this paper we present an extension to devise and implement advance reservation as part of the scheduling and resource management services of the ASKALON Grid application development and runtime environment. The scheduling service has been enhanced to offer a list of resources that can execute a specific task and to negotiatewith the resource manager about resources capable of processing tasks in the shortest possible time. We introduce progressive reservation approach which tries to allocate resources based on a fair-share principle. Experiments are shown that demonstrate the effectiveness of our approach, and that reflect different QoS parameters including performance, predictability, resource usage and resource fairness.

  • [Show abstract] [Hide abstract]
    ABSTRACT: Workflow-based workloads usually consist of multiple instances of the same workflow, which are jobs with control or data dependencies to carry out a well-defined scientific computation task, with each instance acting on its own input data. To maximize the performance, a high degree of concurrency is always achieved by running multiple instances simultaneously. However, since the amount of storage is limited on most systems, deadlock due to oversubscribed storage requests is a potential problem. To address this problem, we integrate two novel concepts with the traditional problem of deadlock avoidance by proposing two algorithms that can maximize active (not just allocated) resource utilization and minimize makespan. Our approach is based on the well-known banker's algorithm, but our algorithms make the important distinction between active and inactive resources, which is not a part of previous approaches. The central idea is to leverage the data-flow information to dynamically approximate localized maximum claim (i.e., the resource requirements of the remaining jobs of the instance) to improve either interinstance or intrainstance concurrency and still avoid deadlock. Through simulation-based studies, we show how our proposed algorithms are better than the classic banker's algorithm and the more recent Lang's algorithm in terms of makespan and active storage resource utilization.
    IEEE Transactions on Computers 11/2013; 62(11):2210-2223. DOI:10.1109/TC.2012.217 · 1.47 Impact Factor
  • Source
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper details a data structure for managing and scheduling requests for computing resources of clusters and virtualised infrastructure such as private clouds. The data structure uses a red-black tree whose nodes represent the start times and/or completion times of requests. The tree is enhanced by a double-linked list that facilitates the iteration of nodes once the start time of a request is determined by using the tree. We describe the data structure main features, provide an example of use, and discuss experiments that demonstrate that the average complexity of two operations are often below 10% of their respective theoretical worst cases.


Available from