分治框架:未来 DDM 的合适设定
The Divide-and-Conquer Framework: A Suitable Setting for the DDM of the Future
AI总结:
本文基于数值实验发现已有算法加速比远超处理器数量,指出传统理想加速观念限制了领域分解方法(DDM)的发展,并提出以分治算法范式为基础的改进理论作为未来 DDM 的合适设定。
摘要:
本文源于我们进行的数值实验,在实验中,文献中已有的算法(DVS-BDDM)产生的加速(或加速比)比所用的处理器数量大许多倍(在已处理的一些示例中超过 70 倍,但可能通常大得多)。基于这些突出的结果,本文表明,相信标准的理想加速(即等于处理器数量)极大地限制了领域分解方法(DDM)研究所追求的性能目标,并迄今为止严重阻碍了其发展。因此,提出了一种改进的理论,其中加速目标基于分治算法范式,该范式常被视为领域分解方法的指导思想,被提议作为未来 DDM 的合适设定。
英文摘要:
This paper was prompted by numerical experiments we performed, in which algorithms already available in the literature (DVS-BDDM) yielded accelerations (or speedups) many times larger (more than seventy in some examples already treated, but probably often much larger) than the number of processors used. Based on these outstanding results, here it is shown that believing in the standard ideal speedup, which is taken to be equal to the number of processors, has limited much the performance goal sought by research on domain decomposition methods (DDM) and has hindered much its development, thus far. Hence, an improved theory in which the speedup goal is based on the Divide and Conquer algorithmic paradigm, frequently considered as the leitmotiv of domain decomposition methods, is proposed as a suitable setting for the DDM of the future.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。