Research on context-aware scheduling algorithms in pervasive computing environments

Due to the context of pervasive computing with time-sensitive, the system scheduling management module must support real-time scheduling of context-aware. When a context information acting on the high-level application, may make other emergency contexts in a wait state which is not conducive to real-time systems and efficient implementation in ubiquitous computing environment. In order to solve this problem, the paper proposed a context priority scheduling algorithm based on correlation, whose idea is to schedule on the basic of the correlation between different context elements, priority, average priority of several semantic contexts which consists of a number of context elements, its purpose is to speculate emergencies that about to happen next and better reflect the real-time systems and high efficiency. Experiments show that with an average priority context scheduling can reduce the average waiting time of CPU and increase CPU utilization.