An Efficient Scheduling Algorithm for Dependent Tasks

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Youlin Ruan Articles by Gan Liu Articles by Qinghua Li Articles by Tingyao Jiang

Fourth International Conference on Computer and Information Technology (CIT'04)

Wuhan, China

September 14-September 16

ISBN: 0-7695-2216-5

	ASCII Text	x
	Youlin Ruan, Gan Liu, Qinghua Li, Tingyao Jiang, "An Efficient Scheduling Algorithm for Dependent Tasks," Computer and Information Technology, International Conference on, pp. 456-461, Fourth International Conference on Computer and Information Technology (CIT'04), 2004.

	BibTex	x
	@article{ 10.1109/CIT.2004.1357237, author = {Youlin Ruan and Gan Liu and Qinghua Li and Tingyao Jiang}, title = {An Efficient Scheduling Algorithm for Dependent Tasks}, journal ={Computer and Information Technology, International Conference on}, volume = {0}, year = {2004}, isbn = {0-7695-2216-5}, pages = {456-461}, doi = {http://doi.ieeecomputersociety.org/10.1109/CIT.2004.1357237}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Computer and Information Technology, International Conference on TI - An Efficient Scheduling Algorithm for Dependent Tasks SN - 0-7695-2216-5 SP456 EP461 A1 - Youlin Ruan, A1 - Gan Liu, A1 - Qinghua Li, A1 - Tingyao Jiang, PY - 2004 KW - null VL - 0 JA - Computer and Information Technology, International Conference on ER -

Youlin Ruan, China Three Gorges University and HuaZhong University of Science and Technology

Gan Liu, HuaZhong University of Science and Technology and Hubei University

Qinghua Li, HuaZhong University of Science and Technology

Tingyao Jiang, China Three Gorges University and HuaZhong University of Science and Technology

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CIT.2004.1357237

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.

Citation:

Youlin Ruan, Gan Liu, Qinghua Li, Tingyao Jiang, "An Efficient Scheduling Algorithm for Dependent Tasks," cit, pp.456-461, Fourth International Conference on Computer and Information Technology (CIT'04), 2004

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.