Advanced reservation-based scheduling of task graphs on clusters

Authors:
Anthony Sulistio;Wolfram Schiffmann;Rajkumar Buyya
Affiliations:
Grid Computing and Distributed Systems Lab, Dept. of Computer Science and Software Engineering, The University of Melbourne, Australia;Dept. of Mathematics and Computer Science, University of Hagen, Germany;Grid Computing and Distributed Systems Lab, Dept. of Computer Science and Software Engineering, The University of Melbourne, Australia
Venue:
HiPC'06 Proceedings of the 13th international conference on High Performance Computing
Year:
2006

Citing 15
Cited 4

Scheduling precedence graphs in systems with interprocessor communication times

SIAM Journal on Computing
On Exploiting Task Duplication in Parallel Program Scheduling

IEEE Transactions on Parallel and Distributed Systems
A comparison of list schedules for parallel processing systems

Communications of the ACM
Utilization, Predictability, Workloads, and User Runtime Estimates in Scheduling the IBM SP2 with Backfilling

IEEE Transactions on Parallel and Distributed Systems
Condor: a distributed job scheduler

Beowulf cluster computing with Linux
Link contention-constrained scheduling and mapping of tasks

Cluster Computing
Hypertool: A Programming Aid for Message-Passing Systems

IEEE Transactions on Parallel and Distributed Systems
A Compile-Time Scheduling Heuristic for Interconnection-Constrained Heterogeneous Processor Architectures

IEEE Transactions on Parallel and Distributed Systems
On Task Scheduling Accuracy: Evaluation Methodology and Results

The Journal of Supercomputing
Distributed computing in practice: the Condor experience: Research Articles

Concurrency and Computation: Practice & Experience - Grid Performance
The GrADS Project: Software Support for High-Level Grid Application Development

International Journal of High Performance Computing Applications
Taverna: a tool for the composition and enactment of bioinformatics workflows

Bioinformatics
Improving the Efficiency of Functional Parallelism by Means of Hyper-Scheduling

ICPPW '06 Proceedings of the 2006 International Conference Workshops on Parallel Processing
Workload characteristics of a multi-cluster supercomputer

JSSPP'04 Proceedings of the 10th international conference on Job Scheduling Strategies for Parallel Processing
Workload analysis of a cluster in a grid environment

JSSPP'05 Proceedings of the 11th international conference on Job Scheduling Strategies for Parallel Processing

On the use of meta-heuristics to increase the efficiency of online grid workflow scheduling algorithms

Cluster Computing
GarQ: An efficient scheduling data structure for advance reservations of grid resources

International Journal of Parallel, Emergent and Distributed Systems
Reverse combinatorial auction-based protocols for resource selection in grids

International Journal of Grid and Utility Computing
Improving user QoS by relaxing resource reservation policy in high-performance grid environments

International Journal of Grid and Utility Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A Task Graph (TG) is a model of a parallel program that consists of many subtasks that can be executed simultaneously on different processing elements. Subtasks exchange data via an interconnection network. The dependencies between subtasks are described by means of a Directed Acyclic Graph. Unfortunately, due to their characteristics, scheduling a TG requires dedicated or uninterruptible resources. Moreover, scheduling a TG by itself results in a low resource utilization because of the dependencies among the subtasks. Therefore, in order to solve the above problems, we propose a scheduling approach for TGs by using advance reservation in a cluster environment. In addition, to improve resource utilization, we also propose a scheduling solution by interweaving one or more TGs within the same reservation block and/or backfilling with independent jobs.