Towards Resource Reliability Support for Grid Workflows

Authors:
Jiong Yu;Guozhong Tian;Yuanda Cao;Xianhe Sun
Affiliations:
School of Computer, Beijing Institute of Technology, and School of Information Science and Engineering, Xinjiang University,;School of Information Science and Engineering, Xinjiang University,;School of Computer, Beijing Institute of Technology,;Department of Computer Science, Illinois Institute of Technology,
Venue:
NPC '08 Proceedings of the IFIP International Conference on Network and Parallel Computing
Year:
2008

Citing 5
Cited 0

Improving the performance of time-constrained workflow processing

Journal of Systems and Software
Performance Modeling and Prediction of Nondedicated Network Computing

IEEE Transactions on Computers
A high performance, low complexity algorithm for compile-time task scheduling in heterogeneous systems

Parallel Computing - Heterogeneous computing
MJSA: Markov job scheduler based on availability in desktop grid computing environment

Future Generation Computer Systems
NP-complete scheduling problems

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

Grid workflow can be defined as an organization of Grid Services into a well-defined flow of operations, and can be thought of as the composition of Grid Services over time on heterogeneous and distributed resources in a well-defined order to accomplish a specific goal. To the time-constrained workflow Scheduling in Grids, we present a scheduling algorithm in terms of the finite-state continuous-time Markov process by selecting a resource combination scheme which has the lowest expenditure under the certain credit level of the resource reliability on the critical path in the DAG-based workflow. The simulation shows the validity of theory analysis.