Conference Proceeding

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

University of Innsbruck, Austria
01/2007; DOI:10.1109/E-SCIENCE.2006.261166 In proceeding of: 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.

0 0
  • [show abstract] [hide abstract]
    ABSTRACT: Complex eScience and other sophisticated applications in the field of HPC imply new demands that queuing based resource management systems cannot meet. To guarantee Quality of Service and co-allocation in the Grid, planning based resource management systems implementing advance reservation are needed. These systems face new challenges as a planning based management system has to keep track of the jobs and reservations in the future. Additionally, during the negotiation process of incoming reservations, a good overview of the remaining, not-yet reserved capacity is needed—not only for the current allocation, but also for the whole book-ahead time. Therefore, the resource management problem becomes a two dimensional problem for advance reservations in this field. In this paper different data structures are investigated and discussed in order to fit to planning based resource management. As a result the benefits of using lists of resource allocation or free blocks are exposed. This general idea widely used to manage continuous resources is extended to cover not only the resource dimension but also the time dimension. The list of blocks approach is evaluated in a Grid level and a local resource management system for a computing cluster. The extensive simulations showed a better runtime and higher reservation success rate compared with the currently favored approach of a slotted time and the more sophisticated approach based on AVL trees.
    International Journal of Parallel Programming 02/2014; · 0.40 Impact Factor
  • Source
    [show abstract] [hide abstract]
    ABSTRACT: In extremely heterogeneous and distributed systems, like Grid environments, it is quite difficult to provide quality of service (QoS). In addition, the dynamic behaviour of the resources makes the time needed to complete the execution of a job highly variable. So, fulfilling the user QoS requirements in a Grid is still an open issue. The main aim of this work is to provide QoS in Grid environments through network-aware job scheduling in advance. This paper presents a technique to manage idle/busy periods of resources using red-black trees which considers the network as a first level resource. Besides, no a priori knowledge on the duration of jobs is required, as opposed to other works. A performance evaluation using a real testbed is presented which illustrates the efficiency of this approach to meet the QoS requirements of users, and highlights the importance of taking the network into account when predicting the duration of jobs. KeywordsGrid meta-scheduling-network-QoS-red-black trees
    09/2010: pages 431-443;
  • [show abstract] [hide abstract]
    ABSTRACT: Efficient workflow scheduling algorithm meeting user' s Quality of Service requirement is a complicated problem due to the dynamics and uncertainty of grid environment. Aiming at guaranteeing the reliability of workflow execution under budget constraint, a calculation method for reliability of task execution, based on evaluation of dynamic service capacity of resource, was proposed in the paper. A reliability enhanced grid workflow scheduling algorithm with budget constraint (REGWSA-BC) was proposed. The main idea of this algorithm is to select the resource which can maximize the reliability of task execution. The results of extensive simulation experiments showed that REGWSA-BC could achieve better average performance of workflow execution, and adapt to dynamic Grid environment and guarantee user's reliability requirements compared to other similar scheduling algorithms.


Available from