Division by invariant integers using multiplication
PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
Cilk: an efficient multithreaded runtime system
Journal of Parallel and Distributed Computing - Special issue on multithreading for multiprocessors
Thread scheduling for multiprogrammed multiprocessors
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Modern computer algebra
On the genericity of the modular polynomial GCD algorithm
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
On efficient sparse integer matrix Smith normal form computations
Journal of Symbolic Computation - Special issue on computer algebra and mechanized reasoning: selected St. Andrews' ISSAC/Calculemus 2000 contributions
An output-sensitive variant of the baby steps/giant steps determinant algorithm
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Efficient computation of the characteristic polynomial
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Dynamic circular work-stealing deque
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Fast rational function reconstruction
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Faster algorithms for the characteristic polynomial
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
KAAPI: A thread scheduling runtime system for data flow computations on cluster of multi-processors
Proceedings of the 2007 international workshop on Parallel symbolic computation
Adaptive loops with kaapi on multicore and grid: applications in symmetric cryptography
Proceedings of the 2007 international workshop on Parallel symbolic computation
Dense Linear Algebra over Word-Size Prime Fields: the FFLAS and FFPACK Packages
ACM Transactions on Mathematical Software (TOMS)
Fine Grain Distributed Implementation of a Dataflow Language with Provable Performances
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part II
Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
LINBOX founding scope allocation, parallel building blocks, and separate compilation
ICMS'10 Proceedings of the Third international congress conference on Mathematical software
| Hi-index | 0.00 |
We propose a generic design for Chinese remainder algorithms. A Chinese remainder computation consists in reconstructing an integer value from its residues modulo 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 show that this design enables many different forms of Chinese remaindering (for example deterministic, early terminated, distributed, etc.); easy comparisons between these forms and user-transparent parallelism at different parallel grains.