Distributed Computing Systems Using Heap Sort of Multi-layer Sub-tree by Task Match Scheduling Algorithm
Parallel Architectures, Algorithms and Programming, International Symposium on (2010)
Dalian, Liaoning China
Dec. 18, 2010 to Dec. 20, 2010
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PAAP.2010.44
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.
Sub-tree, Match scheduling algorithm, Distributed computing systems
Xu Xiu, "Distributed Computing Systems Using Heap Sort of Multi-layer Sub-tree by Task Match Scheduling Algorithm", Parallel Architectures, Algorithms and Programming, International Symposium on, vol. 00, no. , pp. 321-325, 2010, doi:10.1109/PAAP.2010.44