Scalable algorithms for the integerarithmetics and rational calculations in heterogeneous computation environment

Algorithmic analysis of large-scale problems that are sensitive to rounding errors requires precise rational calculations in the distributed computing environment. Enhanced efficiency of thesoftware my be gained to heterogeneous computing systems that perform local basic arithmeticoperations simultaneously using large number of ultralight threads. This paper examines thescalability algorithms for basic arithmetic operations and methods of its improvement. Thepossibility of increasing of the software efficiency using massive parallelism in heterogeneouscomputing systems is described. The use of reduntant number system allows you to performthe operation of algebraic addition in constant time and to construct scalable algorithms for allbasic arithmetic operations. Scalability of the basic integer arithmetic algorithms can be easilytransferred to a rational arithmetic.