Abstract—The main objective of this paper is to develop a new algorithm for scheduling real time tasks. Real time scheduling algorithms such as rate monotonic and deadline monotonic plays an important role in scheduling real time tasks in a real time environment .There are some cases where may arise inconsistencies such as tasks having less task period but their execution is not very important. In this case, when scheduled under rate monotonic algorithm the cpu unnecessarily spends time in scheduling the tasks that are not uttermost importance. The proposed algorithm eliminate this drawback and combines the advantages of both Rate monotonic and Deadline monotonic algorithms. It also incorporates a priority component which is specified by the user which denotes the importance of tasks in the system.

Index Terms—Real time tasks, Rate monotonic, Deadline monotonic architecture, priority, deadlines, task periods

Yaashuwanth .C and Dr.R. Ramesh are with Department of Electrical and Electronics Engineering Anna University Chennai, Chennai 600 025. yaash_success@yahoo.co.in

Cite: Yaashuwanth C. and R. Ramesh, "A New Scheduling Algorithm  for  Real  Time  System,"  International
Journal of Computer and Electrical Engineering vol. 2, no. 6, pp. 1104-1106, 2010.