具有合作主体的穷举搜索性能研究
On the Performance of Exhaustive Search with Cooperating agents
摘要:
尽管出现了优雅的算法来解决复杂的问题,穷举搜索仍然保留其意义,因为许多现实生活中的问题没有表现出规则的结构和穷举搜索是唯一可能的解决方案。无论是通过多核处理器还是分布式处理器的高性能计算的出现,都强调了多个搜索代理进行穷举搜索的可能性。在这里,我们分析的性能时,它是由多个搜索代理进行穷举搜索。搜索代理之间的合作的几种策略进行了评估。我们发现搜索的性能随着合作水平的提高而提高。如果分配给各个搜索区域的子区域的长度遵循异构搜索代理的速度差异,则同构和异构搜索代理可以实现相同的搜索性能。
英文摘要:
Despite the occurrence of elegant algorithms for solving complex problem, exhaustive search has retained its significance since many real-life problems exhibit no regular structure and exhaustive search is the only possible solution. The advent of high-performance computing either via multicore processors or distributed processors emphasizes the possibility for exhaustive search by multiple search agents. Here we analyse the performance of exhaustive search when it is conducted by multiple search agents. Several strategies for cooperation between the search agents are evaluated. We discover that the performance of the search improves with the increase in the level of cooperation. Same search performance can be achieved with homogeneous and heterogeneous search agents provided that the length of subregions allocated to individual search regions follow the differences in the speeds of heterogeneous search agents.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。