In response to a maximum of queries to meet the requests and the requirement for time limit, a real-time and multi-item scheduling is proposed. The scheduling strategy is divided into two levels, the first compute all queries’ priorities, which is derived from the number of requests for a data item and deadline miss rate; the second level to determine the data items’ order of the selected request. The experimental results shows that the proposed strategy gains better performance over the existing SIN algorithms on reducing the miss rate of deadline limit and the efficiency of scheduling.

Date Published: 14 March 2013
PDF: 5 pages
Proc. SPIE 8768, International Conference on Graphic and Image Processing (ICGIP 2012), 87687R (14 March 2013); doi: 10.1117/12.2002328

Published in SPIE Proceedings Vol. 8768:
International Conference on Graphic and Image Processing (ICGIP 2012)
Zeng Zhu, Editor(s)