A novel scheduling algorithm for multimedia tasks with low latency

With the rapid development of computer and multimedia technology, the rational scheduling of multimedia tasks has long been the research topic for the efficient utilization of computer resources. We consider multimedia scheduling to be soft real-time scheduling. Real-time multimedia is very sensitive to latency and jitter, and the classic scheduling algorithm determines the execution time of a task based on the worst Execution time (WCET), which reduces CPU utilization. This paper presents a new low-latency multimedia hybrid scheduling algorithm based on time reservation. The performance of this new algorithm and classical multimedia algorithm is compared by experiments. The results show that the algorithm is not only low jitter but also can adapt to the randomness of multimedia task execution time compared with classical algorithm.