arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2009.04755cs.DC
收藏

Rocket:异构平台上的高效和可扩展的全对计算

Rocket: Efficient and Scalable All-Pairs Computations on Heterogeneous Platforms

Stijn Heldens, Pieter Hijma, Ben van Werkhoven, Jason Maassen, Henri Bal, Rob van Nieuwpoort

摘要:

所有对计算问题将用户定义的函数应用于给定数据集的两个项目的每个组合。虽然这些问题提出了大量的并行性,数据重用必须利用,以实现良好的性能。一些研究人员考虑了这个问题,无论是采取部分复制静态工作分配或动态调度与完整的复制。相比之下,我们提出了一个解决方案,依赖于分层多级基于软件的缓存,以最大限度地提高数据重用在分布式存储层次结构的每一个级别,结合分治的方法来利用数据的本地性,分层工作窃取动态平衡的工作负载,和异步处理,以最大限度地提高资源利用率。我们评估我们的解决方案使用三个现实世界的应用程序(从数字取证,本地化显微镜和生物信息学)在不同的平台(从台式机到超级计算机)。结果显示,当扩展到96个GPU时,具有出色的效率和可扩展性,甚至由于分布式缓存而获得超线性加速。

英文摘要:

All-pairs compute problems apply a user-defined function to each combination of two items of a given data set. Although these problems present an abundance of parallelism, data reuse must be exploited to achieve good performance. Several researchers considered this problem, either resorting to partial replication with static work distribution or dynamic scheduling with full replication. In contrast, we present a solution that relies on hierarchical multi-level software-based caches to maximize data reuse at each level in the distributed memory hierarchy, combined with a divide-and-conquer approach to exploit data locality, hierarchical work-stealing to dynamically balance the workload, and asynchronous processing to maximize resource utilization. We evaluate our solution using three real-world applications (from digital forensics, localization microscopy, and bioinformatics) on different platforms (from a desktop machine to a supercomputer). Results shows excellent efficiency and scalability when scaling to 96 GPUs, even obtaining super-linear speedups due to a distributed cache.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑