Most of the scheduling algorithms were concentrated on scheduling of the packets. In the packet scheduling scheme Dynamic Multilevel Priority (DMP), the packets were scheduled in three priority queue priority level 1(pr1), Priority level 2(pr2), Priority level 3(pr3) respectively. In this scheme, pr1 is scheduled using(First Come First Serve) FCFS, pr2 and pr3contains non-real time task with remote and local task respectively were scheduled using preemptive scheduling. This result in the occurrence of starvation is because of the FCFS queue. The remedy for this problem is done by proposing a novel Important Task First(ITF) Scheduling Scheme. According to the proposed scheme, pr1 containing real time data is scheduled using Important Task First (ITF). Pr2containing non-real task with remote data were scheduled using (Earliest Deadline First) EDF and pr3 containing non-real time task with local data were scheduled using preemptive FCFS. Thus in the proposed scheme the starvation which occurred in DMP gets removedand there by the performance of the system gets improved. © International Science Press.