The fact that earliest deadline first (EDF) scheduling algorithm behaves unpredictably during overload is an old and existing issue in the field of real time system. In this paper, a new software process scheduling algorithm for soft real time applications is presented. The algorithm is formulated by means of logical reasoning and excessive simulation method. This method is adopted due to the fact that the problem of scheduling a set of periodic task on single processor using non-preemptive scheme is NP-hard in the strong sense. The new algorithm, with inherently less computational complexity is found to improve in power consumption by almost 50 percent at the peak of practical overload which is at 150 percent of system load. At the same system load, the new algorithm also gives a minimum of 16 percent improvement in deadline meeting rate (DMTR) as compared to EDF. Design and formulation of the new algorithm along with graphical results of the power consumption level and the level of the deadline meeting rate of both algorithms will be presented and discuss in detail.