DocumentCode :
2533375
Title :
Distributed Computing Systems Using Heap Sort of Multi-layer Sub-tree by Task Match Scheduling Algorithm
Author :
Xiu, Xu
Author_Institution :
Sch. of Comput. Sci. & Technol., China Univ. of Min. & Technol., Xuzhou, China
fYear :
2010
fDate :
18-20 Dec. 2010
Firstpage :
321
Lastpage :
325
Abstract :
To organize the distributed computing system resources to form the level structure to carry on the management provides the basis for the computation task assignment and the dispatch resources. According to the characteristic of the arrangement matching recursion, based on the sole data inserting in the cru-node, one method of sub-tree to be formed one pile is proposed, one algorithm of sub-tree heap sort is advanced, and then one task matching algorithm based on multi-layers sub-tree heap sort is designed. The algorithmic analysis and the experimental result indicated that, this algorithm can carry on reasonable, fast, and effective task matching for the resources tree´s information need quantity, enhancing the efficiency of the task scheduling and the resources gain.
Keywords :
parallel processing; processor scheduling; resource allocation; task analysis; tree data structures; algorithmic analysis; arrangement matching recursion; computation task assignment; dispatch resource; distributed computing system; multilayers sub-tree heap sort; task matching algorithm; task scheduling; Parallel architectures; Programming; Distributed computing systems; Match scheduling algorithm; Sub-tree;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel Architectures, Algorithms and Programming (PAAP), 2010 Third International Symposium on
Conference_Location :
Dalian
Print_ISBN :
978-1-4244-9482-8
Type :
conf
DOI :
10.1109/PAAP.2010.44
Filename :
5715102
Link To Document :
بازگشت