Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing
IEEE Transactions on Parallel and Distributed Systems
Bi-objective scheduling algorithms for optimizing makespan and reliability on heterogeneous systems
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Distributed and dynamic self-scheduling of parallel MPI Grid applications: Research Articles
Concurrency and Computation: Practice & Experience - Middleware for Grid Computing: A “Possible Future”
Reliability and Scheduling on Systems Subject to Failures
ICPP '07 Proceedings of the 2007 International Conference on Parallel Processing
Reliability versus performance for critical applications
Journal of Parallel and Distributed Computing
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
This paper proposes the Makespan and Reliability Cost Driven (MRCD) heuristic, a static scheduling strategy for heterogeneous distributed systems that not only minimizes the makespan but also maximizes the reliability of the application. The scheduling decisions made by MRCD are guided by a weighted function that considers both objectives simultaneously instead of prioritizing only one of the objectives. This work also introduces a classification of the solutions produced by weighted bi-objective schedulers to aid users to tune the weighting function in order to generate an appropriate solution in accordance with their needs. In comparison with related work, MRCD produced schedules with makespans that were significantly better then those produced by other strategies at expense of an insignificant deterioration in reliability.