Abstract: In this paper,based on schedulability analysis of data flow graphs (DFG) with timing constraints, we introduce a hardware/software partitioning algorithm which takes into account contentions. Such an algorithm can lead to a more precise design space exploration, providing the designer an economic way to compare different partitions based on precise performance analysis and find optimal solution in short computation time.