【摘要】在扩展一种基于内容的负载共享算法的过程中，总结了将初始化负载分布到集群成员服务器的模型和方法，探讨了依据慈善算法进行偶图一对多匹配即k-完全匹配的问题。给出了一些应用慈善算法进行偶图匹配的重要实验结果，并对慈善算法存在的问题和在超图等研究领域的潜在应用进行了讨论。关 键 词 偶图; 一对多匹配; k-完全匹配; 慈善算法The present paper summarizes the one-to-many matching model of bipartite model and corresponding methodology formalized in the process of extending a content-based load sharing algorithm, LARD. Such a one-to-many matching is referred to as k-perfect matching, and a charity algorithm is given as the solution. Some experimental results for the matching based on charity algorithm are then presented, with open issues and potential applicability in the context of hyper graph left as discussions.
猜您喜欢
推荐内容
开源项目推荐 更多
热门活动
热门器件
用户搜过
随便看看
热门下载
热门文章
热门标签
京公网安备 11010802033920号
Copyright © 2005-2024 EEWORLD.com.cn, Inc. All rights reserved
评论