【摘要】 Bernstein提出的批分解算法(BERNSTEIN D J.How to find smooth parts of integers.[2013-08-05].http://cr.yp.to/factorization/smoothparts-20040510.pdf)能够快速完成给定光滑界B的一批随机整数的光滑性判断。然而该方法内存需求过于庞大,使得该算法广泛应用在理论分析阶段,实际应用却很少。为解决该问题,提出一种素数分段的方法,并据此提出一种层次化批分解算法云框架。该框架通过层次化的设计使得开发过程清晰简洁,具有较强的可移植性;借鉴自MapReduce的改进的云计算框架利用云客户端的分布存储和共享存储、消息机制等并行支撑平台提供的服务完成素数分段批分解算法的映射,解决了大规模Bernstein批分解算法空间需求过大的问题。实验结果显示,该框架能够适应素因子乘积规模由1.5 GB至192 GB的批分解运算,扩展性良好,增强了批分解算法的实用性。更多还原

【Abstract】 Bernstein’s Batch-factor algorithm( BERNSTEIN D J. How to find smooth parts of integers. [2013-08-05]. http: / / cr. yp. to / factorization / smoothparts-20040510. pdf) can test B-smoothness of a lot of integers in a short time. But this method costs much memory so that it is widely used in theory analyses but rarely used in practice. Based on splitting product of primes into pieces, a hierarchical batch-factor algorithm cloud framework was proposed to solve this problem. This hierarchical framework made the development clear and easy, and could be easily moved to other architectures. Cloud computing framework borrowed from MapReduce made use of services provided by cloud clients such as memory distribution, memory sharing and message to carry out mapping of splitting-primes batch factor algorithm, which solved the great cost of Bernstein’s method. The experimental results show that, this framework has good scalability and it can be adapted to different sizes batch factor in which the scale of prime product varies from 1. 5 GB to 192 GB, which enhances the usefulness of the algorithm significantly.更多还原