New range reduction algorithm using 64-bit integer computation

Range reduction is widely used in the element function library and high performance computing applications. A new rang reduction algorithm and an improved one based on the Payne and Hanek Algorithm are proposed. Using the 64-bit integer arithmetic unit, all the intermediate computation is optimized for its Parallelism, table size and throughput, and the improved one base on it debases the complexity, and doesn't increase the table size using a pre-computed technology. The performance of the new algorithms gets above 50% improvement on the loongson2f platform through the experiment.