The grid: blueprint for a new computing infrastructure
The grid: blueprint for a new computing infrastructure
Condor-G: A Computation Management Agent for Multi-Institutional Grids
Cluster Computing
GRID '02 Proceedings of the Third International Workshop on Grid Computing
A computational economy for grid computing and its implementation in the Nimrod-G resource broker
Future Generation Computer Systems - Grid computing: Towards a new computing infrastructure
A Scalable QoS-Aware Service Aggregation Model for Peer-to-Peer Computing Grids
HPDC '02 Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing
A Case for Economy Grid Architecture for Service Oriented Grid Computing
IPDPS '01 Proceedings of the 10th Heterogeneous Computing Workshop â"" HCW 2001 (Workshop 1) - Volume 2
QoS-Aware Middleware for Web Services Composition
IEEE Transactions on Software Engineering
IEEE Internet Computing
Grid middleware services for virtual data discovery, composition, and integration
MGC '04 Proceedings of the 2nd workshop on Middleware for grid computing
A Novel Architecture for Realizing Grid Workflow using Tuple Spaces
GRID '04 Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing
An approach for quality of service adaptation in service-oriented Grids: Research Articles
Concurrency and Computation: Practice & Experience - Middleware for Grid Computing
Cost-Based Scheduling of Scientific Workflow Application on Utility Grids
E-SCIENCE '05 Proceedings of the First International Conference on e-Science and Grid Computing
Scheduling workflow applications on processors with different capabilities
Future Generation Computer Systems - Collaborative and learning applications of grid technology
QoS based resource scheduling by computational economy in computational grid
Information Processing Letters
Task scheduling strategies for workflow-based applications in grids
CCGRID '05 Proceedings of the Fifth IEEE International Symposium on Cluster Computing and the Grid (CCGrid'05) - Volume 2 - Volume 02
Utility-based QoS optimisation strategy for multi-criteria scheduling on the grid
Journal of Parallel and Distributed Computing
A cost-effective critical path approach for service priority selections in grid computing economy
Decision Support Systems
End-to-end quality of service for high-end applications
Computer Communications
Information Sciences: an International Journal
An efficient hybrid algorithm for resource-constrained project scheduling
Information Sciences: an International Journal
Dynamic execution planning for reliable collaborative business processes
Information Sciences: an International Journal
LDAG: a new model for grid workflow applications
WSEAS Transactions on Computers
Performance evaluation of scheduling algorithms for database services with soft and hard SLAs
Proceedings of the second international workshop on Data intensive computing in the clouds
An Adaptive Scoring Job Scheduling algorithm for grid computing
Information Sciences: an International Journal
Deadline-constrained workflow scheduling algorithms for Infrastructure as a Service Clouds
Future Generation Computer Systems
A decision framework for optimisation of business processes aligned with business goals
International Journal of Business Information Systems
Planning of business process execution in Business Process Management environments
Information Sciences: an International Journal
| Hi-index | 0.07 |
Cost optimization for workflow applications described by Directed Acyclic Graph (DAG) with deadline constraints is a fundamental and intractable problem on Grids. In this paper, an effective and efficient heuristic called DET (Deadline Early Tree) is proposed. An early feasible schedule for a workflow application is defined as an Early Tree. According to the Early Tree, all tasks are grouped and the Critical Path is given. For critical activities, the optimal cost solution under the deadline constraint can be obtained by a dynamic programming strategy, and the whole deadline is segmented into time windows according to the slack time float. For non-critical activities, an iterative procedure is proposed to maximize time windows while maintaining the precedence constraints among activities. In terms of the time window allocations, a local optimization method is developed to minimize execution costs. The two local cost optimization methods can lead to a global near-optimal solution. Experimental results show that DET outperforms two other recent leveling algorithms. Moreover, the deadline division strategy adopted by DET can be applied to all feasible deadlines.