Generic design of Chinese remaindering schemes

TL;DR

This paper introduces a flexible, modular framework for Chinese remaindering algorithms, featuring a new data structure and supporting various forms including parallel and early-terminated methods.

Contribution

It presents a generic, structured design for Chinese remaindering with a novel radix ladder data structure, enabling diverse implementations and parallelism.

Findings

Supports multiple Chinese remaindering forms

Enables user-transparent parallelism

Provides an efficient radix ladder data structure

Abstract

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.