• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Symposium on Computer Architecture and High Performance Computing Workshop >A Hybrid Parallel Algorithm for the Auction Algorithm in Multicore Systems
【24h】

A Hybrid Parallel Algorithm for the Auction Algorithm in Multicore Systems

机译：多核系统中拍卖算法的混合并行算法

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The bipartite graph matching problem is based on finding a point that maximizes the chances of similarity with another one, and it is explored in several areas such as Bioinformatics and Computer Vision. To solve that matching problem the auction algorithm has been widely used and its parallel implementation is employed to find matching solutions in a reasonable computational time. For example, image analysis may require a large amount of processing, as dense images can have thousands of points to be considered. Furthermore, to exploit the benefits of multicore architectures, a hybrid implementation can be used to deal with communication in both distributed and shared memory. The main goal of this paper is to implement and evaluate the performance of an hybrid parallel auction algorithm for multicore clusters. The experiments carried out analyzes the problem size, the number of iterations to solve the matching and the impact of these parameters in the communication costs and how it affects the execution times.
机译：双向图匹配问题是基于找到一个最大化与另一个相似点的机会的点，并在诸如生物信息学和计算机视觉等多个领域进行了探索。为了解决该匹配问题，拍卖算法已经被广泛使用，并且其并行实现被用于在合理的计算时间内找到匹配解决方案。例如，图像分析可能需要大量处理，因为密集图像可能要考虑数千个点。此外，为了利用多核体系结构的优势，可以使用混合实现来处理分布式内存和共享内存中的通信。本文的主要目标是实现和评估混合并行拍卖算法在多核集群中的性能。进行的实验分析了问题的大小，解决匹配的迭代次数以及这些参数在通信成本中的影响以及它如何影响执行时间。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号