A Scheduling Algorithm to Optimize Real-World Applications

Authors:
Mauricio Solar;Mario Inostroza
Affiliations:
-;-
Venue:
ICDCSW '04 Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04) - Volume 7
Year:
2004

Citing 4
Cited 0

Benchmarking and comparison of the task graph scheduling algorithms

Journal of Parallel and Distributed Computing
A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems

Journal of Parallel and Distributed Computing
DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors

IEEE Transactions on Parallel and Distributed Systems
Production Job Scheduling for Parallel Shared Memory Systems

IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a scheduling algorithm that assignstasks represented in a Directed Acyclic Graph (DAG).The behavior of the proposed algorithm is compared withthe Dominant Sequence Clustering (DSC) algorithm on aset of DAG tests. The tests were carried out on two sets ofDAGs, one with tasks of arbitrary duration, and the otherwith tasks of unit time duration. When comparing theresults for each algorithm in terms of parallelcomputation time, the proposed algorithm is superior in75% of the cases, equal in 20% of the tests, and in thosecases in which DSC outperforms the proposed algorithm(5% of the cases), it can be seen that the planning carriedout by DSC uses a greater number of processors than theproposed algorithm, so that the performance in terms ofCPU use is lower for DSC. The results obtained showthat the proposed algorithm is superior in 100% of thecases when considering the number of processors used.