14 March 2013 A real-time scheduling strategy in on-demand broadcasting
Author Affiliations +
Proceedings Volume 8768, International Conference on Graphic and Image Processing (ICGIP 2012); 87687R (2013) https://doi.org/10.1117/12.2002328
Event: 2012 International Conference on Graphic and Image Processing, 2012, Singapore, Singapore
Abstract
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.
© (2013) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Xiaoqin Ma, Xiaoqin Ma, Li Yang, Li Yang, } "A real-time scheduling strategy in on-demand broadcasting", Proc. SPIE 8768, International Conference on Graphic and Image Processing (ICGIP 2012), 87687R (14 March 2013); doi: 10.1117/12.2002328; https://doi.org/10.1117/12.2002328
PROCEEDINGS
5 PAGES


SHARE
RELATED CONTENT

Shape space object recognition
Proceedings of SPIE (October 21 2001)
Data modeling for data mining
Proceedings of SPIE (March 11 2002)
Feature transformations and structure of attributes
Proceedings of SPIE (March 11 2002)

Back to Top