中文排版方案的通用设计
Generic design of Chinese remaindering schemes
摘要:
我们提出了一个通用的设计,中国剩余算法。中国余项计算包括从其余项模非互质整数中重建整数值。我们还提出了一个有效的线性数据结构,一个基数阶梯,为中间存储和计算。我们的设计结构分为三个主要模块:一个黑盒剩余计算负责计算每个剩余;一个中国调度控制器负责启动计算和终止决策;一个整数生成器负责重建计算。然后,我们表明,这种设计使许多不同形式的中文浏览器(例如,确定性,提前终止,分布式等),这些形式之间的简单比较以及例如在不同并行粒度处的用户透明并行性。
英文摘要:
We propose a generic design for Chinese remainder algorithms. A Chinese remainder computation consists in reconstructing an integer value from its residues modulo non coprime integers. We also propose an efficient linear data structure, a radix ladder, for the intermediate storage and computations. Our design is structured into three main modules: a black box residue computation in charge of computing each residue; a Chinese remaindering controller in charge of launching the computation and of the termination decision; an integer builder in charge of the reconstruction computation. We then show that this design enables many different forms of Chinese remaindering (e.g. deterministic, early terminated, distributed, etc.), easy comparisons between these forms and e.g. user-transparent parallelism at different parallel grains.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。