A NEW PRIORITY SCHEDULING ALGORITHM FOR MULTITASK BASE ON μC/OS-II

Jin Jinglin · Journal of South China Normal University · 2011

A new algorithm is presented,which reserves the time ascertainment and real-time characteristics of the current scheduling algorithm,and both the space complexity is independent of the number of tasks supported.So it is easy to let the number of tasks increase from 64 to 256 or more.

Read the paper · More papers on PaperTik