With the development of the computing ability of many-core processor, the acceleration of parallel programs on many-core has become the research focus. The network packet processing is an important application of large-scale parallel processing. Thus, many researchers have great interests on the acceleration of packet processing on many-core processor. We select the IP routing lookup algorithm as our target application. We have analyzed the feature of packet lookup algorithm based on binary tree and propose a novel parallel lookup algorithm SCMRL (Spm and Cache Mixed Routing Lookup). We describe the whole process of SCMRL in details. The results of experiments on Godson-T many-core architecture show the better performance than the baseline algorithm.