The traditional PageRank algorithm can not efficiently perform large data Webpage schedulingproblem. This paper proposes an accelerated algorithm named topK-Rank，which is based on PageRank on theMapReduce platform. It can find top k nodes efficiently for a given graph without sacrificing accuracy. In order toidentify top k nodes，topK-Rank algorithm prunes unnecessary nodes and edges in each iteration to dynamicallyconstruct subgraphs，and iteratively estimates lower/upper bounds of PageRank scores through subgraphs.Theoretical analysis shows that this method guarantees result exactness. Experiments show that topK-Rank algorithmcan find k nodes much faster than the existing approaches.