Abstract: Within the methodology of example-based texture synthesis,the algorithms based on patch are hard to be parallelized due to their relatively high constraint between adjacent blocks.This paper follows one of the classic algorithms,transforming the problem of finding optimal synthesis path into a task scheduling problem,describing and extracting constraints from the problem,and then a spatial balanced schedule based on wavefront pattern is proposed in order to deal with the general 2D grid data.After that we put forward a scheduling algorithm for regular patch based texture synthesis which keeps the original constraints well,and perform our implement on a multi-core CPU.Analysis and experiment results are then given to prove the effectiveness of the solutions.