Bi-objective scheduling algorithms for optimizing makespan and reliability on heterogeneous systems
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
Towards a general model of the multi-criteria workflow scheduling on the grid
Future Generation Computer Systems
Journal of Parallel and Distributed Computing
Reliability versus performance for critical applications
Journal of Parallel and Distributed Computing
Bicriteria Service Scheduling with Dynamic Instantiation for Workflow Execution on Grids
GPC '09 Proceedings of the 4th International Conference on Advances in Grid and Pervasive Computing
Reliability-Oriented Genetic Algorithm for Workflow Applications Using Max-Min Strategy
CCGRID '09 Proceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid
Scheduling on the Grid via multi-state resource availability prediction
GRID '08 Proceedings of the 2008 9th IEEE/ACM International Conference on Grid Computing
A memetic algorithm for reliability-based dynamic scheduling in heterogeneous computing environments
PDCS '07 Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems
Supporting fault-tolerance for time-critical events in distributed environments
Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis
EUC'07 Proceedings of the 2007 international conference on Embedded and ubiquitous computing
Supporting fault-tolerance for time-critical events in distributed environments
Scientific Programming
An effective compaction strategy for bi-criteria DAG scheduling in grids
International Journal of Communication Networks and Distributed Systems
Future Generation Computer Systems
Journal of Parallel and Distributed Computing
A hierarchical reliability-driven scheduling algorithm in grid systems
Journal of Parallel and Distributed Computing
Flexible service selection with user-specific QoS support in service-oriented architecture
Journal of Network and Computer Applications
Budget-Deadline constrained workflow planning for admission control in market-oriented environments
GECON'11 Proceedings of the 8th international conference on Economics of Grids, Clouds, Systems, and Services
Reference Point Based Multi-Objective Optimization to Workflow Grid Scheduling
International Journal of Applied Evolutionary Computation
Reliable workflow scheduling with less resource redundancy
Parallel Computing
Budget-Deadline Constrained Workflow Planning for Admission Control
Journal of Grid Computing
Multi-objective list scheduling of workflow applications in distributed computing infrastructures
Journal of Parallel and Distributed Computing
Distributed workflow mapping algorithm for maximized reliability under end-to-end delay constraint
The Journal of Supercomputing
Load balanced reliable task scheduling algorithm for heterogeneous systems
Journal of High Speed Networks
Hi-index | 0.00 |
A heterogeneous computing (HC) system is composed of a suite of geographically distributed high-performance machines interconnected by a high-speed network, thereby providing high-speed execution of computationally intensive applications with diverse demands. In HC systems, however, there is a possibility of machine and network failures and this can have an adverse impact on applications running on the system. In order to decrease the impact of failures on an application, matching and scheduling algorithms must be devised which minimize not only the execution time but also the failure probability of the application. However, because of the conflicting requirements, it is not possible to minimize both at the same time. Thus, the goal of this paper is to develop matching and scheduling algorithms which account for both the execution time and the failure probability and can trade off execution time against the failure probability of the application. In order to attain these goals, a biobjective scheduling problem is first formulated and then two different algorithms, the biobjective dynamic level scheduling algorithm and the biobjective genetic algorithm, are developed. Unique to both algorithms is the expression used for computing the failure probability of an application with precedence constraints. The simulation results confirm that the proposed algorithms can be used for producing task assignments where the execution time is weighed against the failure probability.