On the complexity of list scheduling algorithms for distributed-memory systems
ICS '99 Proceedings of the 13th international conference on Supercomputing
Benchmarking and comparison of the task graph scheduling algorithms
Journal of Parallel and Distributed Computing
Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing
IEEE Transactions on Parallel and Distributed Systems
Low-Cost Task Scheduling for Distributed-Memory Machines
IEEE Transactions on Parallel and Distributed Systems
Condor-G: A Computation Management Agent for Multi-Institutional Grids
Cluster Computing
IEEE Transactions on Parallel and Distributed Systems
Architectural Models for Resource Management in the Grid
GRID '00 Proceedings of the First IEEE/ACM International Workshop on Grid Computing
A Dynamic Matching and Scheduling Algorithm for Heterogeneous Computing Systems
HCW '98 Proceedings of the Seventh Heterogeneous Computing Workshop
Heuristics for Scheduling Parameter Sweep Applications in Grid Environments
HCW '00 Proceedings of the 9th Heterogeneous Computing Workshop
Definition of a Robustness Metric for Resource Allocation
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
An XML-based framework for loosely coupled applications on grid environments
ICCS'03 Proceedings of the 1st international conference on Computational science: PartI
Workflow adaptation as an autonomic computing problem
Proceedings of the 2nd workshop on Workflows in support of large-scale science
Reactive grid scheduling of DAG applications
PDCN'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: parallel and distributed computing and networks
Grid workflow scheduling based on reliability cost
Proceedings of the 2nd international conference on Scalable information systems
Self-adjustment of resource allocation for grid applications
Computer Networks: The International Journal of Computer and Telecommunications Networking
Scientific Programming - Scientific Workflows
Robust scheduler for grid networks
Proceedings of the 2009 ACM symposium on Applied Computing
GPC '09 Proceedings of the 4th International Conference on Advances in Grid and Pervasive Computing
Grid Workflow Modeling for Remote Sensing Retrieval Service with Tight Coupling
ICCS 2009 Proceedings of the 9th International Conference on Computational Science
Utility Driven Adaptive Work?ow Execution
CCGRID '09 Proceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid
A mobile agent based workflow rescheduling approach for grids
PDCS '07 Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems
Advance reservation policies for workflows
JSSPP'06 Proceedings of the 12th international conference on Job scheduling strategies for parallel processing
Scheduling DAGs on grids with copying and migration
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Task migration enabling grid workflow application rescheduling
APWeb'08 Proceedings of the 10th Asia-Pacific web conference on Progress in WWW research and development
Scheduling multiple DAGs onto heterogeneous systems
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Incremental placement of interactive perception applications
Proceedings of the 20th international symposium on High performance distributed computing
Strategies for Rescheduling Tightly-Coupled Parallel Applications in Multi-Cluster Grids
Journal of Grid Computing
Computers & Mathematics with Applications
Using relative costs in workflow scheduling to cope with input data uncertainty
Proceedings of the 10th International Workshop on Middleware for Grids, Clouds and e-Science
Accelerating Web Service Workflow Execution via Intelligent Allocation of Services to Servers
Journal of Database Management
Stochastic DAG scheduling using a Monte Carlo approach
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
Workflow management is emerging as an important service in Grid computing. A simple model that can be used for the representation of certain workflows is a directed acyclic graph. Although many heuristics have been proposed to schedule such graphs on heterogeneous environments, most of them assume accurate prediction of computation and communication costs. This limits their direct applicability to a dynamically changing environment, such as the Grid. In this environment, an initial schedule may be built based on estimates, but run-time rescheduling may be needed to improve application performance. This paper presents a low-cost rescheduling policy, which considers rescheduling at a few, carefully selected points during the execution. This policy achieves performance results, which are comparable with those achieved by a policy that dynamically attempts to reschedule before the execution of every task.