A hybrid algorithm for scheduling workflow applications in grid environments (ICPDP)

Authors:
Bogdan Simion;Catalin Leordeanu;Florin Pop;Valentin Cristea
Affiliations:
Faculty of Automatics and Computer Science, University "Politehnica" of Bucharest;Faculty of Automatics and Computer Science, University "Politehnica" of Bucharest;Faculty of Automatics and Computer Science, University "Politehnica" of Bucharest;Faculty of Automatics and Computer Science, University "Politehnica" of Bucharest
Venue:
OTM'07 Proceedings of the 2007 OTM confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part II
Year:
2007

Citing 20
Cited 2

Scheduling precedence graphs in systems with interprocessor communication times

SIAM Journal on Computing
Allocating Modules to Processors in a Distributed System

IEEE Transactions on Software Engineering
Scheduling parallel program tasks onto arbitrary target machines

Journal of Parallel and Distributed Computing - Special issue: software tools for parallel programming and visualization
Task scheduling in parallel and distributed systems

Task scheduling in parallel and distributed systems
List scheduling with and without communication delays

Parallel Computing
Dynamic Critical-Path Scheduling: An Effective Technique for Allocating Task Graphs to Multiprocessors

IEEE Transactions on Parallel and Distributed Systems
The grid: blueprint for a new computing infrastructure

The grid: blueprint for a new computing infrastructure
On Parallelizing the Multiprocessor Scheduling Problem

IEEE Transactions on Parallel and Distributed Systems
The Jini architecture for network-centric computing

Communications of the ACM
Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors

Journal of the ACM (JACM)
Static scheduling algorithms for allocating directed task graphs to multiprocessors

ACM Computing Surveys (CSUR)
A comparison of list schedules for parallel processing systems

Communications of the ACM
Optimal Task Assignment in Heterogeneous Distributed Computing Systems

IEEE Concurrency
Jini Home Networking: A Step toward Pervasive Computing

Computer
Hypertool: A Programming Aid for Message-Passing Systems

IEEE Transactions on Parallel and Distributed Systems
A grid service broker for scheduling distributed data-oriented applications on global grids

MGC '04 Proceedings of the 2nd workshop on Middleware for grid computing
The Anatomy of the Grid: Enabling Scalable Virtual Organizations

International Journal of High Performance Computing Applications
Satellite Image Processing Applications in MedioGRID

ISPDC '06 Proceedings of the Proceedings of The Fifth International Symposium on Parallel and Distributed Computing
A Graph Matching Approach to Optimal Task Assignment in Distributed Computing Systems Using a Minimax Criterion

IEEE Transactions on Computers
A decentralized strategy for genetic scheduling in heterogeneous environments

Multiagent and Grid Systems - Grid Computing, high performance and distributed applications

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
Improving user QoS by relaxing resource reservation policy in high-performance grid environments

International Journal of Grid and Utility Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, based on a thorough analysis of different policies for DAG scheduling, an improved algorithm ICPDP (Improved Critical Path using Descendant Prediction) is introduced. The algorithm performs well with respect to the total scheduling time, the schedule length and load balancing. In addition, it provides efficient resource utilization, by minimizing the idle time on the processing elements. The algorithm has a quadratic polynomial time complexity. Experimental results are provided to support the performance evaluation of the algorithm and compare them with those obtained for other scheduling strategies. The ICPDP algorithm, as well as other analyzed algorithms, have been integrated in the DIOGENES project, and have been tested by using Mon-Alisa farms and ApMon, a MonAlisa extension.