关键词: 集合理论, 计算机算法, Ramsey数求解, MapReduc模型, 单核CPU

Abstract: Aiming at the problem of low efficiency, high timeconsuming and large error in solving Ramsey number by the traditional singlecore DNA computer algorithm， the author proposed a Ramsey number algorithm based on set theory. The algorithm was based on the Phoenix++ system of the MapReduce model based on set theory. The author designed and optimized the Ramsey number algorithm for the complete graph under the singlcore CPU. Data preprocessing, efficient task segmentation and keyvalue pair planning were performed during optimization. The parallel algorithm based on set theory in Phoenix++ system was obtained. The Ramsey number was solved by DNA computer algorithm and its numerical value was verified to solve the Ramsey number. The experimental results show that the number of image processed by the program increases with the increase of the vertices. The proposed method has high accuracy in solving the Ramsey number, better maximum acceleration ratio and execution efficiency, and strong computational performance.

Key words: set theory, computer algorithm, Ramsey number solution,  , MapReduc model, singlecore CPU