Enhanced fixed-priority real-time scheduling on multi-core platforms by exploiting task period relationship ?
The utilization bound of task sets increases as task periods are closer to harmonic. We present two scheduling algorithms for real-time tasks on multi-core platforms. We take the period relationship among tasks into consideration. We formally prove the schedulability of our proposed scheduling algorithms. The proposed algorithms significantly outperform the existing related work.
harmonic partitioned scheduling rms