Abstract: Skip over model is an effective method to deal with overload It can reduce the overload of the system and can make the system degrade gracefully Deeply Red algorithm is a simple scheduling method which is based on the skip over model It considers neither the characteristics of tasks nor the CPU utilization Therefore its performance is very low In order to overcome its shortcomings, two algorithms are proposed: static unevenly distributed blue tasks （SUDB） and dynamic distributed blue tasks （DUDB） SUDB and DUDB improve their performance by reducing the interfering time among the higher priority tasks and the lower priority tasks The simulation results show that the performance of SUDB and DUDB are much higher than that of the Deeply Red