摘要
给出了p2p计算中一种新的自组织任务调度拓扑结构——K+树。K+树是L层k分支树和L?1层k分支树的组合。它的基本功能单元是由一个协调者peer、一个备份协调者peer和K个工作者peer组成。本文阐述如何从无组织的图拓扑为自组织的K+树、协调者peer如何选取工作者peer和备份协调者peer、peer之间如何实现负载平衡等关键技术。通过分析和仿真可知K+树具有高可靠性和伸缩性,并在一定条件下能有效降低任务的平均运行时间。
A new self-organized task scheduling topology structure—K+ tree—was provided. A K+ tree was composed of a L-tier K-ary tree and a (L?1)-tier K-ary tree. The basic function unit of a K+ tree was comprised of a coordinator peer, a backup coordinator peer, and K worker peers. Key technologies were expatiated on which include how a non-organized graph changes into a self-organized K+ tree, how a coordinator selects worker peers and a backup coordinator peer, and how a K+ tree realizes balancing load among peers. K+ tree had high reliability and scalability, and it can lower the average running time of tasks effectively in certain conditions via analysis and simulation.
出处
《通信学报》
EI
CSCD
北大核心
2005年第6期24-30,共7页
Journal on Communications
基金
国家自然科学基金资助项目(70271050)
江苏省自然科学基金资助项目(BK2003105
BK2004218)
江苏省高技术研究计划资助项目(BG2004004)
江苏省计算机信息处理技术重点实验室基金资助项目(kjs04)
