File placement has always been a research hotspot in the field of distributed storage. The distributed file storage system HDFS places files by randomly selecting nodes, which leads to imbalance in accessing load. Researchers have proposed a large number of placement algorithms based on file popularity. However, file popularity is dynamically changing, and is difficult to accurately predict. This paper proposes a distributed file placement algorithm without depending on file popularity. According to the creation time of file and the correlation between creation time and file popularity, the algorithm firstly divides the time interval, and then counts the data of each node in different time intervals. It keeps the data of different nodes in the same time interval roughly the same. Experimental results show that the algorithm can balance not only the storage load, but also the access load on each node, and it eliminates the performance bottleneck caused by the uneven distribution of file popularity.