Modeling the benefits of mixed data and task parallelism
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing
IEEE Transactions on Parallel and Distributed Systems
A Low-Cost Approach towards Mixed Task and Data Parallel Scheduling
ICPP '02 Proceedings of the 2001 International Conference on Parallel Processing
An Exponential Lower Bound on the Length of Some Classes of Branch-and-Cut Proofs
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Approximation Algorithms for Scheduling Malleable Tasks under Precedence Constraints
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Lifted Cover Inequalities for 0-1 Integer Programs: Computation
INFORMS Journal on Computing
Critical Path and Area Based Scheduling of Parallel Task Graphs on Heterogeneous Platforms
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
A Branch-and-Cut Procedure for the Multimode Resource-Constrained Project-Scheduling Problem
INFORMS Journal on Computing
Exponential Lower Bounds on the Lengths of Some Classes of Branch-and-Cut Proofs
Mathematics of Operations Research
Scheduling mixed-parallel applications with advance reservations
HPDC '08 Proceedings of the 17th international symposium on High performance distributed computing
Journal of Systems and Software
Future Generation Computer Systems
Collaborative Scientific Workflows
ICWS '09 Proceedings of the 2009 IEEE International Conference on Web Services
IEEE Transactions on Parallel and Distributed Systems
Scheduling Parallel Task Graphs on (Almost) Homogeneous Multicluster Platforms
IEEE Transactions on Parallel and Distributed Systems
Scheduling mixed-parallel applications with advance reservations
Cluster Computing
A collaborative scheduling approach for service-driven scientific workflow execution
Journal of Computer and System Sciences
Journal of Systems and Software
CCGRID '10 Proceedings of the 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing
Performance analysis of dynamic workflow scheduling in multicluster grids
Proceedings of the 19th ACM International Symposium on High Performance Distributed Computing
Queue waiting time aware dynamic workflow scheduling in multicluster environments
Journal of Computer Science and Technology
Online scheduling of workflow applications in grid environments
Future Generation Computer Systems
Collaborative e-Science Experiments and Scientific Workflows
IEEE Internet Computing
| Hi-index | 0.00 |
Many scientific workflows can be structured as Parallel Task Graphs (PTGs), that is, graphs of data-parallel tasks. Adding data parallelism to a workflow provides opportunities for higher performance and scalability. Workflow tasks are data-parallel and moldable, and clusters are not only heterogeneous but also non-dedicated for workflow execution. Therefore, scheduling such scientific workflow in a multicluster platform becomes a challenging task. To address this problem, we study the scheduling of scientific workflow in a non-dedicated heterogeneous multicluster platform aimed at minimizing the makespan for workflow execution. In this paper, three scheduling algorithms for effective workflow task mapping and resource allocation are proposed, among them MHEFT-RSV and MHEFT-RSV-BD are heuristic algorithms. An exact branch-and-cut scheduling algorithm is implemented, which exploits the intertask precedence and resource constraints thereby accelerating the process of obtaining a feasible schedule with minimized makespan. Detailed simulation experiments show that on average the exact branch-and-cut algorithm obtains shorter makespan for small and medium size workflows, while MHEFT-RSV and MHEFT-RSV-BD achieves better tradeoff between makespan and computation time for large scientific workflows.