摘要
提出并描述了一个基于树型层次结构的计算资源共享与聚集系统(tree-based layered sharing and aggregation,TLSA)。TLSA系统由对等网络环境下的空闲节点组成,形成一个类似B树的层次结构,使在节点加入和退出的时候可以自动的维持平衡。树型结构的网络拓扑通过自组织的可用性协议来维护,保证了系统的比较低的消息通信量和平衡的处理器负载。通过内部的资源发现协议,节点可以寻找到系统中最近最合适的空闲计算资源来完成大量的子任务。通过模拟测试结果表明对于大规模的子任务,TLSA可以在很短的时间内寻找到空闲资源,而且网络消息通信量不超过O(logmN),具有低消息通信量、非集中性、可扩展性、自组织等特性。
A tree based layered topology for computing resource sharing and aggregation system called TLSA is presented and described. A balanced tree is used, which each node of the network maintains one node of the tree is better suited for a no^uni form resource distribution because the tree gets balanced automatically when the insertions or deletions occur within the same zone. The tree structure allows applying different constraints to the idle CPU search by using the information about existing free nodes, which is dynamically managed by an availability protocol. With a fast discovery protocol, a node can communicate with the nearest ones to itself because they are its siblings or its descendants, and it can reach other regions of the tree by means of its parent. Resuhs from experiments and simulation tests show discovery time scales logarithmically with the number of nodes and TLSA is decentralized, scalable and self-organization.
出处
《计算机工程与设计》
CSCD
北大核心
2012年第4期1342-1346,共5页
Computer Engineering and Design
关键词
网络拓扑
计算资源共享
资源发现
树型结构
分布式计算
network topology
computing resource sharing
resource discovery
tree structure
distributed computing
