Modeling the benefits of mixed data and task parallelism
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
A Low-Cost Approach towards Mixed Task and Data Parallel Scheduling
ICPP '02 Proceedings of the 2001 International Conference on Parallel Processing
Approximation Algorithms for Scheduling Malleable Tasks under Precedence Constraints
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
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
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
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
A Pragmatic Analysis Of Scheduling Environments On New Computing Platforms
International Journal of High Performance Computing Applications
Tunable scheduling in a GridRPC framework
Concurrency and Computation: Practice & Experience - Middleware for Grid Computing: Future Trends (MGC2006)
SimGrid: A Generic Framework for Large-Scale Distributed Experiments
UKSIM '08 Proceedings of the Tenth International Conference on Computer Modeling and Simulation
Scheduling Parallel Task Graphs on (Almost) Homogeneous Multicluster Platforms
IEEE Transactions on Parallel and Distributed Systems
Parallel job scheduling — a status report
JSSPP'04 Proceedings of the 10th international conference on Job Scheduling Strategies for Parallel Processing
Budget constrained resource allocation for non-deterministic workflows on an iaas cloud
ICA3PP'12 Proceedings of the 12th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I
| Hi-index | 0.00 |
Applications structured as parallel task graphs exhibit both data and task parallelism, and arise in many domains. Scheduling these applications on parallel platforms has been a long-standing challenge. In the case of a single homogeneous cluster, most of the existing algorithms focus on the reduction of the application completion time (make span). But in presence of resource managers such as batch schedulers and due to accentuated pressure on energy concerns, the produced schedules also have to be efficient in terms of resource usage. In this paper we propose a novel bi-criteria algorithm, called biCPA, able to optimize these two performance metrics either simultaneously or separately. Using simulation over a wide range of experimental scenarios, we find that biCPA leads to better results than previously published algorithms.