A tool for the design and evaluation of hybrid scheduling algorithms for computational grids
MGC '04 Proceedings of the 2nd workshop on Middleware for grid computing
Journal of Parallel and Distributed Computing
Risk-Resilient Heuristics and Genetic Algorithms for Security-Assured Grid Job Scheduling
IEEE Transactions on Computers
Journal of Parallel and Distributed Computing
List scheduling with duplication for heterogeneous computing systems
Journal of Parallel and Distributed Computing
Posterior task scheduling algorithms for heterogeneous computing systems
VECPAR'06 Proceedings of the 7th international conference on High performance computing for computational science
An effective compaction strategy for bi-criteria DAG scheduling in grids
International Journal of Communication Networks and Distributed Systems
A task duplication based bottom-up scheduling algorithm for heterogeneous environments
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
A security-oriented task scheduler for heterogeneous distributed systems
HiPC'06 Proceedings of the 13th international conference on High Performance Computing
High performance task scheduling algorithm for heterogeneous computing system
ICA3PP'05 Proceedings of the 6th international conference on Algorithms and Architectures for Parallel Processing
A productive duplication-based scheduling algorithm for heterogeneous computing systems
HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications
Task scheduling algorithm for interconnection constrained network of heterogeneous processors
CIT'04 Proceedings of the 7th international conference on Intelligent Information Technology
Scheduling for heterogeneous Systems using constrained critical paths
Parallel Computing
Stochastic DAG scheduling using a Monte Carlo approach
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
Finding an optimal solution to the problem of scheduling an application modeled by a directed acyclic graph (DAG) onto a set of heterogeneous machines is known to be an NP-hard problem. In this study, we present a duplication based scheduling algorithm, namely the levelized duplication based scheduling (LDBS) algorithm, which solves this problem efficiently. The primary goal of LDBS is to minimize the schedule length of applications. LDBS can accommodate different duplication heuristics, thanks to its modular design. Specifically, we have designed two different duplication heuristics with different time complexities. The simulation studies confirm that LDBS is a very competitive scheduling algorithm in terms of minimizing the schedule length of applications.