This paper presents a method of parallel program design on task graph. At first, the authors can produce a dataflow chart by analyzing a given problem to get the task graph, i. e., a representation of the parallel algorithm for the problem, and then,choose the topologic structure according the task graph, at last parallel program is written in parallel programming languages. This method is lucid and most of the parallel programs designed by the method are of high quality.