Stream processors are suitable for data parallel applications; the processor is supported by many simple processing units and high bandwidth routing among the units. By means of high density computing, the transfer latency is concealed, therefore the high speed data transfer and processing are able to be supported, making the performance of stream processors raise several or even hundreds of times comparing with general processors. Data stream scheduling is a relatively important problem in the research of stream processor. Methods that utilize the features of architecture topology to compute the weights on every edge are proposed. These methods are called as Stream Scheduling based on Topology Features (SSTF). SSTF mainly includes divide strategy and select strategy. Divide strategy is suitable for the architecture with light load. However, if there is heavy load, select strategy is used to assist divide strategy with the completion of data stream scheduling. A performance model of SSTF is built, which gives a consideration to the transfer time between nodes in one topology; and the way for selecting scheduling methods is suggested.