This paper analyzes and studies two classical packet scheduling algorithms

Max C/I and PF

which support non-real time services in the High Speed Downlink Packet Access（HSDPA） system.In view of the lack of system fairness in these algorithms

this paper proposes a HSDPA-based fast fairness packet scheduling algorithm.While ensuring both the instantaneous channel condition and average system throughput

this algorithm provides the users

whose average throughput is below a certain threshold

with opportunities for priority in service.Simulation results show that this algorithm can ensure long-term fairness among the users.