An Efficient Scheduling Algorithm for Dependent Tasks

Authors:
Youlin Ruan;Gan Liu;Qinghua Li;Tingyao Jiang
Affiliations:
China Three Gorges University and HuaZhong University of Science and Technology;HuaZhong University of Science and Technology and Hubei University;HuaZhong University of Science and Technology;China Three Gorges University and HuaZhong University of Science and Technology
Venue:
CIT '04 Proceedings of the The Fourth International Conference on Computer and Information Technology
Year:
2004

Citing 0
Cited 2

Task scheduling in multiprocessing systems using duplication

Journal of Systems Architecture: the EUROMICRO Journal
Optimal task scheduling algorithm for non-preemptive processing system

APWeb'06 Proceedings of the 8th Asia-Pacific Web conference on Frontiers of WWW Research and Development

Quantified Score

Hi-index	0.00

Visualization

Abstract

Scheduling for dependent tasks is NP-hard. In this paper, we propose a greedy algorithm that can generate a shorter schedule than other major algorithms. The time complexity of our algorithm is O(dv虏logv) , where v represents the number of tasks and d represents the maximum indegree of tasks. Simulation results show that the proposed algorithm achieves considerable performance improvement over other important algorithms.