In prioritized graph computation, significant priority vertices are very likely to be executed far more often and are very likely to pass extra messages, which cause hot vertices. Based on this observation, we partition graph by distributing vertices with difference according to their hotness rather then blindly distributing vertices with equal wei