Study of dynamic scheduling algorithm for embedded real-time web server
Jian Luo · Jisuanji gongcheng yu sheji · 2004
After researching the behavior properties of request on embedded real-time web server, all requests were divided into two classes: prior tasks and common tasks. Based on the classification, a new algorithm, which was titled as dynamic scheduling algorithm, was proposed under the M/M/1 /K queuing model in order to guarantee the prior tasks to be executed successfully. The algorithm could judge whether a common task would be put into the queue or not by the current situation of resource. Therefore prior tasks would be processed smoothly and safely. This algorithm has been adapted to schedule the tasks for remote experiment websit (www.remot-lab.net).