An information search interface with soft real-time guarantee

We propose an innovative solution to design the search interfaces of search engines with soft real-time guarantee. Our solution presents a new scheduling model to enable flexible relative deadline and a time prediction algorithm to overcome the uncertainty of varied execution time. The time prediction algorithm is also proved to be optimal if the elements of sampling vectors are independent. The results of the experiment show that this new model can fully utilize the processor with a very low ratio of task abortion.