Dynamic scheduling algorithms for real-time multiprocessor systems are important components of real-time systems. The most important metric for real-time scheduling algorithms is scheduling success ratio. In this paper, based on the traditional myopic algorithm, a new dynamic scheduling algorithm, called‘hrift algorithm', is proposed for real-time multiprocessor systems. In this algorithm, a new processor selection policy is developed to improve scheduling success ratio. To study the effectiveness of thrift algorithm,an intensive simulation studyis made to analyze the impact of several task parameters on its scheduling success ratio and compare its performance to myopic algorithm.The simulation results show that the scheduling success ratio of our new scheduling algorthm is superior to thet of mypoic algorthm.