Scheduling mixed-parallel applications with advance reservations

Authors:
Kento Aida;Henri Casanova
Affiliations:
Center for Grid Research and Development, National Institute of Informatics, Tokyo, Japan 101-8430;Dept. of Information and Computer Sciences, University of Hawai`i at Manoa, Honolulu, USA 96822
Venue:
Cluster Computing
Year:
2009

Citing 28
Cited 5

Fortran M: a language for modular parallel programming

Journal of Parallel and Distributed Computing
Modeling the benefits of mixed data and task parallelism

Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
A Framework for Exploiting Task and Data Parallelism on Distributed Memory Multicomputers

IEEE Transactions on Parallel and Distributed Systems
A task- and data-parallel programming language based on shared objects

ACM Transactions on Programming Languages and Systems (TOPLAS)
Compiler support for task scheduling in hierarchical execution models

Journal of Systems Architecture: the EUROMICRO Journal - Special issue on tools and environments for parallel program development
Utilization, Predictability, Workloads, and User Runtime Estimates in Scheduling the IBM SP2 with Backfilling

IEEE Transactions on Parallel and Distributed Systems
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A Low-Cost Approach towards Mixed Task and Data Parallel Scheduling

ICPP '02 Proceedings of the 2001 International Conference on Parallel Processing
Image Processing or the Grid: A Toolkit or Building Grid-enabled Image Processing Applications.

CCGRID '03 Proceedings of the 3st International Symposium on Cluster Computing and the Grid
One-Step Algorithm for Mixed Data and Task Parallel Scheduling without Data Replication

IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Scheduling with Advanced Reservations

IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
Scheduling Co-Reservations with Priorities in Grid Computing Systems

CCGRID '02 Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid
Simultaneous exploitation of task and data parallelism in regular scientific applications

Simultaneous exploitation of task and data parallelism in regular scientific applications
Impact of Laxity on Scheduling with Advance Reservations in Grids

MASCOTS '05 Proceedings of the 13th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
Problem Solving Environment Based on Grid Services: NAREGI-PSE

E-SCIENCE '05 Proceedings of the First International Conference on e-Science and Grid Computing
Flexible Resource Reservation Using Slack Time for Service Grid

ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
An Integrated Approach for Processor Allocation and Scheduling of Mixed-Parallel Applications

ICPP '06 Proceedings of the 2006 International Conference on Parallel Processing
An approximation algorithm for scheduling malleable tasks under general precedence constraints

ACM Transactions on Algorithms (TALG)
A batch scheduler with high level components

CCGRID '05 Proceedings of the Fifth IEEE International Symposium on Cluster Computing and the Grid (CCGrid'05) - Volume 2 - Volume 02
Design and Implementation of a Local Scheduling System with Advance Reservation for Co-allocation on the Grid

CIT '06 Proceedings of the Sixth IEEE International Conference on Computer and Information Technology
Evaluation of a workflow scheduler using integrated performance modelling and batch queue wait time prediction

Proceedings of the 2006 ACM/IEEE conference on Supercomputing
Task Scheduling for Parallel Systems (Wiley Series on Parallel and Distributed Computing)

Task Scheduling for Parallel Systems (Wiley Series on Parallel and Distributed Computing)
An improved two-step algorithm for task and data parallel scheduling in distributed memory machines

Parallel Computing
Heuristic Scheduling of Grid Workflows Supporting Co-Allocation and Advance Reservation

CCGRID '07 Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid
A Comparison of Scheduling Approaches for Mixed-Parallel Applications on Heterogeneous Platforms

ISPDC '07 Proceedings of the Sixth International Symposium on Parallel and Distributed Computing
Precise and realistic utility functions for user-centric performance analysis of schedulers

Proceedings of the 16th international symposium on High performance distributed computing
Advance reservation policies for workflows

JSSPP'06 Proceedings of the 12th international conference on Job scheduling strategies for parallel processing
Impact of reservations on production job scheduling

JSSPP'07 Proceedings of the 13th international conference on Job scheduling strategies for parallel processing

Job-resource matchmaking on Grid through two-level benchmarking

Future Generation Computer Systems
Low-Cost Tuning of Two-Step Algorithms for Scheduling Mixed-Parallel Applications onto Homogeneous Clusters

CCGRID '10 Proceedings of the 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing
On cluster resource allocation for multiple parallel task graphs

Journal of Parallel and Distributed Computing
Scheduling of scientific workflow in non-dedicated heterogeneous multicluster platform

Journal of Systems and Software
Hierarchical scheduling strategies for parallel tasks and advance reservations in grids

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper investigates the scheduling of mixed-parallel applications, which exhibit both task and data parallelism, in advance reservations settings. Both the problem of minimizing application turn-around time and that of meeting a deadline are studied. For each several scheduling algorithms are proposed, some of which borrow ideas from previously published work in non-reservation settings. Algorithms are compared in simulation over a wide range of application and reservation scenarios. The main finding is that schedules computed using the previously published CPA algorithm can be adapted to advance reservation settings, notably resulting in low resource consumption and thus high efficiency.